/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-abd8500 [2020-01-16 17:48:01,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-01-16 17:48:01,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-01-16 17:48:01,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-01-16 17:48:01,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-01-16 17:48:01,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-01-16 17:48:01,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-01-16 17:48:01,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-01-16 17:48:01,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-01-16 17:48:01,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-01-16 17:48:01,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-01-16 17:48:01,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-01-16 17:48:01,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-01-16 17:48:01,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-01-16 17:48:01,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-01-16 17:48:01,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-01-16 17:48:01,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-01-16 17:48:01,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-01-16 17:48:01,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-01-16 17:48:01,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-01-16 17:48:01,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-01-16 17:48:01,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-01-16 17:48:01,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-01-16 17:48:01,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-01-16 17:48:01,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-01-16 17:48:01,808 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-01-16 17:48:01,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-01-16 17:48:01,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-01-16 17:48:01,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-01-16 17:48:01,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-01-16 17:48:01,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-01-16 17:48:01,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-01-16 17:48:01,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-01-16 17:48:01,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-01-16 17:48:01,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-01-16 17:48:01,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-01-16 17:48:01,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-01-16 17:48:01,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-01-16 17:48:01,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-01-16 17:48:01,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-01-16 17:48:01,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-01-16 17:48:01,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-01-16 17:48:01,854 INFO L113 SettingsManager]: Loading preferences was successful [2020-01-16 17:48:01,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-01-16 17:48:01,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-01-16 17:48:01,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-01-16 17:48:01,856 INFO L138 SettingsManager]: * Use SBE=true [2020-01-16 17:48:01,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-01-16 17:48:01,857 INFO L138 SettingsManager]: * sizeof long=4 [2020-01-16 17:48:01,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-01-16 17:48:01,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-01-16 17:48:01,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-01-16 17:48:01,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-01-16 17:48:01,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-01-16 17:48:01,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-01-16 17:48:01,858 INFO L138 SettingsManager]: * sizeof long double=12 [2020-01-16 17:48:01,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-01-16 17:48:01,858 INFO L138 SettingsManager]: * Use constant arrays=true [2020-01-16 17:48:01,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-01-16 17:48:01,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-01-16 17:48:01,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-01-16 17:48:01,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-01-16 17:48:01,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-01-16 17:48:01,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-01-16 17:48:01,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-01-16 17:48:01,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-01-16 17:48:01,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-01-16 17:48:01,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-01-16 17:48:01,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-01-16 17:48:01,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-01-16 17:48:01,861 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-01-16 17:48:01,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-01-16 17:48:02,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-01-16 17:48:02,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-01-16 17:48:02,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-01-16 17:48:02,184 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-01-16 17:48:02,185 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-01-16 17:48:02,186 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_10.bpl [2020-01-16 17:48:02,187 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_10.bpl' [2020-01-16 17:48:02,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-01-16 17:48:02,231 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-01-16 17:48:02,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-01-16 17:48:02,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-01-16 17:48:02,232 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-01-16 17:48:02,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 05:48:02" (1/1) ... [2020-01-16 17:48:02,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 05:48:02" (1/1) ... [2020-01-16 17:48:02,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-01-16 17:48:02,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-01-16 17:48:02,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-01-16 17:48:02,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-01-16 17:48:02,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 05:48:02" (1/1) ... [2020-01-16 17:48:02,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 05:48:02" (1/1) ... [2020-01-16 17:48:02,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 05:48:02" (1/1) ... [2020-01-16 17:48:02,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 05:48:02" (1/1) ... [2020-01-16 17:48:02,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 05:48:02" (1/1) ... [2020-01-16 17:48:02,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 05:48:02" (1/1) ... [2020-01-16 17:48:02,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 05:48:02" (1/1) ... [2020-01-16 17:48:02,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-01-16 17:48:02,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-01-16 17:48:02,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-01-16 17:48:02,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-01-16 17:48:02,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 05:48:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-01-16 17:48:02,371 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-01-16 17:48:02,371 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-01-16 17:48:02,373 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-01-16 17:48:02,373 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-01-16 17:48:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-01-16 17:48:02,374 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-01-16 17:48:02,374 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-01-16 17:48:02,374 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-01-16 17:48:02,375 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-01-16 17:48:02,375 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-01-16 17:48:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-01-16 17:48:02,375 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-01-16 17:48:02,375 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-01-16 17:48:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-01-16 17:48:02,376 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-01-16 17:48:02,376 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_9 given in one single declaration [2020-01-16 17:48:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure set_9 [2020-01-16 17:48:02,376 INFO L138 BoogieDeclarations]: Found implementation of procedure set_9 [2020-01-16 17:48:02,377 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-01-16 17:48:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-01-16 17:48:02,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-01-16 17:48:02,378 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-01-16 17:48:02,378 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-01-16 17:48:02,379 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-01-16 17:48:02,385 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-01-16 17:48:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-01-16 17:48:02,385 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-01-16 17:48:02,386 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-01-16 17:48:02,386 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-01-16 17:48:02,386 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-01-16 17:48:02,386 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_8 given in one single declaration [2020-01-16 17:48:02,387 INFO L130 BoogieDeclarations]: Found specification of procedure set_8 [2020-01-16 17:48:02,387 INFO L138 BoogieDeclarations]: Found implementation of procedure set_8 [2020-01-16 17:48:02,388 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-01-16 17:48:02,655 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-01-16 17:48:02,656 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2020-01-16 17:48:02,658 INFO L202 PluginConnector]: Adding new model example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 05:48:02 BoogieIcfgContainer [2020-01-16 17:48:02,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-01-16 17:48:02,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-01-16 17:48:02,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-01-16 17:48:02,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-01-16 17:48:02,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 16.01 05:48:02" (1/2) ... [2020-01-16 17:48:02,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254da107 and model type example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.01 05:48:02, skipping insertion in model container [2020-01-16 17:48:02,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.01 05:48:02" (2/2) ... [2020-01-16 17:48:02,684 INFO L109 eAbstractionObserver]: Analyzing ICFG example_10.bpl [2020-01-16 17:48:02,714 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-01-16 17:48:02,714 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-01-16 17:48:02,725 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-01-16 17:48:02,726 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-01-16 17:48:02,985 INFO L250 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2020-01-16 17:48:03,031 INFO L374 AbstractCegarLoop]: Interprodecural is true [2020-01-16 17:48:03,031 INFO L375 AbstractCegarLoop]: Hoare is true [2020-01-16 17:48:03,031 INFO L376 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-01-16 17:48:03,031 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-01-16 17:48:03,032 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-01-16 17:48:03,032 INFO L379 AbstractCegarLoop]: Difference is false [2020-01-16 17:48:03,032 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-01-16 17:48:03,032 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-01-16 17:48:03,061 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 143 transitions [2020-01-16 17:48:03,062 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 143 transitions [2020-01-16 17:48:06,696 INFO L129 PetriNetUnfolder]: 4097/5153 cut-off events. [2020-01-16 17:48:06,697 INFO L130 PetriNetUnfolder]: For 5120/5120 co-relation queries the response was YES. [2020-01-16 17:48:06,769 INFO L76 FinitePrefix]: Finished finitePrefix Result has 10304 conditions, 5153 events. 4097/5153 cut-off events. For 5120/5120 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 20915 event pairs. 0/5152 useless extension candidates. Maximal degree in co-relation 4655. Up to 1260 conditions per place. [2020-01-16 17:48:06,903 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 143 transitions [2020-01-16 17:48:10,755 INFO L129 PetriNetUnfolder]: 4097/5153 cut-off events. [2020-01-16 17:48:10,756 INFO L130 PetriNetUnfolder]: For 5120/5120 co-relation queries the response was YES. [2020-01-16 17:48:10,823 INFO L76 FinitePrefix]: Finished finitePrefix Result has 10304 conditions, 5153 events. 4097/5153 cut-off events. For 5120/5120 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 20915 event pairs. 0/5152 useless extension candidates. Maximal degree in co-relation 4655. Up to 1260 conditions per place. [2020-01-16 17:48:10,977 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3780 [2020-01-16 17:48:10,979 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-01-16 17:48:11,255 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1035 [2020-01-16 17:48:11,256 INFO L214 etLargeBlockEncoding]: Total number of compositions: 11 [2020-01-16 17:48:11,260 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 132 transitions [2020-01-16 17:48:25,624 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 60074 states. [2020-01-16 17:48:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 60074 states. [2020-01-16 17:48:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:48:25,937 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:48:25,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:48:25,938 INFO L426 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:48:25,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:48:25,945 INFO L82 PathProgramCache]: Analyzing trace with hash 661896340, now seen corresponding path program 1 times [2020-01-16 17:48:25,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:48:25,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788307929] [2020-01-16 17:48:25,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:48:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:48:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:48:26,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788307929] [2020-01-16 17:48:26,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:48:26,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 17:48:26,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153542081] [2020-01-16 17:48:26,122 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 17:48:26,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:48:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 17:48:26,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:26,140 INFO L87 Difference]: Start difference. First operand 60074 states. Second operand 3 states. [2020-01-16 17:48:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:48:27,005 INFO L93 Difference]: Finished difference Result 59562 states and 393662 transitions. [2020-01-16 17:48:27,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 17:48:27,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-01-16 17:48:27,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:48:27,568 INFO L225 Difference]: With dead ends: 59562 [2020-01-16 17:48:27,569 INFO L226 Difference]: Without dead ends: 59561 [2020-01-16 17:48:27,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59561 states. [2020-01-16 17:48:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59561 to 59561. [2020-01-16 17:48:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59561 states. [2020-01-16 17:48:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59561 states to 59561 states and 393661 transitions. [2020-01-16 17:48:35,202 INFO L78 Accepts]: Start accepts. Automaton has 59561 states and 393661 transitions. Word has length 31 [2020-01-16 17:48:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:48:35,203 INFO L478 AbstractCegarLoop]: Abstraction has 59561 states and 393661 transitions. [2020-01-16 17:48:35,204 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 17:48:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 59561 states and 393661 transitions. [2020-01-16 17:48:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:48:38,446 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:48:38,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:48:38,447 INFO L426 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:48:38,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:48:38,447 INFO L82 PathProgramCache]: Analyzing trace with hash 426637814, now seen corresponding path program 1 times [2020-01-16 17:48:38,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:48:38,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207991736] [2020-01-16 17:48:38,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:48:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:48:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:48:38,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207991736] [2020-01-16 17:48:38,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:48:38,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 17:48:38,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855749026] [2020-01-16 17:48:38,514 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 17:48:38,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:48:38,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 17:48:38,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:38,515 INFO L87 Difference]: Start difference. First operand 59561 states and 393661 transitions. Second operand 3 states. [2020-01-16 17:48:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:48:38,963 INFO L93 Difference]: Finished difference Result 46761 states and 293565 transitions. [2020-01-16 17:48:38,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 17:48:38,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-01-16 17:48:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:48:39,233 INFO L225 Difference]: With dead ends: 46761 [2020-01-16 17:48:39,234 INFO L226 Difference]: Without dead ends: 46761 [2020-01-16 17:48:39,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:41,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46761 states. [2020-01-16 17:48:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46761 to 46761. [2020-01-16 17:48:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46761 states. [2020-01-16 17:48:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46761 states to 46761 states and 293565 transitions. [2020-01-16 17:48:42,604 INFO L78 Accepts]: Start accepts. Automaton has 46761 states and 293565 transitions. Word has length 31 [2020-01-16 17:48:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:48:42,605 INFO L478 AbstractCegarLoop]: Abstraction has 46761 states and 293565 transitions. [2020-01-16 17:48:42,605 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 17:48:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 46761 states and 293565 transitions. [2020-01-16 17:48:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:48:42,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:48:42,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:48:42,707 INFO L426 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:48:42,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:48:42,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1161690204, now seen corresponding path program 1 times [2020-01-16 17:48:42,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:48:42,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345090630] [2020-01-16 17:48:42,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:48:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:48:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:48:42,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345090630] [2020-01-16 17:48:42,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:48:42,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 17:48:42,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738641859] [2020-01-16 17:48:42,742 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 17:48:42,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:48:42,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 17:48:42,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:42,743 INFO L87 Difference]: Start difference. First operand 46761 states and 293565 transitions. Second operand 3 states. [2020-01-16 17:48:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:48:43,588 INFO L93 Difference]: Finished difference Result 44201 states and 271549 transitions. [2020-01-16 17:48:43,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 17:48:43,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-01-16 17:48:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:48:43,840 INFO L225 Difference]: With dead ends: 44201 [2020-01-16 17:48:43,840 INFO L226 Difference]: Without dead ends: 44201 [2020-01-16 17:48:43,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44201 states. [2020-01-16 17:48:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44201 to 44201. [2020-01-16 17:48:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44201 states. [2020-01-16 17:48:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44201 states to 44201 states and 271549 transitions. [2020-01-16 17:48:49,383 INFO L78 Accepts]: Start accepts. Automaton has 44201 states and 271549 transitions. Word has length 31 [2020-01-16 17:48:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:48:49,383 INFO L478 AbstractCegarLoop]: Abstraction has 44201 states and 271549 transitions. [2020-01-16 17:48:49,383 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 17:48:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 44201 states and 271549 transitions. [2020-01-16 17:48:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:48:49,502 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:48:49,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:48:49,503 INFO L426 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:48:49,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:48:49,503 INFO L82 PathProgramCache]: Analyzing trace with hash 852645084, now seen corresponding path program 1 times [2020-01-16 17:48:49,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:48:49,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940563596] [2020-01-16 17:48:49,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:48:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:48:49,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-01-16 17:48:49,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940563596] [2020-01-16 17:48:49,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:48:49,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 17:48:49,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440521019] [2020-01-16 17:48:49,541 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 17:48:49,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:48:49,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 17:48:49,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:49,542 INFO L87 Difference]: Start difference. First operand 44201 states and 271549 transitions. Second operand 3 states. [2020-01-16 17:48:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:48:49,791 INFO L93 Difference]: Finished difference Result 38313 states and 225981 transitions. [2020-01-16 17:48:49,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 17:48:49,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-01-16 17:48:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:48:49,941 INFO L225 Difference]: With dead ends: 38313 [2020-01-16 17:48:49,941 INFO L226 Difference]: Without dead ends: 38313 [2020-01-16 17:48:49,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38313 states. [2020-01-16 17:48:52,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38313 to 38313. [2020-01-16 17:48:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38313 states. [2020-01-16 17:48:52,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38313 states to 38313 states and 225981 transitions. [2020-01-16 17:48:52,692 INFO L78 Accepts]: Start accepts. Automaton has 38313 states and 225981 transitions. Word has length 31 [2020-01-16 17:48:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:48:52,692 INFO L478 AbstractCegarLoop]: Abstraction has 38313 states and 225981 transitions. [2020-01-16 17:48:52,692 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 17:48:52,693 INFO L276 IsEmpty]: Start isEmpty. Operand 38313 states and 225981 transitions. [2020-01-16 17:48:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:48:52,771 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:48:52,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:48:52,771 INFO L426 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:48:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:48:52,772 INFO L82 PathProgramCache]: Analyzing trace with hash 567479930, now seen corresponding path program 1 times [2020-01-16 17:48:52,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:48:52,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782006021] [2020-01-16 17:48:52,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:48:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:48:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:48:52,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782006021] [2020-01-16 17:48:52,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:48:52,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 17:48:52,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244692200] [2020-01-16 17:48:52,803 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 17:48:52,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:48:52,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 17:48:52,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:52,804 INFO L87 Difference]: Start difference. First operand 38313 states and 225981 transitions. Second operand 3 states. [2020-01-16 17:48:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:48:52,973 INFO L93 Difference]: Finished difference Result 25961 states and 144061 transitions. [2020-01-16 17:48:52,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 17:48:52,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-01-16 17:48:52,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:48:53,050 INFO L225 Difference]: With dead ends: 25961 [2020-01-16 17:48:53,050 INFO L226 Difference]: Without dead ends: 25961 [2020-01-16 17:48:53,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25961 states. [2020-01-16 17:48:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25961 to 25961. [2020-01-16 17:48:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25961 states. [2020-01-16 17:48:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25961 states to 25961 states and 144061 transitions. [2020-01-16 17:48:56,733 INFO L78 Accepts]: Start accepts. Automaton has 25961 states and 144061 transitions. Word has length 31 [2020-01-16 17:48:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:48:56,733 INFO L478 AbstractCegarLoop]: Abstraction has 25961 states and 144061 transitions. [2020-01-16 17:48:56,733 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 17:48:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 25961 states and 144061 transitions. [2020-01-16 17:48:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:48:56,787 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:48:56,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:48:56,787 INFO L426 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:48:56,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:48:56,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1677176002, now seen corresponding path program 1 times [2020-01-16 17:48:56,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:48:56,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416009887] [2020-01-16 17:48:56,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:48:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:48:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:48:56,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416009887] [2020-01-16 17:48:56,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:48:56,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 17:48:56,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290665207] [2020-01-16 17:48:56,830 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 17:48:56,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:48:56,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 17:48:56,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:56,831 INFO L87 Difference]: Start difference. First operand 25961 states and 144061 transitions. Second operand 3 states. [2020-01-16 17:48:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:48:56,963 INFO L93 Difference]: Finished difference Result 15753 states and 82941 transitions. [2020-01-16 17:48:56,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 17:48:56,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-01-16 17:48:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:48:57,010 INFO L225 Difference]: With dead ends: 15753 [2020-01-16 17:48:57,011 INFO L226 Difference]: Without dead ends: 15753 [2020-01-16 17:48:57,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:57,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15753 states. [2020-01-16 17:48:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15753 to 15753. [2020-01-16 17:48:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15753 states. [2020-01-16 17:48:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15753 states to 15753 states and 82941 transitions. [2020-01-16 17:48:57,721 INFO L78 Accepts]: Start accepts. Automaton has 15753 states and 82941 transitions. Word has length 31 [2020-01-16 17:48:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:48:57,721 INFO L478 AbstractCegarLoop]: Abstraction has 15753 states and 82941 transitions. [2020-01-16 17:48:57,722 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 17:48:57,722 INFO L276 IsEmpty]: Start isEmpty. Operand 15753 states and 82941 transitions. [2020-01-16 17:48:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:48:57,750 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:48:57,750 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:48:57,751 INFO L426 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:48:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:48:57,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1856579948, now seen corresponding path program 1 times [2020-01-16 17:48:57,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:48:57,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198732276] [2020-01-16 17:48:57,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:48:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:48:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:48:57,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198732276] [2020-01-16 17:48:57,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:48:57,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 17:48:57,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962656556] [2020-01-16 17:48:57,776 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 17:48:57,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:48:57,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 17:48:57,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:57,778 INFO L87 Difference]: Start difference. First operand 15753 states and 82941 transitions. Second operand 3 states. [2020-01-16 17:48:57,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:48:57,846 INFO L93 Difference]: Finished difference Result 8825 states and 45229 transitions. [2020-01-16 17:48:57,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 17:48:57,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-01-16 17:48:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:48:57,870 INFO L225 Difference]: With dead ends: 8825 [2020-01-16 17:48:57,870 INFO L226 Difference]: Without dead ends: 8825 [2020-01-16 17:48:57,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8825 states. [2020-01-16 17:48:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8825 to 8825. [2020-01-16 17:48:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8825 states. [2020-01-16 17:48:58,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8825 states to 8825 states and 45229 transitions. [2020-01-16 17:48:58,697 INFO L78 Accepts]: Start accepts. Automaton has 8825 states and 45229 transitions. Word has length 31 [2020-01-16 17:48:58,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:48:58,698 INFO L478 AbstractCegarLoop]: Abstraction has 8825 states and 45229 transitions. [2020-01-16 17:48:58,698 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 17:48:58,698 INFO L276 IsEmpty]: Start isEmpty. Operand 8825 states and 45229 transitions. [2020-01-16 17:48:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:48:58,714 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:48:58,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:48:58,715 INFO L426 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:48:58,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:48:58,715 INFO L82 PathProgramCache]: Analyzing trace with hash 982570830, now seen corresponding path program 1 times [2020-01-16 17:48:58,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:48:58,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057678584] [2020-01-16 17:48:58,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:48:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:48:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:48:58,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057678584] [2020-01-16 17:48:58,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:48:58,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 17:48:58,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238779916] [2020-01-16 17:48:58,753 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 17:48:58,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:48:58,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 17:48:58,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:58,753 INFO L87 Difference]: Start difference. First operand 8825 states and 45229 transitions. Second operand 3 states. [2020-01-16 17:48:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:48:58,795 INFO L93 Difference]: Finished difference Result 5097 states and 25581 transitions. [2020-01-16 17:48:58,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 17:48:58,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-01-16 17:48:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:48:58,810 INFO L225 Difference]: With dead ends: 5097 [2020-01-16 17:48:58,810 INFO L226 Difference]: Without dead ends: 5097 [2020-01-16 17:48:58,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2020-01-16 17:48:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 5097. [2020-01-16 17:48:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5097 states. [2020-01-16 17:48:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5097 states to 5097 states and 25581 transitions. [2020-01-16 17:48:59,083 INFO L78 Accepts]: Start accepts. Automaton has 5097 states and 25581 transitions. Word has length 31 [2020-01-16 17:48:59,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:48:59,083 INFO L478 AbstractCegarLoop]: Abstraction has 5097 states and 25581 transitions. [2020-01-16 17:48:59,083 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 17:48:59,084 INFO L276 IsEmpty]: Start isEmpty. Operand 5097 states and 25581 transitions. [2020-01-16 17:48:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:48:59,092 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:48:59,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:48:59,093 INFO L426 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:48:59,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:48:59,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1054359614, now seen corresponding path program 1 times [2020-01-16 17:48:59,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:48:59,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086567738] [2020-01-16 17:48:59,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:48:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:48:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:48:59,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086567738] [2020-01-16 17:48:59,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:48:59,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-01-16 17:48:59,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963975971] [2020-01-16 17:48:59,132 INFO L458 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-01-16 17:48:59,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:48:59,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-01-16 17:48:59,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:59,134 INFO L87 Difference]: Start difference. First operand 5097 states and 25581 transitions. Second operand 3 states. [2020-01-16 17:48:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:48:59,159 INFO L93 Difference]: Finished difference Result 3071 states and 15361 transitions. [2020-01-16 17:48:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-01-16 17:48:59,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-01-16 17:48:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:48:59,168 INFO L225 Difference]: With dead ends: 3071 [2020-01-16 17:48:59,168 INFO L226 Difference]: Without dead ends: 3071 [2020-01-16 17:48:59,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-01-16 17:48:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2020-01-16 17:48:59,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3071. [2020-01-16 17:48:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2020-01-16 17:48:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 15361 transitions. [2020-01-16 17:48:59,362 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 15361 transitions. Word has length 31 [2020-01-16 17:48:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:48:59,362 INFO L478 AbstractCegarLoop]: Abstraction has 3071 states and 15361 transitions. [2020-01-16 17:48:59,362 INFO L479 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-01-16 17:48:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 15361 transitions. [2020-01-16 17:48:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:48:59,370 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:48:59,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:48:59,370 INFO L426 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:48:59,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:48:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash -605876662, now seen corresponding path program 1 times [2020-01-16 17:48:59,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:48:59,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070375833] [2020-01-16 17:48:59,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:48:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:00,252 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:49:00,393 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-01-16 17:49:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:00,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070375833] [2020-01-16 17:49:00,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:00,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:00,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942126261] [2020-01-16 17:49:00,410 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:00,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:00,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:00,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:00,411 INFO L87 Difference]: Start difference. First operand 3071 states and 15361 transitions. Second operand 12 states. [2020-01-16 17:49:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:00,710 INFO L93 Difference]: Finished difference Result 6095 states and 27102 transitions. [2020-01-16 17:49:00,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:00,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:00,726 INFO L225 Difference]: With dead ends: 6095 [2020-01-16 17:49:00,726 INFO L226 Difference]: Without dead ends: 6076 [2020-01-16 17:49:00,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-01-16 17:49:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3141. [2020-01-16 17:49:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-01-16 17:49:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15673 transitions. [2020-01-16 17:49:00,977 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15673 transitions. Word has length 31 [2020-01-16 17:49:00,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:00,977 INFO L478 AbstractCegarLoop]: Abstraction has 3141 states and 15673 transitions. [2020-01-16 17:49:00,977 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15673 transitions. [2020-01-16 17:49:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:00,984 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:00,985 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:00,985 INFO L426 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:00,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:00,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1873333840, now seen corresponding path program 2 times [2020-01-16 17:49:00,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:00,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190258979] [2020-01-16 17:49:00,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:01,771 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:49:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:01,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190258979] [2020-01-16 17:49:01,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:01,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:01,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529406029] [2020-01-16 17:49:01,783 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:01,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:01,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:01,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:01,784 INFO L87 Difference]: Start difference. First operand 3141 states and 15673 transitions. Second operand 12 states. [2020-01-16 17:49:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:02,148 INFO L93 Difference]: Finished difference Result 6096 states and 27096 transitions. [2020-01-16 17:49:02,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:02,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:02,167 INFO L225 Difference]: With dead ends: 6096 [2020-01-16 17:49:02,167 INFO L226 Difference]: Without dead ends: 6068 [2020-01-16 17:49:02,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-01-16 17:49:02,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 3133. [2020-01-16 17:49:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:49:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15651 transitions. [2020-01-16 17:49:02,463 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15651 transitions. Word has length 31 [2020-01-16 17:49:02,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:02,463 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15651 transitions. [2020-01-16 17:49:02,463 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15651 transitions. [2020-01-16 17:49:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:02,470 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:02,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:02,471 INFO L426 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:02,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:02,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1454499134, now seen corresponding path program 3 times [2020-01-16 17:49:02,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:02,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619427623] [2020-01-16 17:49:02,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:03,184 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:49:03,324 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-01-16 17:49:03,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:03,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619427623] [2020-01-16 17:49:03,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:03,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:03,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259621927] [2020-01-16 17:49:03,339 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:03,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:03,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:03,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:03,339 INFO L87 Difference]: Start difference. First operand 3133 states and 15651 transitions. Second operand 12 states. [2020-01-16 17:49:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:03,658 INFO L93 Difference]: Finished difference Result 6092 states and 27088 transitions. [2020-01-16 17:49:03,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:03,659 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:03,677 INFO L225 Difference]: With dead ends: 6092 [2020-01-16 17:49:03,677 INFO L226 Difference]: Without dead ends: 6073 [2020-01-16 17:49:03,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2020-01-16 17:49:04,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3140. [2020-01-16 17:49:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-01-16 17:49:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15664 transitions. [2020-01-16 17:49:04,167 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15664 transitions. Word has length 31 [2020-01-16 17:49:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:04,168 INFO L478 AbstractCegarLoop]: Abstraction has 3140 states and 15664 transitions. [2020-01-16 17:49:04,168 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15664 transitions. [2020-01-16 17:49:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:04,175 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:04,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:04,175 INFO L426 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash -116931920, now seen corresponding path program 4 times [2020-01-16 17:49:04,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:04,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046639567] [2020-01-16 17:49:04,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:04,928 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:49:04,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-01-16 17:49:04,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046639567] [2020-01-16 17:49:04,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:04,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:04,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218668866] [2020-01-16 17:49:04,939 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:04,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:04,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:04,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:04,940 INFO L87 Difference]: Start difference. First operand 3140 states and 15664 transitions. Second operand 12 states. [2020-01-16 17:49:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:05,229 INFO L93 Difference]: Finished difference Result 6091 states and 27079 transitions. [2020-01-16 17:49:05,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:05,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:05,248 INFO L225 Difference]: With dead ends: 6091 [2020-01-16 17:49:05,248 INFO L226 Difference]: Without dead ends: 6066 [2020-01-16 17:49:05,249 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2020-01-16 17:49:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 3133. [2020-01-16 17:49:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:49:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15644 transitions. [2020-01-16 17:49:05,495 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15644 transitions. Word has length 31 [2020-01-16 17:49:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:05,495 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15644 transitions. [2020-01-16 17:49:05,495 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15644 transitions. [2020-01-16 17:49:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:05,502 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:05,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:05,502 INFO L426 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:05,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:05,503 INFO L82 PathProgramCache]: Analyzing trace with hash 936544130, now seen corresponding path program 5 times [2020-01-16 17:49:05,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:05,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139606847] [2020-01-16 17:49:05,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:06,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139606847] [2020-01-16 17:49:06,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:06,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:06,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986982976] [2020-01-16 17:49:06,245 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:06,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:06,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:06,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:06,245 INFO L87 Difference]: Start difference. First operand 3133 states and 15644 transitions. Second operand 12 states. [2020-01-16 17:49:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:06,549 INFO L93 Difference]: Finished difference Result 6094 states and 27085 transitions. [2020-01-16 17:49:06,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:06,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:06,564 INFO L225 Difference]: With dead ends: 6094 [2020-01-16 17:49:06,564 INFO L226 Difference]: Without dead ends: 6074 [2020-01-16 17:49:06,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:06,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2020-01-16 17:49:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 3140. [2020-01-16 17:49:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-01-16 17:49:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15657 transitions. [2020-01-16 17:49:06,789 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15657 transitions. Word has length 31 [2020-01-16 17:49:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:06,789 INFO L478 AbstractCegarLoop]: Abstraction has 3140 states and 15657 transitions. [2020-01-16 17:49:06,789 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15657 transitions. [2020-01-16 17:49:06,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:06,795 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:06,795 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:06,795 INFO L426 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:06,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:06,795 INFO L82 PathProgramCache]: Analyzing trace with hash -753398774, now seen corresponding path program 6 times [2020-01-16 17:49:06,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:06,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245068787] [2020-01-16 17:49:06,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:07,483 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:07,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-01-16 17:49:07,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245068787] [2020-01-16 17:49:07,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:07,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:07,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113552681] [2020-01-16 17:49:07,496 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:07,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:07,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:07,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:07,497 INFO L87 Difference]: Start difference. First operand 3140 states and 15657 transitions. Second operand 12 states. [2020-01-16 17:49:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:07,796 INFO L93 Difference]: Finished difference Result 6092 states and 27074 transitions. [2020-01-16 17:49:07,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:07,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:07,811 INFO L225 Difference]: With dead ends: 6092 [2020-01-16 17:49:07,811 INFO L226 Difference]: Without dead ends: 6060 [2020-01-16 17:49:07,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2020-01-16 17:49:08,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 3126. [2020-01-16 17:49:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:49:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15624 transitions. [2020-01-16 17:49:08,036 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15624 transitions. Word has length 31 [2020-01-16 17:49:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:08,036 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15624 transitions. [2020-01-16 17:49:08,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15624 transitions. [2020-01-16 17:49:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:08,041 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:08,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:08,042 INFO L426 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:08,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1138487344, now seen corresponding path program 7 times [2020-01-16 17:49:08,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:08,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212084663] [2020-01-16 17:49:08,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:08,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212084663] [2020-01-16 17:49:08,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:08,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:08,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486273728] [2020-01-16 17:49:08,767 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:08,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:08,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:08,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:08,767 INFO L87 Difference]: Start difference. First operand 3126 states and 15624 transitions. Second operand 12 states. [2020-01-16 17:49:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:09,035 INFO L93 Difference]: Finished difference Result 6109 states and 27126 transitions. [2020-01-16 17:49:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:09,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:09,049 INFO L225 Difference]: With dead ends: 6109 [2020-01-16 17:49:09,050 INFO L226 Difference]: Without dead ends: 6090 [2020-01-16 17:49:09,050 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2020-01-16 17:49:09,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 3145. [2020-01-16 17:49:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2020-01-16 17:49:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 15676 transitions. [2020-01-16 17:49:09,276 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 15676 transitions. Word has length 31 [2020-01-16 17:49:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:09,277 INFO L478 AbstractCegarLoop]: Abstraction has 3145 states and 15676 transitions. [2020-01-16 17:49:09,277 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 15676 transitions. [2020-01-16 17:49:09,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:09,282 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:09,282 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:09,282 INFO L426 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:09,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:09,283 INFO L82 PathProgramCache]: Analyzing trace with hash -128969834, now seen corresponding path program 8 times [2020-01-16 17:49:09,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:09,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611224760] [2020-01-16 17:49:09,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:09,918 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:49:10,056 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:49:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:10,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611224760] [2020-01-16 17:49:10,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:10,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:10,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027846848] [2020-01-16 17:49:10,069 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:10,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:10,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:10,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:10,070 INFO L87 Difference]: Start difference. First operand 3145 states and 15676 transitions. Second operand 12 states. [2020-01-16 17:49:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:10,354 INFO L93 Difference]: Finished difference Result 6110 states and 27120 transitions. [2020-01-16 17:49:10,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:10,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:10,372 INFO L225 Difference]: With dead ends: 6110 [2020-01-16 17:49:10,372 INFO L226 Difference]: Without dead ends: 6082 [2020-01-16 17:49:10,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6082 states. [2020-01-16 17:49:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6082 to 3137. [2020-01-16 17:49:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-01-16 17:49:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15653 transitions. [2020-01-16 17:49:10,603 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15653 transitions. Word has length 31 [2020-01-16 17:49:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:10,604 INFO L478 AbstractCegarLoop]: Abstraction has 3137 states and 15653 transitions. [2020-01-16 17:49:10,604 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15653 transitions. [2020-01-16 17:49:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:10,609 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:10,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:10,609 INFO L426 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:10,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:10,610 INFO L82 PathProgramCache]: Analyzing trace with hash -346601982, now seen corresponding path program 9 times [2020-01-16 17:49:10,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:10,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059840016] [2020-01-16 17:49:10,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:11,377 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:49:11,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:11,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059840016] [2020-01-16 17:49:11,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:11,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:11,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331218336] [2020-01-16 17:49:11,388 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:11,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:11,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:11,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:11,389 INFO L87 Difference]: Start difference. First operand 3137 states and 15653 transitions. Second operand 12 states. [2020-01-16 17:49:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:11,677 INFO L93 Difference]: Finished difference Result 6112 states and 27123 transitions. [2020-01-16 17:49:11,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:11,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:11,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:11,693 INFO L225 Difference]: With dead ends: 6112 [2020-01-16 17:49:11,693 INFO L226 Difference]: Without dead ends: 6093 [2020-01-16 17:49:11,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6093 states. [2020-01-16 17:49:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6093 to 3146. [2020-01-16 17:49:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-01-16 17:49:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15670 transitions. [2020-01-16 17:49:11,921 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15670 transitions. Word has length 31 [2020-01-16 17:49:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:11,921 INFO L478 AbstractCegarLoop]: Abstraction has 3146 states and 15670 transitions. [2020-01-16 17:49:11,921 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15670 transitions. [2020-01-16 17:49:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:11,927 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:11,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:11,927 INFO L426 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:11,927 INFO L82 PathProgramCache]: Analyzing trace with hash -276491946, now seen corresponding path program 10 times [2020-01-16 17:49:11,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:11,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220958163] [2020-01-16 17:49:11,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:12,416 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-01-16 17:49:12,548 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-01-16 17:49:12,682 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:49:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:12,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220958163] [2020-01-16 17:49:12,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:12,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:12,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074460605] [2020-01-16 17:49:12,693 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:12,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:12,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:12,694 INFO L87 Difference]: Start difference. First operand 3146 states and 15670 transitions. Second operand 12 states. [2020-01-16 17:49:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:12,913 INFO L93 Difference]: Finished difference Result 6115 states and 27120 transitions. [2020-01-16 17:49:12,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:12,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:12,928 INFO L225 Difference]: With dead ends: 6115 [2020-01-16 17:49:12,929 INFO L226 Difference]: Without dead ends: 6084 [2020-01-16 17:49:12,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-01-16 17:49:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 3137. [2020-01-16 17:49:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-01-16 17:49:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15644 transitions. [2020-01-16 17:49:13,161 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15644 transitions. Word has length 31 [2020-01-16 17:49:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:13,162 INFO L478 AbstractCegarLoop]: Abstraction has 3137 states and 15644 transitions. [2020-01-16 17:49:13,162 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15644 transitions. [2020-01-16 17:49:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:13,167 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:13,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:13,168 INFO L426 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:13,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:13,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2044441282, now seen corresponding path program 11 times [2020-01-16 17:49:13,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:13,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540868994] [2020-01-16 17:49:13,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:13,760 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:49:13,886 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:49:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:13,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540868994] [2020-01-16 17:49:13,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:13,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:13,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008437090] [2020-01-16 17:49:13,897 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:13,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:13,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:13,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:13,897 INFO L87 Difference]: Start difference. First operand 3137 states and 15644 transitions. Second operand 12 states. [2020-01-16 17:49:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:14,173 INFO L93 Difference]: Finished difference Result 6116 states and 27122 transitions. [2020-01-16 17:49:14,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:14,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:14,189 INFO L225 Difference]: With dead ends: 6116 [2020-01-16 17:49:14,190 INFO L226 Difference]: Without dead ends: 6096 [2020-01-16 17:49:14,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:14,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6096 states. [2020-01-16 17:49:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6096 to 3148. [2020-01-16 17:49:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2020-01-16 17:49:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 15664 transitions. [2020-01-16 17:49:14,414 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 15664 transitions. Word has length 31 [2020-01-16 17:49:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:14,414 INFO L478 AbstractCegarLoop]: Abstraction has 3148 states and 15664 transitions. [2020-01-16 17:49:14,415 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 15664 transitions. [2020-01-16 17:49:14,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:14,420 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:14,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:14,420 INFO L426 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:14,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:14,420 INFO L82 PathProgramCache]: Analyzing trace with hash -912958800, now seen corresponding path program 12 times [2020-01-16 17:49:14,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:14,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113777528] [2020-01-16 17:49:14,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:15,021 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-01-16 17:49:15,166 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2020-01-16 17:49:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:15,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113777528] [2020-01-16 17:49:15,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:15,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:15,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608320171] [2020-01-16 17:49:15,179 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:15,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:15,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:15,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:15,180 INFO L87 Difference]: Start difference. First operand 3148 states and 15664 transitions. Second operand 12 states. [2020-01-16 17:49:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:15,545 INFO L93 Difference]: Finished difference Result 6118 states and 27116 transitions. [2020-01-16 17:49:15,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:15,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:15,560 INFO L225 Difference]: With dead ends: 6118 [2020-01-16 17:49:15,560 INFO L226 Difference]: Without dead ends: 6074 [2020-01-16 17:49:15,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2020-01-16 17:49:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 3126. [2020-01-16 17:49:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:49:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15614 transitions. [2020-01-16 17:49:15,828 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15614 transitions. Word has length 31 [2020-01-16 17:49:15,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:15,828 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15614 transitions. [2020-01-16 17:49:15,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:15,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15614 transitions. [2020-01-16 17:49:15,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:15,835 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:15,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:15,835 INFO L426 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:15,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:15,835 INFO L82 PathProgramCache]: Analyzing trace with hash -247627984, now seen corresponding path program 13 times [2020-01-16 17:49:15,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:15,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357230986] [2020-01-16 17:49:15,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:16,404 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:49:16,537 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:49:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:16,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357230986] [2020-01-16 17:49:16,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:16,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:16,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713769758] [2020-01-16 17:49:16,549 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:16,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:16,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:16,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:16,550 INFO L87 Difference]: Start difference. First operand 3126 states and 15614 transitions. Second operand 12 states. [2020-01-16 17:49:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:16,926 INFO L93 Difference]: Finished difference Result 6097 states and 27088 transitions. [2020-01-16 17:49:16,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:16,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:16,940 INFO L225 Difference]: With dead ends: 6097 [2020-01-16 17:49:16,941 INFO L226 Difference]: Without dead ends: 6078 [2020-01-16 17:49:16,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2020-01-16 17:49:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 3141. [2020-01-16 17:49:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-01-16 17:49:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15657 transitions. [2020-01-16 17:49:17,164 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15657 transitions. Word has length 31 [2020-01-16 17:49:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:17,164 INFO L478 AbstractCegarLoop]: Abstraction has 3141 states and 15657 transitions. [2020-01-16 17:49:17,164 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15657 transitions. [2020-01-16 17:49:17,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:17,169 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:17,169 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:17,170 INFO L426 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:17,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:17,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1089939230, now seen corresponding path program 14 times [2020-01-16 17:49:17,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:17,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432839841] [2020-01-16 17:49:17,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:17,777 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:49:17,910 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:17,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432839841] [2020-01-16 17:49:17,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:17,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:17,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617905372] [2020-01-16 17:49:17,921 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:17,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:17,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:17,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:17,923 INFO L87 Difference]: Start difference. First operand 3141 states and 15657 transitions. Second operand 12 states. [2020-01-16 17:49:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:18,260 INFO L93 Difference]: Finished difference Result 6096 states and 27079 transitions. [2020-01-16 17:49:18,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:18,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:18,275 INFO L225 Difference]: With dead ends: 6096 [2020-01-16 17:49:18,276 INFO L226 Difference]: Without dead ends: 6071 [2020-01-16 17:49:18,276 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-01-16 17:49:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3134. [2020-01-16 17:49:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:49:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15637 transitions. [2020-01-16 17:49:18,499 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15637 transitions. Word has length 31 [2020-01-16 17:49:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:18,500 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15637 transitions. [2020-01-16 17:49:18,500 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15637 transitions. [2020-01-16 17:49:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:18,505 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:18,505 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:18,505 INFO L426 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:18,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:18,505 INFO L82 PathProgramCache]: Analyzing trace with hash -884094838, now seen corresponding path program 15 times [2020-01-16 17:49:18,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:18,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073298617] [2020-01-16 17:49:18,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:19,112 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:49:19,246 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:49:19,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-01-16 17:49:19,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073298617] [2020-01-16 17:49:19,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:19,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:19,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18127419] [2020-01-16 17:49:19,257 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:19,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:19,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:19,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:19,257 INFO L87 Difference]: Start difference. First operand 3134 states and 15637 transitions. Second operand 12 states. [2020-01-16 17:49:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:19,547 INFO L93 Difference]: Finished difference Result 6103 states and 27093 transitions. [2020-01-16 17:49:19,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:19,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:19,561 INFO L225 Difference]: With dead ends: 6103 [2020-01-16 17:49:19,561 INFO L226 Difference]: Without dead ends: 6084 [2020-01-16 17:49:19,562 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-01-16 17:49:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 3143. [2020-01-16 17:49:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-01-16 17:49:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15654 transitions. [2020-01-16 17:49:19,785 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15654 transitions. Word has length 31 [2020-01-16 17:49:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:19,785 INFO L478 AbstractCegarLoop]: Abstraction has 3143 states and 15654 transitions. [2020-01-16 17:49:19,785 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15654 transitions. [2020-01-16 17:49:19,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:19,791 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:19,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:19,791 INFO L426 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:19,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:19,791 INFO L82 PathProgramCache]: Analyzing trace with hash -813984802, now seen corresponding path program 16 times [2020-01-16 17:49:19,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:19,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603787254] [2020-01-16 17:49:19,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:20,397 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-01-16 17:49:20,530 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:49:20,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-01-16 17:49:20,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603787254] [2020-01-16 17:49:20,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:20,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:20,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835535104] [2020-01-16 17:49:20,539 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:20,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:20,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:20,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:20,540 INFO L87 Difference]: Start difference. First operand 3143 states and 15654 transitions. Second operand 12 states. [2020-01-16 17:49:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:20,737 INFO L93 Difference]: Finished difference Result 6106 states and 27090 transitions. [2020-01-16 17:49:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:20,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:20,753 INFO L225 Difference]: With dead ends: 6106 [2020-01-16 17:49:20,753 INFO L226 Difference]: Without dead ends: 6075 [2020-01-16 17:49:20,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6075 states. [2020-01-16 17:49:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6075 to 3134. [2020-01-16 17:49:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:49:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15629 transitions. [2020-01-16 17:49:20,978 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15629 transitions. Word has length 31 [2020-01-16 17:49:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:20,978 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15629 transitions. [2020-01-16 17:49:20,978 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15629 transitions. [2020-01-16 17:49:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:20,983 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:20,983 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:20,984 INFO L426 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:20,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1031616950, now seen corresponding path program 17 times [2020-01-16 17:49:20,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:20,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446514732] [2020-01-16 17:49:20,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:21,535 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:49:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:21,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446514732] [2020-01-16 17:49:21,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:21,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:21,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608565881] [2020-01-16 17:49:21,675 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:21,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:21,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:21,676 INFO L87 Difference]: Start difference. First operand 3134 states and 15629 transitions. Second operand 12 states. [2020-01-16 17:49:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:21,939 INFO L93 Difference]: Finished difference Result 6100 states and 27078 transitions. [2020-01-16 17:49:21,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:21,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:21,954 INFO L225 Difference]: With dead ends: 6100 [2020-01-16 17:49:21,955 INFO L226 Difference]: Without dead ends: 6082 [2020-01-16 17:49:21,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6082 states. [2020-01-16 17:49:22,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6082 to 3142. [2020-01-16 17:49:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-01-16 17:49:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15644 transitions. [2020-01-16 17:49:22,177 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15644 transitions. Word has length 31 [2020-01-16 17:49:22,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:22,178 INFO L478 AbstractCegarLoop]: Abstraction has 3142 states and 15644 transitions. [2020-01-16 17:49:22,178 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15644 transitions. [2020-01-16 17:49:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:22,183 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:22,183 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:22,183 INFO L426 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:22,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1995893168, now seen corresponding path program 18 times [2020-01-16 17:49:22,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:22,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643279348] [2020-01-16 17:49:22,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:22,762 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-01-16 17:49:22,894 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:22,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643279348] [2020-01-16 17:49:22,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:22,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:22,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226264934] [2020-01-16 17:49:22,905 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:22,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:22,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:22,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:22,905 INFO L87 Difference]: Start difference. First operand 3142 states and 15644 transitions. Second operand 12 states. [2020-01-16 17:49:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:23,097 INFO L93 Difference]: Finished difference Result 6104 states and 27078 transitions. [2020-01-16 17:49:23,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:23,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:23,112 INFO L225 Difference]: With dead ends: 6104 [2020-01-16 17:49:23,112 INFO L226 Difference]: Without dead ends: 6066 [2020-01-16 17:49:23,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2020-01-16 17:49:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 3126. [2020-01-16 17:49:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:49:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15606 transitions. [2020-01-16 17:49:23,342 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15606 transitions. Word has length 31 [2020-01-16 17:49:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:23,342 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15606 transitions. [2020-01-16 17:49:23,342 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15606 transitions. [2020-01-16 17:49:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:23,348 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:23,348 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:23,348 INFO L426 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:23,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:23,348 INFO L82 PathProgramCache]: Analyzing trace with hash -407188010, now seen corresponding path program 19 times [2020-01-16 17:49:23,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:23,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908529258] [2020-01-16 17:49:23,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:23,933 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:49:24,063 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:24,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908529258] [2020-01-16 17:49:24,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:24,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:24,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657622965] [2020-01-16 17:49:24,074 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:24,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:24,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:24,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:24,075 INFO L87 Difference]: Start difference. First operand 3126 states and 15606 transitions. Second operand 12 states. [2020-01-16 17:49:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:24,306 INFO L93 Difference]: Finished difference Result 6103 states and 27092 transitions. [2020-01-16 17:49:24,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:24,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:24,321 INFO L225 Difference]: With dead ends: 6103 [2020-01-16 17:49:24,321 INFO L226 Difference]: Without dead ends: 6083 [2020-01-16 17:49:24,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6083 states. [2020-01-16 17:49:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6083 to 3142. [2020-01-16 17:49:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-01-16 17:49:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15651 transitions. [2020-01-16 17:49:24,559 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15651 transitions. Word has length 31 [2020-01-16 17:49:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:24,559 INFO L478 AbstractCegarLoop]: Abstraction has 3142 states and 15651 transitions. [2020-01-16 17:49:24,559 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15651 transitions. [2020-01-16 17:49:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:24,565 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:24,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:24,565 INFO L426 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:24,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:24,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2097130914, now seen corresponding path program 20 times [2020-01-16 17:49:24,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:24,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559708232] [2020-01-16 17:49:24,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:25,154 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:49:25,283 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:25,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559708232] [2020-01-16 17:49:25,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:25,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:25,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459454565] [2020-01-16 17:49:25,293 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:25,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:25,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:25,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:25,294 INFO L87 Difference]: Start difference. First operand 3142 states and 15651 transitions. Second operand 12 states. [2020-01-16 17:49:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:25,515 INFO L93 Difference]: Finished difference Result 6101 states and 27081 transitions. [2020-01-16 17:49:25,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:25,516 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:25,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:25,530 INFO L225 Difference]: With dead ends: 6101 [2020-01-16 17:49:25,530 INFO L226 Difference]: Without dead ends: 6076 [2020-01-16 17:49:25,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-01-16 17:49:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3135. [2020-01-16 17:49:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:49:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15631 transitions. [2020-01-16 17:49:25,759 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15631 transitions. Word has length 31 [2020-01-16 17:49:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:25,759 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15631 transitions. [2020-01-16 17:49:25,759 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15631 transitions. [2020-01-16 17:49:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:25,765 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:25,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:25,765 INFO L426 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:25,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:25,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1043654864, now seen corresponding path program 21 times [2020-01-16 17:49:25,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:25,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902693436] [2020-01-16 17:49:25,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:26,484 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:26,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902693436] [2020-01-16 17:49:26,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:26,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:26,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048391193] [2020-01-16 17:49:26,495 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:26,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:26,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:26,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:26,496 INFO L87 Difference]: Start difference. First operand 3135 states and 15631 transitions. Second operand 12 states. [2020-01-16 17:49:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:26,767 INFO L93 Difference]: Finished difference Result 6111 states and 27101 transitions. [2020-01-16 17:49:26,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:26,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:26,788 INFO L225 Difference]: With dead ends: 6111 [2020-01-16 17:49:26,789 INFO L226 Difference]: Without dead ends: 6091 [2020-01-16 17:49:26,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6091 states. [2020-01-16 17:49:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6091 to 3146. [2020-01-16 17:49:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-01-16 17:49:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15651 transitions. [2020-01-16 17:49:27,065 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15651 transitions. Word has length 31 [2020-01-16 17:49:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:27,065 INFO L478 AbstractCegarLoop]: Abstraction has 3146 states and 15651 transitions. [2020-01-16 17:49:27,065 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15651 transitions. [2020-01-16 17:49:27,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:27,070 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:27,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:27,070 INFO L426 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:27,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:27,071 INFO L82 PathProgramCache]: Analyzing trace with hash 293912350, now seen corresponding path program 22 times [2020-01-16 17:49:27,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:27,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437607228] [2020-01-16 17:49:27,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:27,677 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:49:27,831 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:49:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:27,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437607228] [2020-01-16 17:49:27,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:27,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:27,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822326438] [2020-01-16 17:49:27,842 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:27,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:27,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:27,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:27,843 INFO L87 Difference]: Start difference. First operand 3146 states and 15651 transitions. Second operand 12 states. [2020-01-16 17:49:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:28,034 INFO L93 Difference]: Finished difference Result 6113 states and 27095 transitions. [2020-01-16 17:49:28,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:28,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:28,049 INFO L225 Difference]: With dead ends: 6113 [2020-01-16 17:49:28,049 INFO L226 Difference]: Without dead ends: 6080 [2020-01-16 17:49:28,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6080 states. [2020-01-16 17:49:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6080 to 3135. [2020-01-16 17:49:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:49:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15622 transitions. [2020-01-16 17:49:28,316 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15622 transitions. Word has length 31 [2020-01-16 17:49:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:28,316 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15622 transitions. [2020-01-16 17:49:28,316 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15622 transitions. [2020-01-16 17:49:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:28,322 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:28,322 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:28,322 INFO L426 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:28,322 INFO L82 PathProgramCache]: Analyzing trace with hash 712747056, now seen corresponding path program 23 times [2020-01-16 17:49:28,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:28,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951657544] [2020-01-16 17:49:28,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:28,887 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:49:29,017 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:49:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:29,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951657544] [2020-01-16 17:49:29,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:29,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:29,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566589117] [2020-01-16 17:49:29,028 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:29,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:29,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:29,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:29,028 INFO L87 Difference]: Start difference. First operand 3135 states and 15622 transitions. Second operand 12 states. [2020-01-16 17:49:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:29,270 INFO L93 Difference]: Finished difference Result 6104 states and 27077 transitions. [2020-01-16 17:49:29,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:29,270 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:29,285 INFO L225 Difference]: With dead ends: 6104 [2020-01-16 17:49:29,285 INFO L226 Difference]: Without dead ends: 6086 [2020-01-16 17:49:29,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6086 states. [2020-01-16 17:49:29,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6086 to 3143. [2020-01-16 17:49:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-01-16 17:49:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15637 transitions. [2020-01-16 17:49:29,509 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15637 transitions. Word has length 31 [2020-01-16 17:49:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:29,509 INFO L478 AbstractCegarLoop]: Abstraction has 3143 states and 15637 transitions. [2020-01-16 17:49:29,509 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15637 transitions. [2020-01-16 17:49:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:29,515 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:29,515 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:29,515 INFO L426 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:29,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:29,515 INFO L82 PathProgramCache]: Analyzing trace with hash -554710122, now seen corresponding path program 24 times [2020-01-16 17:49:29,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:29,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285643739] [2020-01-16 17:49:29,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:30,094 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:49:30,222 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:49:30,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-01-16 17:49:30,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285643739] [2020-01-16 17:49:30,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:30,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:30,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676695159] [2020-01-16 17:49:30,234 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:30,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:30,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:30,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:30,234 INFO L87 Difference]: Start difference. First operand 3143 states and 15637 transitions. Second operand 12 states. [2020-01-16 17:49:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:30,430 INFO L93 Difference]: Finished difference Result 6108 states and 27077 transitions. [2020-01-16 17:49:30,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:30,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:30,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:30,447 INFO L225 Difference]: With dead ends: 6108 [2020-01-16 17:49:30,447 INFO L226 Difference]: Without dead ends: 6058 [2020-01-16 17:49:30,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-01-16 17:49:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3115. [2020-01-16 17:49:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-01-16 17:49:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15577 transitions. [2020-01-16 17:49:30,672 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15577 transitions. Word has length 31 [2020-01-16 17:49:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:30,673 INFO L478 AbstractCegarLoop]: Abstraction has 3115 states and 15577 transitions. [2020-01-16 17:49:30,673 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15577 transitions. [2020-01-16 17:49:30,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:30,679 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:30,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:30,679 INFO L426 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:30,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:30,680 INFO L82 PathProgramCache]: Analyzing trace with hash -365158536, now seen corresponding path program 25 times [2020-01-16 17:49:30,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:30,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420466126] [2020-01-16 17:49:30,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:31,237 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:49:31,379 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:49:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:31,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420466126] [2020-01-16 17:49:31,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:31,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:31,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289289364] [2020-01-16 17:49:31,390 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:31,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:31,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:31,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:31,390 INFO L87 Difference]: Start difference. First operand 3115 states and 15577 transitions. Second operand 12 states. [2020-01-16 17:49:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:31,624 INFO L93 Difference]: Finished difference Result 6061 states and 27001 transitions. [2020-01-16 17:49:31,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:31,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:31,639 INFO L225 Difference]: With dead ends: 6061 [2020-01-16 17:49:31,639 INFO L226 Difference]: Without dead ends: 6042 [2020-01-16 17:49:31,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-01-16 17:49:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3135. [2020-01-16 17:49:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:49:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15644 transitions. [2020-01-16 17:49:31,863 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15644 transitions. Word has length 31 [2020-01-16 17:49:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:31,863 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15644 transitions. [2020-01-16 17:49:31,863 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15644 transitions. [2020-01-16 17:49:31,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:31,868 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:31,868 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:31,869 INFO L426 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:31,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:31,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1632615714, now seen corresponding path program 26 times [2020-01-16 17:49:31,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:31,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439134452] [2020-01-16 17:49:31,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:32,550 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:32,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-01-16 17:49:32,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439134452] [2020-01-16 17:49:32,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:32,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:32,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872993288] [2020-01-16 17:49:32,561 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:32,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:32,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:32,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:32,562 INFO L87 Difference]: Start difference. First operand 3135 states and 15644 transitions. Second operand 12 states. [2020-01-16 17:49:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:32,812 INFO L93 Difference]: Finished difference Result 6062 states and 26995 transitions. [2020-01-16 17:49:32,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:32,813 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:32,828 INFO L225 Difference]: With dead ends: 6062 [2020-01-16 17:49:32,828 INFO L226 Difference]: Without dead ends: 6034 [2020-01-16 17:49:32,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-01-16 17:49:33,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3127. [2020-01-16 17:49:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:49:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15623 transitions. [2020-01-16 17:49:33,049 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15623 transitions. Word has length 31 [2020-01-16 17:49:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:33,049 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15623 transitions. [2020-01-16 17:49:33,049 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15623 transitions. [2020-01-16 17:49:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:33,054 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:33,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:33,055 INFO L426 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:33,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:33,055 INFO L82 PathProgramCache]: Analyzing trace with hash -789469772, now seen corresponding path program 27 times [2020-01-16 17:49:33,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:33,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117138657] [2020-01-16 17:49:33,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:33,497 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2020-01-16 17:49:33,679 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-01-16 17:49:33,804 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:49:33,935 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:49:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:33,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117138657] [2020-01-16 17:49:33,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:33,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:33,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753711930] [2020-01-16 17:49:33,946 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:33,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:33,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:33,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:33,946 INFO L87 Difference]: Start difference. First operand 3127 states and 15623 transitions. Second operand 12 states. [2020-01-16 17:49:34,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:34,186 INFO L93 Difference]: Finished difference Result 6056 states and 26983 transitions. [2020-01-16 17:49:34,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:34,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:34,201 INFO L225 Difference]: With dead ends: 6056 [2020-01-16 17:49:34,201 INFO L226 Difference]: Without dead ends: 6037 [2020-01-16 17:49:34,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-01-16 17:49:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3133. [2020-01-16 17:49:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:49:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15634 transitions. [2020-01-16 17:49:34,425 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15634 transitions. Word has length 31 [2020-01-16 17:49:34,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:34,425 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15634 transitions. [2020-01-16 17:49:34,425 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15634 transitions. [2020-01-16 17:49:34,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:34,430 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:34,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:34,430 INFO L426 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:34,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:34,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1393068894, now seen corresponding path program 28 times [2020-01-16 17:49:34,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:34,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906487210] [2020-01-16 17:49:34,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:35,165 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:49:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:35,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906487210] [2020-01-16 17:49:35,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:35,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:35,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502986514] [2020-01-16 17:49:35,176 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:35,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:35,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:35,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:35,176 INFO L87 Difference]: Start difference. First operand 3133 states and 15634 transitions. Second operand 12 states. [2020-01-16 17:49:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:35,416 INFO L93 Difference]: Finished difference Result 6054 states and 26973 transitions. [2020-01-16 17:49:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:35,416 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:35,431 INFO L225 Difference]: With dead ends: 6054 [2020-01-16 17:49:35,432 INFO L226 Difference]: Without dead ends: 6031 [2020-01-16 17:49:35,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-01-16 17:49:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3127. [2020-01-16 17:49:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:49:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15617 transitions. [2020-01-16 17:49:35,659 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15617 transitions. Word has length 31 [2020-01-16 17:49:35,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:35,659 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15617 transitions. [2020-01-16 17:49:35,659 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15617 transitions. [2020-01-16 17:49:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:35,664 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:35,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:35,665 INFO L426 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:35,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1601573492, now seen corresponding path program 29 times [2020-01-16 17:49:35,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:35,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430401435] [2020-01-16 17:49:35,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:36,238 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:49:36,374 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:36,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430401435] [2020-01-16 17:49:36,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:36,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:36,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769417099] [2020-01-16 17:49:36,385 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:36,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:36,385 INFO L87 Difference]: Start difference. First operand 3127 states and 15617 transitions. Second operand 12 states. [2020-01-16 17:49:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:36,663 INFO L93 Difference]: Finished difference Result 6058 states and 26981 transitions. [2020-01-16 17:49:36,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:36,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:36,680 INFO L225 Difference]: With dead ends: 6058 [2020-01-16 17:49:36,680 INFO L226 Difference]: Without dead ends: 6038 [2020-01-16 17:49:36,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:36,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-01-16 17:49:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3133. [2020-01-16 17:49:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:49:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15628 transitions. [2020-01-16 17:49:36,901 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15628 transitions. Word has length 31 [2020-01-16 17:49:36,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:36,901 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15628 transitions. [2020-01-16 17:49:36,901 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15628 transitions. [2020-01-16 17:49:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:36,909 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:36,909 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:36,909 INFO L426 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:36,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:36,909 INFO L82 PathProgramCache]: Analyzing trace with hash 756602040, now seen corresponding path program 30 times [2020-01-16 17:49:36,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:36,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207699650] [2020-01-16 17:49:36,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:37,459 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:49:37,594 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:37,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-01-16 17:49:37,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207699650] [2020-01-16 17:49:37,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:37,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:37,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952572073] [2020-01-16 17:49:37,604 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:37,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:37,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:37,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:37,605 INFO L87 Difference]: Start difference. First operand 3133 states and 15628 transitions. Second operand 12 states. [2020-01-16 17:49:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:37,883 INFO L93 Difference]: Finished difference Result 6055 states and 26969 transitions. [2020-01-16 17:49:37,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:37,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:37,899 INFO L225 Difference]: With dead ends: 6055 [2020-01-16 17:49:37,899 INFO L226 Difference]: Without dead ends: 6026 [2020-01-16 17:49:37,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-01-16 17:49:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3121. [2020-01-16 17:49:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:49:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15600 transitions. [2020-01-16 17:49:38,125 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15600 transitions. Word has length 31 [2020-01-16 17:49:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:38,125 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15600 transitions. [2020-01-16 17:49:38,125 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15600 transitions. [2020-01-16 17:49:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:38,130 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:38,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:38,131 INFO L426 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:38,131 INFO L82 PathProgramCache]: Analyzing trace with hash -633904964, now seen corresponding path program 31 times [2020-01-16 17:49:38,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:38,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60672834] [2020-01-16 17:49:38,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:38,706 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:49:38,838 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-01-16 17:49:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:38,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60672834] [2020-01-16 17:49:38,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:38,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:38,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229839489] [2020-01-16 17:49:38,849 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:38,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:38,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:38,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:38,849 INFO L87 Difference]: Start difference. First operand 3121 states and 15600 transitions. Second operand 12 states. [2020-01-16 17:49:39,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:39,082 INFO L93 Difference]: Finished difference Result 6065 states and 27007 transitions. [2020-01-16 17:49:39,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:39,083 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:39,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:39,097 INFO L225 Difference]: With dead ends: 6065 [2020-01-16 17:49:39,097 INFO L226 Difference]: Without dead ends: 6046 [2020-01-16 17:49:39,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-01-16 17:49:39,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3136. [2020-01-16 17:49:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-01-16 17:49:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15642 transitions. [2020-01-16 17:49:39,321 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15642 transitions. Word has length 31 [2020-01-16 17:49:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:39,321 INFO L478 AbstractCegarLoop]: Abstraction has 3136 states and 15642 transitions. [2020-01-16 17:49:39,321 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15642 transitions. [2020-01-16 17:49:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:39,326 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:39,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:39,326 INFO L426 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:39,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1901362142, now seen corresponding path program 32 times [2020-01-16 17:49:39,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:39,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504901728] [2020-01-16 17:49:39,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:40,007 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:49:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:40,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504901728] [2020-01-16 17:49:40,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:40,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:40,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713244486] [2020-01-16 17:49:40,018 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:40,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:40,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:40,018 INFO L87 Difference]: Start difference. First operand 3136 states and 15642 transitions. Second operand 12 states. [2020-01-16 17:49:40,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:40,264 INFO L93 Difference]: Finished difference Result 6066 states and 27001 transitions. [2020-01-16 17:49:40,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:40,264 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:40,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:40,279 INFO L225 Difference]: With dead ends: 6066 [2020-01-16 17:49:40,279 INFO L226 Difference]: Without dead ends: 6038 [2020-01-16 17:49:40,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-01-16 17:49:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3128. [2020-01-16 17:49:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:49:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15620 transitions. [2020-01-16 17:49:40,516 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15620 transitions. Word has length 31 [2020-01-16 17:49:40,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:40,516 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15620 transitions. [2020-01-16 17:49:40,516 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15620 transitions. [2020-01-16 17:49:40,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:40,522 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:40,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:40,522 INFO L426 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1482527436, now seen corresponding path program 33 times [2020-01-16 17:49:40,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:40,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235686545] [2020-01-16 17:49:40,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:41,104 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:49:41,234 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-01-16 17:49:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:41,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235686545] [2020-01-16 17:49:41,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:41,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:41,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464180502] [2020-01-16 17:49:41,244 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:41,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:41,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:41,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:41,245 INFO L87 Difference]: Start difference. First operand 3128 states and 15620 transitions. Second operand 12 states. [2020-01-16 17:49:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:41,509 INFO L93 Difference]: Finished difference Result 6062 states and 26993 transitions. [2020-01-16 17:49:41,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:41,509 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:41,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:41,524 INFO L225 Difference]: With dead ends: 6062 [2020-01-16 17:49:41,524 INFO L226 Difference]: Without dead ends: 6043 [2020-01-16 17:49:41,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:41,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-01-16 17:49:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3135. [2020-01-16 17:49:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:49:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15633 transitions. [2020-01-16 17:49:41,752 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15633 transitions. Word has length 31 [2020-01-16 17:49:41,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:41,752 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15633 transitions. [2020-01-16 17:49:41,752 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15633 transitions. [2020-01-16 17:49:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:41,758 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:41,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:41,758 INFO L426 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:41,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:41,758 INFO L82 PathProgramCache]: Analyzing trace with hash -144960222, now seen corresponding path program 34 times [2020-01-16 17:49:41,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:41,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392937319] [2020-01-16 17:49:41,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:42,463 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:49:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:42,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392937319] [2020-01-16 17:49:42,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:42,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:42,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674938214] [2020-01-16 17:49:42,474 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:42,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:42,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:42,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:42,474 INFO L87 Difference]: Start difference. First operand 3135 states and 15633 transitions. Second operand 12 states. [2020-01-16 17:49:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:42,835 INFO L93 Difference]: Finished difference Result 6061 states and 26984 transitions. [2020-01-16 17:49:42,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:42,836 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:42,851 INFO L225 Difference]: With dead ends: 6061 [2020-01-16 17:49:42,851 INFO L226 Difference]: Without dead ends: 6036 [2020-01-16 17:49:42,851 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-01-16 17:49:43,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3128. [2020-01-16 17:49:43,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:49:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15613 transitions. [2020-01-16 17:49:43,077 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15613 transitions. Word has length 31 [2020-01-16 17:49:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:43,077 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15613 transitions. [2020-01-16 17:49:43,078 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15613 transitions. [2020-01-16 17:49:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:43,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:43,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:43,084 INFO L426 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash 908515828, now seen corresponding path program 35 times [2020-01-16 17:49:43,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:43,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538008684] [2020-01-16 17:49:43,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:43,784 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:43,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538008684] [2020-01-16 17:49:43,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:43,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:43,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786727266] [2020-01-16 17:49:43,794 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:43,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:43,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:43,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:43,795 INFO L87 Difference]: Start difference. First operand 3128 states and 15613 transitions. Second operand 12 states. [2020-01-16 17:49:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:44,039 INFO L93 Difference]: Finished difference Result 6064 states and 26990 transitions. [2020-01-16 17:49:44,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:44,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:44,055 INFO L225 Difference]: With dead ends: 6064 [2020-01-16 17:49:44,055 INFO L226 Difference]: Without dead ends: 6044 [2020-01-16 17:49:44,056 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2020-01-16 17:49:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 3135. [2020-01-16 17:49:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:49:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15626 transitions. [2020-01-16 17:49:44,284 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15626 transitions. Word has length 31 [2020-01-16 17:49:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:44,284 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15626 transitions. [2020-01-16 17:49:44,285 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15626 transitions. [2020-01-16 17:49:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:44,290 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:44,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:44,290 INFO L426 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:44,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash -781427076, now seen corresponding path program 36 times [2020-01-16 17:49:44,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:44,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823332729] [2020-01-16 17:49:44,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:44,990 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:44,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-01-16 17:49:44,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823332729] [2020-01-16 17:49:45,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:45,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:45,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160536658] [2020-01-16 17:49:45,000 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:45,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:45,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:45,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:45,001 INFO L87 Difference]: Start difference. First operand 3135 states and 15626 transitions. Second operand 12 states. [2020-01-16 17:49:45,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:45,243 INFO L93 Difference]: Finished difference Result 6062 states and 26979 transitions. [2020-01-16 17:49:45,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:45,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:45,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:45,259 INFO L225 Difference]: With dead ends: 6062 [2020-01-16 17:49:45,259 INFO L226 Difference]: Without dead ends: 6030 [2020-01-16 17:49:45,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-01-16 17:49:45,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3121. [2020-01-16 17:49:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:49:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15594 transitions. [2020-01-16 17:49:45,486 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15594 transitions. Word has length 31 [2020-01-16 17:49:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:45,486 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15594 transitions. [2020-01-16 17:49:45,486 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15594 transitions. [2020-01-16 17:49:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:45,491 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:45,492 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:45,492 INFO L426 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1326962628, now seen corresponding path program 37 times [2020-01-16 17:49:45,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:45,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117265254] [2020-01-16 17:49:45,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:46,062 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:49:46,189 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:49:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:46,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117265254] [2020-01-16 17:49:46,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:46,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:46,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189548001] [2020-01-16 17:49:46,199 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:46,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:46,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:46,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:46,199 INFO L87 Difference]: Start difference. First operand 3121 states and 15594 transitions. Second operand 12 states. [2020-01-16 17:49:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:46,454 INFO L93 Difference]: Finished difference Result 6053 states and 26970 transitions. [2020-01-16 17:49:46,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:46,455 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:46,469 INFO L225 Difference]: With dead ends: 6053 [2020-01-16 17:49:46,469 INFO L226 Difference]: Without dead ends: 6034 [2020-01-16 17:49:46,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-01-16 17:49:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3133. [2020-01-16 17:49:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:49:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15628 transitions. [2020-01-16 17:49:46,693 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15628 transitions. Word has length 31 [2020-01-16 17:49:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:46,693 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15628 transitions. [2020-01-16 17:49:46,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15628 transitions. [2020-01-16 17:49:46,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:46,698 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:46,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:46,699 INFO L426 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:46,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:46,699 INFO L82 PathProgramCache]: Analyzing trace with hash 855576038, now seen corresponding path program 38 times [2020-01-16 17:49:46,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:46,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833074150] [2020-01-16 17:49:46,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:47,429 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:49:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:47,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833074150] [2020-01-16 17:49:47,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:47,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:47,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409333706] [2020-01-16 17:49:47,439 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:47,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:47,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:47,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:47,439 INFO L87 Difference]: Start difference. First operand 3133 states and 15628 transitions. Second operand 12 states. [2020-01-16 17:49:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:47,701 INFO L93 Difference]: Finished difference Result 6051 states and 26960 transitions. [2020-01-16 17:49:47,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:47,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:47,717 INFO L225 Difference]: With dead ends: 6051 [2020-01-16 17:49:47,717 INFO L226 Difference]: Without dead ends: 6028 [2020-01-16 17:49:47,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-01-16 17:49:47,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3127. [2020-01-16 17:49:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:49:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15611 transitions. [2020-01-16 17:49:47,994 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15611 transitions. Word has length 31 [2020-01-16 17:49:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:47,994 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15611 transitions. [2020-01-16 17:49:47,994 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15611 transitions. [2020-01-16 17:49:47,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:47,999 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:47,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:48,000 INFO L426 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:48,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:48,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1751273864, now seen corresponding path program 39 times [2020-01-16 17:49:48,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:48,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491397477] [2020-01-16 17:49:48,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:48,568 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:49:48,698 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-01-16 17:49:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:48,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491397477] [2020-01-16 17:49:48,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:48,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:48,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618506752] [2020-01-16 17:49:48,709 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:48,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:48,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:48,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:48,710 INFO L87 Difference]: Start difference. First operand 3127 states and 15611 transitions. Second operand 12 states. [2020-01-16 17:49:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:48,992 INFO L93 Difference]: Finished difference Result 6055 states and 26969 transitions. [2020-01-16 17:49:48,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:48,993 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:49,008 INFO L225 Difference]: With dead ends: 6055 [2020-01-16 17:49:49,008 INFO L226 Difference]: Without dead ends: 6036 [2020-01-16 17:49:49,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-01-16 17:49:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3134. [2020-01-16 17:49:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:49:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15624 transitions. [2020-01-16 17:49:49,232 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15624 transitions. Word has length 31 [2020-01-16 17:49:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:49,232 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15624 transitions. [2020-01-16 17:49:49,232 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15624 transitions. [2020-01-16 17:49:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:49,237 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:49,237 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:49,237 INFO L426 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:49,238 INFO L82 PathProgramCache]: Analyzing trace with hash -413706650, now seen corresponding path program 40 times [2020-01-16 17:49:49,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:49,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591902740] [2020-01-16 17:49:49,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:50,032 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:49:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:50,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591902740] [2020-01-16 17:49:50,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:50,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:50,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106763872] [2020-01-16 17:49:50,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:50,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:50,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:50,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:50,043 INFO L87 Difference]: Start difference. First operand 3134 states and 15624 transitions. Second operand 12 states. [2020-01-16 17:49:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:50,312 INFO L93 Difference]: Finished difference Result 6054 states and 26960 transitions. [2020-01-16 17:49:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:50,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:50,327 INFO L225 Difference]: With dead ends: 6054 [2020-01-16 17:49:50,327 INFO L226 Difference]: Without dead ends: 6029 [2020-01-16 17:49:50,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2020-01-16 17:49:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3127. [2020-01-16 17:49:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:49:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15605 transitions. [2020-01-16 17:49:50,555 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15605 transitions. Word has length 31 [2020-01-16 17:49:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:50,556 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15605 transitions. [2020-01-16 17:49:50,556 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15605 transitions. [2020-01-16 17:49:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:50,562 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:50,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:50,562 INFO L426 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:50,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:50,562 INFO L82 PathProgramCache]: Analyzing trace with hash -629513288, now seen corresponding path program 41 times [2020-01-16 17:49:50,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:50,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171889615] [2020-01-16 17:49:50,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:51,263 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:49:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:51,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171889615] [2020-01-16 17:49:51,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:51,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:51,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428505597] [2020-01-16 17:49:51,274 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:51,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:51,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:51,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:51,274 INFO L87 Difference]: Start difference. First operand 3127 states and 15605 transitions. Second operand 12 states. [2020-01-16 17:49:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:51,520 INFO L93 Difference]: Finished difference Result 6050 states and 26952 transitions. [2020-01-16 17:49:51,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:51,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:51,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:51,538 INFO L225 Difference]: With dead ends: 6050 [2020-01-16 17:49:51,538 INFO L226 Difference]: Without dead ends: 6033 [2020-01-16 17:49:51,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-01-16 17:49:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3133. [2020-01-16 17:49:51,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:49:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15616 transitions. [2020-01-16 17:49:51,764 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15616 transitions. Word has length 31 [2020-01-16 17:49:51,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:51,765 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15616 transitions. [2020-01-16 17:49:51,765 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15616 transitions. [2020-01-16 17:49:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:51,770 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:51,770 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:51,770 INFO L426 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:51,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:51,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1474484740, now seen corresponding path program 42 times [2020-01-16 17:49:51,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:51,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379524132] [2020-01-16 17:49:51,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:52,333 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:49:52,462 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:49:52,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-01-16 17:49:52,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379524132] [2020-01-16 17:49:52,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:52,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:52,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357964558] [2020-01-16 17:49:52,472 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:52,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:52,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:52,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:52,473 INFO L87 Difference]: Start difference. First operand 3133 states and 15616 transitions. Second operand 12 states. [2020-01-16 17:49:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:52,745 INFO L93 Difference]: Finished difference Result 6051 states and 26948 transitions. [2020-01-16 17:49:52,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:52,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:52,761 INFO L225 Difference]: With dead ends: 6051 [2020-01-16 17:49:52,762 INFO L226 Difference]: Without dead ends: 6021 [2020-01-16 17:49:52,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2020-01-16 17:49:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 3121. [2020-01-16 17:49:52,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:49:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15588 transitions. [2020-01-16 17:49:52,983 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15588 transitions. Word has length 31 [2020-01-16 17:49:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:52,983 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15588 transitions. [2020-01-16 17:49:52,983 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15588 transitions. [2020-01-16 17:49:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:52,989 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:52,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:52,989 INFO L426 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:52,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1486522654, now seen corresponding path program 43 times [2020-01-16 17:49:52,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:52,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145865918] [2020-01-16 17:49:52,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:53,537 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:49:53,669 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:53,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145865918] [2020-01-16 17:49:53,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:53,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:53,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478502356] [2020-01-16 17:49:53,679 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:53,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:53,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:53,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:53,680 INFO L87 Difference]: Start difference. First operand 3121 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:49:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:53,969 INFO L93 Difference]: Finished difference Result 6056 states and 26970 transitions. [2020-01-16 17:49:53,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:53,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:53,985 INFO L225 Difference]: With dead ends: 6056 [2020-01-16 17:49:53,985 INFO L226 Difference]: Without dead ends: 6036 [2020-01-16 17:49:53,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-01-16 17:49:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3133. [2020-01-16 17:49:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:49:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15622 transitions. [2020-01-16 17:49:54,209 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15622 transitions. Word has length 31 [2020-01-16 17:49:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:54,209 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15622 transitions. [2020-01-16 17:49:54,209 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15622 transitions. [2020-01-16 17:49:54,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:54,215 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:54,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:54,215 INFO L426 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:54,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:54,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1963473190, now seen corresponding path program 44 times [2020-01-16 17:49:54,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:54,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196957923] [2020-01-16 17:49:54,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:54,779 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:49:54,910 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:54,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196957923] [2020-01-16 17:49:54,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:54,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:54,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301582997] [2020-01-16 17:49:54,920 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:54,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:54,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:54,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:54,921 INFO L87 Difference]: Start difference. First operand 3133 states and 15622 transitions. Second operand 12 states. [2020-01-16 17:49:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:55,242 INFO L93 Difference]: Finished difference Result 6053 states and 26958 transitions. [2020-01-16 17:49:55,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:55,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:55,257 INFO L225 Difference]: With dead ends: 6053 [2020-01-16 17:49:55,257 INFO L226 Difference]: Without dead ends: 6030 [2020-01-16 17:49:55,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-01-16 17:49:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3127. [2020-01-16 17:49:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:49:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15605 transitions. [2020-01-16 17:49:55,485 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15605 transitions. Word has length 31 [2020-01-16 17:49:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:55,486 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15605 transitions. [2020-01-16 17:49:55,486 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15605 transitions. [2020-01-16 17:49:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:55,491 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:55,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:55,491 INFO L426 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:55,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:55,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1910833890, now seen corresponding path program 45 times [2020-01-16 17:49:55,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:55,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842124297] [2020-01-16 17:49:55,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:56,049 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:49:56,176 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:56,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-01-16 17:49:56,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842124297] [2020-01-16 17:49:56,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:56,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:56,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124408311] [2020-01-16 17:49:56,186 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:56,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:56,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:56,187 INFO L87 Difference]: Start difference. First operand 3127 states and 15605 transitions. Second operand 12 states. [2020-01-16 17:49:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:56,509 INFO L93 Difference]: Finished difference Result 6058 states and 26969 transitions. [2020-01-16 17:49:56,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:56,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:56,524 INFO L225 Difference]: With dead ends: 6058 [2020-01-16 17:49:56,525 INFO L226 Difference]: Without dead ends: 6038 [2020-01-16 17:49:56,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-01-16 17:49:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3134. [2020-01-16 17:49:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:49:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15618 transitions. [2020-01-16 17:49:56,753 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15618 transitions. Word has length 31 [2020-01-16 17:49:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:56,753 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15618 transitions. [2020-01-16 17:49:56,753 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15618 transitions. [2020-01-16 17:49:56,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:56,758 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:56,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:56,758 INFO L426 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:56,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:56,759 INFO L82 PathProgramCache]: Analyzing trace with hash 694190502, now seen corresponding path program 46 times [2020-01-16 17:49:56,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:56,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561261938] [2020-01-16 17:49:56,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:57,428 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:57,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561261938] [2020-01-16 17:49:57,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:57,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:57,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349236570] [2020-01-16 17:49:57,439 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:57,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:57,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:57,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:57,439 INFO L87 Difference]: Start difference. First operand 3134 states and 15618 transitions. Second operand 12 states. [2020-01-16 17:49:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:57,684 INFO L93 Difference]: Finished difference Result 6056 states and 26958 transitions. [2020-01-16 17:49:57,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:57,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:57,700 INFO L225 Difference]: With dead ends: 6056 [2020-01-16 17:49:57,700 INFO L226 Difference]: Without dead ends: 6031 [2020-01-16 17:49:57,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-01-16 17:49:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3127. [2020-01-16 17:49:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:49:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15599 transitions. [2020-01-16 17:49:57,926 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15599 transitions. Word has length 31 [2020-01-16 17:49:57,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:57,926 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15599 transitions. [2020-01-16 17:49:57,926 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15599 transitions. [2020-01-16 17:49:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:57,931 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:57,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:57,932 INFO L426 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1114850718, now seen corresponding path program 47 times [2020-01-16 17:49:57,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:57,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521363608] [2020-01-16 17:49:57,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:58,503 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:49:58,636 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:58,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-01-16 17:49:58,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521363608] [2020-01-16 17:49:58,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:58,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:58,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409814883] [2020-01-16 17:49:58,646 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:58,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:58,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:58,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:58,647 INFO L87 Difference]: Start difference. First operand 3127 states and 15599 transitions. Second operand 12 states. [2020-01-16 17:49:58,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:49:58,982 INFO L93 Difference]: Finished difference Result 6051 states and 26948 transitions. [2020-01-16 17:49:58,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:49:58,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:49:58,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:49:59,000 INFO L225 Difference]: With dead ends: 6051 [2020-01-16 17:49:59,001 INFO L226 Difference]: Without dead ends: 6034 [2020-01-16 17:49:59,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:49:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-01-16 17:49:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3133. [2020-01-16 17:49:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:49:59,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15610 transitions. [2020-01-16 17:49:59,234 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15610 transitions. Word has length 31 [2020-01-16 17:49:59,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:49:59,234 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15610 transitions. [2020-01-16 17:49:59,234 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:49:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15610 transitions. [2020-01-16 17:49:59,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:49:59,239 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:49:59,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:49:59,239 INFO L426 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:49:59,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:49:59,240 INFO L82 PathProgramCache]: Analyzing trace with hash 269879266, now seen corresponding path program 48 times [2020-01-16 17:49:59,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:49:59,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487727005] [2020-01-16 17:49:59,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:49:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:49:59,943 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:49:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:49:59,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487727005] [2020-01-16 17:49:59,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:49:59,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:49:59,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731724889] [2020-01-16 17:49:59,954 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:49:59,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:49:59,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:49:59,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:49:59,954 INFO L87 Difference]: Start difference. First operand 3133 states and 15610 transitions. Second operand 12 states. [2020-01-16 17:50:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:00,217 INFO L93 Difference]: Finished difference Result 6052 states and 26944 transitions. [2020-01-16 17:50:00,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:00,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:00,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:00,233 INFO L225 Difference]: With dead ends: 6052 [2020-01-16 17:50:00,233 INFO L226 Difference]: Without dead ends: 6016 [2020-01-16 17:50:00,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:00,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-01-16 17:50:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3115. [2020-01-16 17:50:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-01-16 17:50:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15571 transitions. [2020-01-16 17:50:00,455 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15571 transitions. Word has length 31 [2020-01-16 17:50:00,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:00,455 INFO L478 AbstractCegarLoop]: Abstraction has 3115 states and 15571 transitions. [2020-01-16 17:50:00,455 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15571 transitions. [2020-01-16 17:50:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:00,461 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50: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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:00,461 INFO L426 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:00,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2124449198, now seen corresponding path program 49 times [2020-01-16 17:50:00,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:00,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181589265] [2020-01-16 17:50:00,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:01,034 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:50:01,165 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:50:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:01,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181589265] [2020-01-16 17:50:01,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:01,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:01,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114694508] [2020-01-16 17:50:01,176 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:01,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:01,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:01,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:01,176 INFO L87 Difference]: Start difference. First operand 3115 states and 15571 transitions. Second operand 12 states. [2020-01-16 17:50:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:01,477 INFO L93 Difference]: Finished difference Result 6082 states and 27045 transitions. [2020-01-16 17:50:01,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:01,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:01,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:01,493 INFO L225 Difference]: With dead ends: 6082 [2020-01-16 17:50:01,493 INFO L226 Difference]: Without dead ends: 6063 [2020-01-16 17:50:01,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-01-16 17:50:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3138. [2020-01-16 17:50:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-01-16 17:50:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15647 transitions. [2020-01-16 17:50:01,716 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15647 transitions. Word has length 31 [2020-01-16 17:50:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:01,716 INFO L478 AbstractCegarLoop]: Abstraction has 3138 states and 15647 transitions. [2020-01-16 17:50:01,716 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15647 transitions. [2020-01-16 17:50:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:01,721 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:01,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:01,722 INFO L426 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:01,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:01,722 INFO L82 PathProgramCache]: Analyzing trace with hash 903060920, now seen corresponding path program 50 times [2020-01-16 17:50:01,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:01,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97647670] [2020-01-16 17:50:01,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:02,445 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:02,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97647670] [2020-01-16 17:50:02,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:02,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:02,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329932542] [2020-01-16 17:50:02,455 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:02,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:02,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:02,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:02,456 INFO L87 Difference]: Start difference. First operand 3138 states and 15647 transitions. Second operand 12 states. [2020-01-16 17:50:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:02,762 INFO L93 Difference]: Finished difference Result 6083 states and 27039 transitions. [2020-01-16 17:50:02,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:02,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:02,778 INFO L225 Difference]: With dead ends: 6083 [2020-01-16 17:50:02,778 INFO L226 Difference]: Without dead ends: 6055 [2020-01-16 17:50:02,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2020-01-16 17:50:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3130. [2020-01-16 17:50:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:50:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15626 transitions. [2020-01-16 17:50:03,010 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15626 transitions. Word has length 31 [2020-01-16 17:50:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:03,010 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15626 transitions. [2020-01-16 17:50:03,011 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15626 transitions. [2020-01-16 17:50:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:03,016 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:03,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:03,016 INFO L426 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:03,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1746206862, now seen corresponding path program 51 times [2020-01-16 17:50:03,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:03,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123398115] [2020-01-16 17:50:03,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:03,573 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:50:03,704 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:50:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:03,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123398115] [2020-01-16 17:50:03,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:03,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:03,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351193377] [2020-01-16 17:50:03,715 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:03,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:03,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:03,715 INFO L87 Difference]: Start difference. First operand 3130 states and 15626 transitions. Second operand 12 states. [2020-01-16 17:50:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:03,965 INFO L93 Difference]: Finished difference Result 6077 states and 27027 transitions. [2020-01-16 17:50:03,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:03,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:03,981 INFO L225 Difference]: With dead ends: 6077 [2020-01-16 17:50:03,981 INFO L226 Difference]: Without dead ends: 6058 [2020-01-16 17:50:03,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-01-16 17:50:04,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3136. [2020-01-16 17:50:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-01-16 17:50:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15637 transitions. [2020-01-16 17:50:04,235 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15637 transitions. Word has length 31 [2020-01-16 17:50:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:04,235 INFO L478 AbstractCegarLoop]: Abstraction has 3136 states and 15637 transitions. [2020-01-16 17:50:04,235 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15637 transitions. [2020-01-16 17:50:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:04,242 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:04,242 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:04,242 INFO L426 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:04,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:04,243 INFO L82 PathProgramCache]: Analyzing trace with hash -366221768, now seen corresponding path program 52 times [2020-01-16 17:50:04,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:04,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215424592] [2020-01-16 17:50:04,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:04,926 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:50:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:04,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215424592] [2020-01-16 17:50:04,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:04,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:04,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268205688] [2020-01-16 17:50:04,937 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:04,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:04,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:04,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:04,937 INFO L87 Difference]: Start difference. First operand 3136 states and 15637 transitions. Second operand 12 states. [2020-01-16 17:50:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:05,244 INFO L93 Difference]: Finished difference Result 6075 states and 27017 transitions. [2020-01-16 17:50:05,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:05,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:05,260 INFO L225 Difference]: With dead ends: 6075 [2020-01-16 17:50:05,260 INFO L226 Difference]: Without dead ends: 6052 [2020-01-16 17:50:05,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:05,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2020-01-16 17:50:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3130. [2020-01-16 17:50:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:50:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15620 transitions. [2020-01-16 17:50:05,493 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15620 transitions. Word has length 31 [2020-01-16 17:50:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:05,493 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15620 transitions. [2020-01-16 17:50:05,493 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15620 transitions. [2020-01-16 17:50:05,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:05,499 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:05,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:05,499 INFO L426 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash -157717170, now seen corresponding path program 53 times [2020-01-16 17:50:05,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:05,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591775047] [2020-01-16 17:50:05,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:06,050 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:50:06,184 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:06,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591775047] [2020-01-16 17:50:06,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:06,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:06,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823294680] [2020-01-16 17:50:06,195 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:06,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:06,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:06,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:06,196 INFO L87 Difference]: Start difference. First operand 3130 states and 15620 transitions. Second operand 12 states. [2020-01-16 17:50:06,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:06,479 INFO L93 Difference]: Finished difference Result 6079 states and 27025 transitions. [2020-01-16 17:50:06,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:06,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:06,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:06,495 INFO L225 Difference]: With dead ends: 6079 [2020-01-16 17:50:06,495 INFO L226 Difference]: Without dead ends: 6059 [2020-01-16 17:50:06,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-01-16 17:50:06,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3136. [2020-01-16 17:50:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-01-16 17:50:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15631 transitions. [2020-01-16 17:50:06,717 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15631 transitions. Word has length 31 [2020-01-16 17:50:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:06,718 INFO L478 AbstractCegarLoop]: Abstraction has 3136 states and 15631 transitions. [2020-01-16 17:50:06,718 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15631 transitions. [2020-01-16 17:50:06,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:06,723 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:06,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:06,723 INFO L426 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:06,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1002688622, now seen corresponding path program 54 times [2020-01-16 17:50:06,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:06,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395131076] [2020-01-16 17:50:06,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:07,400 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:07,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395131076] [2020-01-16 17:50:07,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:07,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:07,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011371853] [2020-01-16 17:50:07,410 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:07,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:07,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:07,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:07,411 INFO L87 Difference]: Start difference. First operand 3136 states and 15631 transitions. Second operand 12 states. [2020-01-16 17:50:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:07,726 INFO L93 Difference]: Finished difference Result 6076 states and 27013 transitions. [2020-01-16 17:50:07,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:07,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:07,742 INFO L225 Difference]: With dead ends: 6076 [2020-01-16 17:50:07,742 INFO L226 Difference]: Without dead ends: 6047 [2020-01-16 17:50:07,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:07,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6047 states. [2020-01-16 17:50:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6047 to 3124. [2020-01-16 17:50:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:50:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15603 transitions. [2020-01-16 17:50:07,970 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15603 transitions. Word has length 31 [2020-01-16 17:50:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:07,970 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15603 transitions. [2020-01-16 17:50:07,970 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15603 transitions. [2020-01-16 17:50:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:07,975 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:07,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:07,976 INFO L426 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:07,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:07,976 INFO L82 PathProgramCache]: Analyzing trace with hash -648831620, now seen corresponding path program 55 times [2020-01-16 17:50:07,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:07,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075283962] [2020-01-16 17:50:07,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:08,539 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:50:08,668 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:50:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:08,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075283962] [2020-01-16 17:50:08,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:08,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:08,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757339806] [2020-01-16 17:50:08,680 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:08,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:08,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:08,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:08,680 INFO L87 Difference]: Start difference. First operand 3124 states and 15603 transitions. Second operand 12 states. [2020-01-16 17:50:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:09,071 INFO L93 Difference]: Finished difference Result 6100 states and 27082 transitions. [2020-01-16 17:50:09,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:09,071 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:09,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:09,085 INFO L225 Difference]: With dead ends: 6100 [2020-01-16 17:50:09,085 INFO L226 Difference]: Without dead ends: 6081 [2020-01-16 17:50:09,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6081 states. [2020-01-16 17:50:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6081 to 3143. [2020-01-16 17:50:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-01-16 17:50:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15655 transitions. [2020-01-16 17:50:09,364 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15655 transitions. Word has length 31 [2020-01-16 17:50:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:09,364 INFO L478 AbstractCegarLoop]: Abstraction has 3143 states and 15655 transitions. [2020-01-16 17:50:09,365 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15655 transitions. [2020-01-16 17:50:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:09,371 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:09,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:09,371 INFO L426 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:09,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:09,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1916288798, now seen corresponding path program 56 times [2020-01-16 17:50:09,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:09,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802184717] [2020-01-16 17:50:09,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:09,941 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:50:10,074 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:10,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-01-16 17:50:10,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802184717] [2020-01-16 17:50:10,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:10,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:10,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278165509] [2020-01-16 17:50:10,084 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:10,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:10,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:10,085 INFO L87 Difference]: Start difference. First operand 3143 states and 15655 transitions. Second operand 12 states. [2020-01-16 17:50:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:10,450 INFO L93 Difference]: Finished difference Result 6101 states and 27076 transitions. [2020-01-16 17:50:10,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:10,451 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:10,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:10,466 INFO L225 Difference]: With dead ends: 6101 [2020-01-16 17:50:10,466 INFO L226 Difference]: Without dead ends: 6073 [2020-01-16 17:50:10,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2020-01-16 17:50:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3135. [2020-01-16 17:50:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:50:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15632 transitions. [2020-01-16 17:50:10,690 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15632 transitions. Word has length 31 [2020-01-16 17:50:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:10,690 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15632 transitions. [2020-01-16 17:50:10,690 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15632 transitions. [2020-01-16 17:50:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:10,696 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:10,696 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:10,696 INFO L426 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:10,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2133920946, now seen corresponding path program 57 times [2020-01-16 17:50:10,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:10,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703221190] [2020-01-16 17:50:10,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:11,378 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:11,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703221190] [2020-01-16 17:50:11,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:11,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:11,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181709891] [2020-01-16 17:50:11,389 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:11,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:11,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:11,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:11,389 INFO L87 Difference]: Start difference. First operand 3135 states and 15632 transitions. Second operand 12 states. [2020-01-16 17:50:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:11,751 INFO L93 Difference]: Finished difference Result 6103 states and 27079 transitions. [2020-01-16 17:50:11,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:11,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:11,767 INFO L225 Difference]: With dead ends: 6103 [2020-01-16 17:50:11,767 INFO L226 Difference]: Without dead ends: 6084 [2020-01-16 17:50:11,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-01-16 17:50:11,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 3144. [2020-01-16 17:50:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2020-01-16 17:50:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 15649 transitions. [2020-01-16 17:50:11,997 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 15649 transitions. Word has length 31 [2020-01-16 17:50:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:11,997 INFO L478 AbstractCegarLoop]: Abstraction has 3144 states and 15649 transitions. [2020-01-16 17:50:11,998 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 15649 transitions. [2020-01-16 17:50:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:12,003 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:12,003 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:12,003 INFO L426 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:12,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2063810910, now seen corresponding path program 58 times [2020-01-16 17:50:12,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:12,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597079761] [2020-01-16 17:50:12,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:12,561 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:50:12,695 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:12,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597079761] [2020-01-16 17:50:12,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:12,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:12,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345452592] [2020-01-16 17:50:12,706 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:12,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:12,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:12,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:12,706 INFO L87 Difference]: Start difference. First operand 3144 states and 15649 transitions. Second operand 12 states. [2020-01-16 17:50:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:13,036 INFO L93 Difference]: Finished difference Result 6106 states and 27076 transitions. [2020-01-16 17:50:13,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:13,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:13,052 INFO L225 Difference]: With dead ends: 6106 [2020-01-16 17:50:13,052 INFO L226 Difference]: Without dead ends: 6075 [2020-01-16 17:50:13,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:13,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6075 states. [2020-01-16 17:50:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6075 to 3135. [2020-01-16 17:50:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:50:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15623 transitions. [2020-01-16 17:50:13,274 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15623 transitions. Word has length 31 [2020-01-16 17:50:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:13,275 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15623 transitions. [2020-01-16 17:50:13,275 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15623 transitions. [2020-01-16 17:50:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:13,280 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:13,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:13,280 INFO L426 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash 257122318, now seen corresponding path program 59 times [2020-01-16 17:50:13,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:13,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721365632] [2020-01-16 17:50:13,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:13,980 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:13,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721365632] [2020-01-16 17:50:13,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:13,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:13,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256378635] [2020-01-16 17:50:13,990 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:13,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:13,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:13,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:13,991 INFO L87 Difference]: Start difference. First operand 3135 states and 15623 transitions. Second operand 12 states. [2020-01-16 17:50:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:14,225 INFO L93 Difference]: Finished difference Result 6107 states and 27078 transitions. [2020-01-16 17:50:14,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:14,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:14,240 INFO L225 Difference]: With dead ends: 6107 [2020-01-16 17:50:14,240 INFO L226 Difference]: Without dead ends: 6087 [2020-01-16 17:50:14,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6087 states. [2020-01-16 17:50:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6087 to 3146. [2020-01-16 17:50:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-01-16 17:50:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15643 transitions. [2020-01-16 17:50:14,467 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15643 transitions. Word has length 31 [2020-01-16 17:50:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:14,467 INFO L478 AbstractCegarLoop]: Abstraction has 3146 states and 15643 transitions. [2020-01-16 17:50:14,468 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15643 transitions. [2020-01-16 17:50:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:14,473 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:14,473 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:14,473 INFO L426 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:14,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:14,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1594689532, now seen corresponding path program 60 times [2020-01-16 17:50:14,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:14,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532520314] [2020-01-16 17:50:14,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:15,043 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:50:15,171 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:50:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:15,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532520314] [2020-01-16 17:50:15,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:15,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:15,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305259336] [2020-01-16 17:50:15,181 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:15,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:15,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:15,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:15,182 INFO L87 Difference]: Start difference. First operand 3146 states and 15643 transitions. Second operand 12 states. [2020-01-16 17:50:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:15,409 INFO L93 Difference]: Finished difference Result 6109 states and 27072 transitions. [2020-01-16 17:50:15,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:15,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:15,424 INFO L225 Difference]: With dead ends: 6109 [2020-01-16 17:50:15,424 INFO L226 Difference]: Without dead ends: 6065 [2020-01-16 17:50:15,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-01-16 17:50:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3124. [2020-01-16 17:50:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:50:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15594 transitions. [2020-01-16 17:50:15,652 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15594 transitions. Word has length 31 [2020-01-16 17:50:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:15,652 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15594 transitions. [2020-01-16 17:50:15,652 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15594 transitions. [2020-01-16 17:50:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:15,657 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:15,657 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:15,657 INFO L426 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1341889284, now seen corresponding path program 61 times [2020-01-16 17:50:15,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:15,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008087925] [2020-01-16 17:50:15,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:16,192 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:50:16,325 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:16,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008087925] [2020-01-16 17:50:16,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:16,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:16,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541510020] [2020-01-16 17:50:16,335 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:16,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:16,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:16,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:16,336 INFO L87 Difference]: Start difference. First operand 3124 states and 15594 transitions. Second operand 12 states. [2020-01-16 17:50:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:16,597 INFO L93 Difference]: Finished difference Result 6082 states and 27028 transitions. [2020-01-16 17:50:16,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:16,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:16,612 INFO L225 Difference]: With dead ends: 6082 [2020-01-16 17:50:16,613 INFO L226 Difference]: Without dead ends: 6063 [2020-01-16 17:50:16,613 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-01-16 17:50:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3137. [2020-01-16 17:50:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-01-16 17:50:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15631 transitions. [2020-01-16 17:50:16,841 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15631 transitions. Word has length 31 [2020-01-16 17:50:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:16,842 INFO L478 AbstractCegarLoop]: Abstraction has 3137 states and 15631 transitions. [2020-01-16 17:50:16,842 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15631 transitions. [2020-01-16 17:50:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:16,847 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:16,847 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:16,847 INFO L426 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:16,847 INFO L82 PathProgramCache]: Analyzing trace with hash 840649382, now seen corresponding path program 62 times [2020-01-16 17:50:16,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:16,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833750390] [2020-01-16 17:50:16,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:17,528 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:17,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833750390] [2020-01-16 17:50:17,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:17,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:17,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755614410] [2020-01-16 17:50:17,538 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:17,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:17,538 INFO L87 Difference]: Start difference. First operand 3137 states and 15631 transitions. Second operand 12 states. [2020-01-16 17:50:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:17,768 INFO L93 Difference]: Finished difference Result 6080 states and 27018 transitions. [2020-01-16 17:50:17,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:17,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:17,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:17,783 INFO L225 Difference]: With dead ends: 6080 [2020-01-16 17:50:17,783 INFO L226 Difference]: Without dead ends: 6057 [2020-01-16 17:50:17,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-01-16 17:50:17,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3131. [2020-01-16 17:50:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:50:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15614 transitions. [2020-01-16 17:50:18,006 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15614 transitions. Word has length 31 [2020-01-16 17:50:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:18,006 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15614 transitions. [2020-01-16 17:50:18,007 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15614 transitions. [2020-01-16 17:50:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:18,012 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:18,012 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:18,012 INFO L426 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:18,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1892299922, now seen corresponding path program 63 times [2020-01-16 17:50:18,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:18,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8953944] [2020-01-16 17:50:18,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:18,562 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:50:18,690 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:18,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8953944] [2020-01-16 17:50:18,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:18,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:18,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423389682] [2020-01-16 17:50:18,700 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:18,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:18,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:18,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:18,701 INFO L87 Difference]: Start difference. First operand 3131 states and 15614 transitions. Second operand 12 states. [2020-01-16 17:50:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:18,925 INFO L93 Difference]: Finished difference Result 6090 states and 27039 transitions. [2020-01-16 17:50:18,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:18,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:18,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:18,940 INFO L225 Difference]: With dead ends: 6090 [2020-01-16 17:50:18,940 INFO L226 Difference]: Without dead ends: 6071 [2020-01-16 17:50:18,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-01-16 17:50:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3140. [2020-01-16 17:50:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-01-16 17:50:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15631 transitions. [2020-01-16 17:50:19,163 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15631 transitions. Word has length 31 [2020-01-16 17:50:19,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:19,163 INFO L478 AbstractCegarLoop]: Abstraction has 3140 states and 15631 transitions. [2020-01-16 17:50:19,163 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:19,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15631 transitions. [2020-01-16 17:50:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:19,168 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:19,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:19,168 INFO L426 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:19,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:19,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1962409958, now seen corresponding path program 64 times [2020-01-16 17:50:19,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:19,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655829876] [2020-01-16 17:50:19,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:19,714 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:50:19,843 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:19,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655829876] [2020-01-16 17:50:19,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:19,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:19,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974453734] [2020-01-16 17:50:19,854 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:19,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:19,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:19,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:19,854 INFO L87 Difference]: Start difference. First operand 3140 states and 15631 transitions. Second operand 12 states. [2020-01-16 17:50:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:20,057 INFO L93 Difference]: Finished difference Result 6093 states and 27036 transitions. [2020-01-16 17:50:20,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:20,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:20,072 INFO L225 Difference]: With dead ends: 6093 [2020-01-16 17:50:20,072 INFO L226 Difference]: Without dead ends: 6062 [2020-01-16 17:50:20,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:20,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-01-16 17:50:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3131. [2020-01-16 17:50:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:50:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15607 transitions. [2020-01-16 17:50:20,294 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15607 transitions. Word has length 31 [2020-01-16 17:50:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:20,295 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15607 transitions. [2020-01-16 17:50:20,295 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15607 transitions. [2020-01-16 17:50:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:20,300 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:20,300 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:20,300 INFO L426 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1280906798, now seen corresponding path program 65 times [2020-01-16 17:50:20,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:20,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714871041] [2020-01-16 17:50:20,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:20,972 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:20,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714871041] [2020-01-16 17:50:20,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:20,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:20,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429157247] [2020-01-16 17:50:20,982 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:20,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:20,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:20,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:20,982 INFO L87 Difference]: Start difference. First operand 3131 states and 15607 transitions. Second operand 12 states. [2020-01-16 17:50:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:21,206 INFO L93 Difference]: Finished difference Result 6084 states and 27018 transitions. [2020-01-16 17:50:21,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:21,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:21,221 INFO L225 Difference]: With dead ends: 6084 [2020-01-16 17:50:21,221 INFO L226 Difference]: Without dead ends: 6067 [2020-01-16 17:50:21,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-01-16 17:50:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3138. [2020-01-16 17:50:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-01-16 17:50:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15620 transitions. [2020-01-16 17:50:21,443 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15620 transitions. Word has length 31 [2020-01-16 17:50:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:21,443 INFO L478 AbstractCegarLoop]: Abstraction has 3138 states and 15620 transitions. [2020-01-16 17:50:21,444 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15620 transitions. [2020-01-16 17:50:21,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:21,449 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:21,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:21,449 INFO L426 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:21,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:21,449 INFO L82 PathProgramCache]: Analyzing trace with hash 901631868, now seen corresponding path program 66 times [2020-01-16 17:50:21,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:21,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364065240] [2020-01-16 17:50:21,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:21,993 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:50:22,127 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:22,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364065240] [2020-01-16 17:50:22,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:22,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:22,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950982648] [2020-01-16 17:50:22,138 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:22,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:22,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:22,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:22,138 INFO L87 Difference]: Start difference. First operand 3138 states and 15620 transitions. Second operand 12 states. [2020-01-16 17:50:22,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:22,411 INFO L93 Difference]: Finished difference Result 6089 states and 27021 transitions. [2020-01-16 17:50:22,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:22,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:22,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:22,426 INFO L225 Difference]: With dead ends: 6089 [2020-01-16 17:50:22,427 INFO L226 Difference]: Without dead ends: 6053 [2020-01-16 17:50:22,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2020-01-16 17:50:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3124. [2020-01-16 17:50:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:50:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15587 transitions. [2020-01-16 17:50:22,656 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15587 transitions. Word has length 31 [2020-01-16 17:50:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:22,657 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15587 transitions. [2020-01-16 17:50:22,657 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15587 transitions. [2020-01-16 17:50:22,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:22,662 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:22,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:22,662 INFO L426 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:22,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:22,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1501449310, now seen corresponding path program 67 times [2020-01-16 17:50:22,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:22,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879463402] [2020-01-16 17:50:22,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:23,289 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:50:23,418 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:23,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-01-16 17:50:23,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879463402] [2020-01-16 17:50:23,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:23,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:23,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389872649] [2020-01-16 17:50:23,428 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:23,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:23,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:23,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:23,429 INFO L87 Difference]: Start difference. First operand 3124 states and 15587 transitions. Second operand 12 states. [2020-01-16 17:50:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:23,705 INFO L93 Difference]: Finished difference Result 6088 states and 27033 transitions. [2020-01-16 17:50:23,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:23,706 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:23,720 INFO L225 Difference]: With dead ends: 6088 [2020-01-16 17:50:23,720 INFO L226 Difference]: Without dead ends: 6068 [2020-01-16 17:50:23,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:23,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-01-16 17:50:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 3138. [2020-01-16 17:50:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-01-16 17:50:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15626 transitions. [2020-01-16 17:50:23,944 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15626 transitions. Word has length 31 [2020-01-16 17:50:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:23,944 INFO L478 AbstractCegarLoop]: Abstraction has 3138 states and 15626 transitions. [2020-01-16 17:50:23,944 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15626 transitions. [2020-01-16 17:50:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:23,949 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:23,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:23,949 INFO L426 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:23,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1948546534, now seen corresponding path program 68 times [2020-01-16 17:50:23,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:23,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002589690] [2020-01-16 17:50:23,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:24,507 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:50:24,639 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50: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-01-16 17:50:24,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002589690] [2020-01-16 17:50:24,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:24,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:24,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632452286] [2020-01-16 17:50:24,650 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:24,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:24,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:24,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:24,651 INFO L87 Difference]: Start difference. First operand 3138 states and 15626 transitions. Second operand 12 states. [2020-01-16 17:50:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:24,870 INFO L93 Difference]: Finished difference Result 6085 states and 27021 transitions. [2020-01-16 17:50:24,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:24,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:24,885 INFO L225 Difference]: With dead ends: 6085 [2020-01-16 17:50:24,885 INFO L226 Difference]: Without dead ends: 6062 [2020-01-16 17:50:24,886 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-01-16 17:50:25,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3132. [2020-01-16 17:50:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:50:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15609 transitions. [2020-01-16 17:50:25,114 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15609 transitions. Word has length 31 [2020-01-16 17:50:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:25,115 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15609 transitions. [2020-01-16 17:50:25,115 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15609 transitions. [2020-01-16 17:50:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:25,120 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:25,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:25,120 INFO L426 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1732739896, now seen corresponding path program 69 times [2020-01-16 17:50:25,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:25,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734357406] [2020-01-16 17:50:25,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:25,817 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:25,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734357406] [2020-01-16 17:50:25,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:25,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:25,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055053942] [2020-01-16 17:50:25,827 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:25,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:25,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:25,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:25,828 INFO L87 Difference]: Start difference. First operand 3132 states and 15609 transitions. Second operand 12 states. [2020-01-16 17:50:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:26,080 INFO L93 Difference]: Finished difference Result 6098 states and 27048 transitions. [2020-01-16 17:50:26,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:26,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:26,096 INFO L225 Difference]: With dead ends: 6098 [2020-01-16 17:50:26,096 INFO L226 Difference]: Without dead ends: 6078 [2020-01-16 17:50:26,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2020-01-16 17:50:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 3143. [2020-01-16 17:50:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-01-16 17:50:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15629 transitions. [2020-01-16 17:50:26,319 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15629 transitions. Word has length 31 [2020-01-16 17:50:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:26,319 INFO L478 AbstractCegarLoop]: Abstraction has 3143 states and 15629 transitions. [2020-01-16 17:50:26,319 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15629 transitions. [2020-01-16 17:50:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:26,328 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:26,328 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:26,328 INFO L426 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:26,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1224660186, now seen corresponding path program 70 times [2020-01-16 17:50:26,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:26,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065246751] [2020-01-16 17:50:26,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:26,897 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:50:27,025 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:50:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:27,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065246751] [2020-01-16 17:50:27,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:27,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:27,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347735252] [2020-01-16 17:50:27,035 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:27,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:27,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:27,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:27,036 INFO L87 Difference]: Start difference. First operand 3143 states and 15629 transitions. Second operand 12 states. [2020-01-16 17:50:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:27,282 INFO L93 Difference]: Finished difference Result 6100 states and 27042 transitions. [2020-01-16 17:50:27,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:27,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:27,297 INFO L225 Difference]: With dead ends: 6100 [2020-01-16 17:50:27,297 INFO L226 Difference]: Without dead ends: 6067 [2020-01-16 17:50:27,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:27,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-01-16 17:50:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3132. [2020-01-16 17:50:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:50:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15601 transitions. [2020-01-16 17:50:27,523 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15601 transitions. Word has length 31 [2020-01-16 17:50:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:27,523 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15601 transitions. [2020-01-16 17:50:27,523 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15601 transitions. [2020-01-16 17:50:27,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:27,529 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:27,529 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:27,529 INFO L426 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:27,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:27,529 INFO L82 PathProgramCache]: Analyzing trace with hash 463457208, now seen corresponding path program 71 times [2020-01-16 17:50:27,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:27,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335470095] [2020-01-16 17:50:27,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:28,211 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:50:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:28,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335470095] [2020-01-16 17:50:28,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:28,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:28,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163242906] [2020-01-16 17:50:28,221 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:28,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:28,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:28,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:28,222 INFO L87 Difference]: Start difference. First operand 3132 states and 15601 transitions. Second operand 12 states. [2020-01-16 17:50:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:28,448 INFO L93 Difference]: Finished difference Result 6088 states and 27018 transitions. [2020-01-16 17:50:28,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:28,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:28,463 INFO L225 Difference]: With dead ends: 6088 [2020-01-16 17:50:28,463 INFO L226 Difference]: Without dead ends: 6071 [2020-01-16 17:50:28,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-01-16 17:50:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3139. [2020-01-16 17:50:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-01-16 17:50:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15614 transitions. [2020-01-16 17:50:28,691 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15614 transitions. Word has length 31 [2020-01-16 17:50:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:28,691 INFO L478 AbstractCegarLoop]: Abstraction has 3139 states and 15614 transitions. [2020-01-16 17:50:28,691 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15614 transitions. [2020-01-16 17:50:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:28,696 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:28,696 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:28,697 INFO L426 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:28,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:28,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1648971422, now seen corresponding path program 72 times [2020-01-16 17:50:28,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:28,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262169742] [2020-01-16 17:50:28,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:29,253 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:50:29,386 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:50:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:29,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262169742] [2020-01-16 17:50:29,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:29,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:29,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430171294] [2020-01-16 17:50:29,397 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:29,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:29,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:29,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:29,397 INFO L87 Difference]: Start difference. First operand 3139 states and 15614 transitions. Second operand 12 states. [2020-01-16 17:50:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:29,586 INFO L93 Difference]: Finished difference Result 6093 states and 27021 transitions. [2020-01-16 17:50:29,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:29,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:29,601 INFO L225 Difference]: With dead ends: 6093 [2020-01-16 17:50:29,602 INFO L226 Difference]: Without dead ends: 6047 [2020-01-16 17:50:29,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6047 states. [2020-01-16 17:50:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6047 to 3115. [2020-01-16 17:50:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-01-16 17:50:29,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15562 transitions. [2020-01-16 17:50:29,829 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15562 transitions. Word has length 31 [2020-01-16 17:50:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:29,829 INFO L478 AbstractCegarLoop]: Abstraction has 3115 states and 15562 transitions. [2020-01-16 17:50:29,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15562 transitions. [2020-01-16 17:50:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:29,834 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:29,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:29,834 INFO L426 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:29,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:29,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1726304654, now seen corresponding path program 73 times [2020-01-16 17:50:29,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:29,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782716756] [2020-01-16 17:50:29,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:30,130 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-01-16 17:50:30,434 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:50:30,567 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:30,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-01-16 17:50:30,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782716756] [2020-01-16 17:50:30,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:30,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:30,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395131368] [2020-01-16 17:50:30,577 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:30,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:30,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:30,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:30,578 INFO L87 Difference]: Start difference. First operand 3115 states and 15562 transitions. Second operand 12 states. [2020-01-16 17:50:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:30,806 INFO L93 Difference]: Finished difference Result 6062 states and 26989 transitions. [2020-01-16 17:50:30,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:30,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:30,821 INFO L225 Difference]: With dead ends: 6062 [2020-01-16 17:50:30,821 INFO L226 Difference]: Without dead ends: 6043 [2020-01-16 17:50:30,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-01-16 17:50:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3134. [2020-01-16 17:50:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:50:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15629 transitions. [2020-01-16 17:50:31,045 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15629 transitions. Word has length 31 [2020-01-16 17:50:31,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:31,046 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15629 transitions. [2020-01-16 17:50:31,046 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15629 transitions. [2020-01-16 17:50:31,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:31,053 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:31,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:31,053 INFO L426 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:31,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:31,053 INFO L82 PathProgramCache]: Analyzing trace with hash -386123976, now seen corresponding path program 74 times [2020-01-16 17:50:31,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:31,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677364548] [2020-01-16 17:50:31,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:31,600 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:50:31,730 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:31,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677364548] [2020-01-16 17:50:31,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:31,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:31,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609703443] [2020-01-16 17:50:31,740 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:31,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:31,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:31,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:31,741 INFO L87 Difference]: Start difference. First operand 3134 states and 15629 transitions. Second operand 12 states. [2020-01-16 17:50:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:32,030 INFO L93 Difference]: Finished difference Result 6060 states and 26979 transitions. [2020-01-16 17:50:32,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:32,031 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:32,046 INFO L225 Difference]: With dead ends: 6060 [2020-01-16 17:50:32,046 INFO L226 Difference]: Without dead ends: 6037 [2020-01-16 17:50:32,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:32,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-01-16 17:50:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3128. [2020-01-16 17:50:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:50:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15612 transitions. [2020-01-16 17:50:32,273 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15612 transitions. Word has length 31 [2020-01-16 17:50:32,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:32,273 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15612 transitions. [2020-01-16 17:50:32,273 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:32,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15612 transitions. [2020-01-16 17:50:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:32,279 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:32,279 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:32,279 INFO L426 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:32,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:32,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1301993418, now seen corresponding path program 75 times [2020-01-16 17:50:32,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:32,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016199570] [2020-01-16 17:50:32,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:32,834 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:50:32,963 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:50:32,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-01-16 17:50:32,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016199570] [2020-01-16 17:50:32,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:32,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:32,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314719446] [2020-01-16 17:50:32,973 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:32,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:32,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:32,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:32,974 INFO L87 Difference]: Start difference. First operand 3128 states and 15612 transitions. Second operand 12 states. [2020-01-16 17:50:33,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:33,219 INFO L93 Difference]: Finished difference Result 6064 states and 26988 transitions. [2020-01-16 17:50:33,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:33,220 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:33,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:33,234 INFO L225 Difference]: With dead ends: 6064 [2020-01-16 17:50:33,234 INFO L226 Difference]: Without dead ends: 6045 [2020-01-16 17:50:33,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-01-16 17:50:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3135. [2020-01-16 17:50:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:50:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15625 transitions. [2020-01-16 17:50:33,457 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15625 transitions. Word has length 31 [2020-01-16 17:50:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:33,457 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15625 transitions. [2020-01-16 17:50:33,457 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15625 transitions. [2020-01-16 17:50:33,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:33,462 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:33,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:33,462 INFO L426 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:33,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:33,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1655406664, now seen corresponding path program 76 times [2020-01-16 17:50:33,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:33,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474880673] [2020-01-16 17:50:33,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:34,142 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:50:34,302 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:34,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474880673] [2020-01-16 17:50:34,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:34,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:34,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274499852] [2020-01-16 17:50:34,313 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:34,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:34,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:34,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:34,314 INFO L87 Difference]: Start difference. First operand 3135 states and 15625 transitions. Second operand 12 states. [2020-01-16 17:50:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:34,547 INFO L93 Difference]: Finished difference Result 6063 states and 26979 transitions. [2020-01-16 17:50:34,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:34,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:34,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:34,564 INFO L225 Difference]: With dead ends: 6063 [2020-01-16 17:50:34,564 INFO L226 Difference]: Without dead ends: 6038 [2020-01-16 17:50:34,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-01-16 17:50:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3128. [2020-01-16 17:50:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:50:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15606 transitions. [2020-01-16 17:50:34,798 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15606 transitions. Word has length 31 [2020-01-16 17:50:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:34,798 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15606 transitions. [2020-01-16 17:50:34,798 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15606 transitions. [2020-01-16 17:50:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:34,804 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:34,804 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:34,805 INFO L426 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:34,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:34,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1871213302, now seen corresponding path program 77 times [2020-01-16 17:50:34,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:34,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75691718] [2020-01-16 17:50:34,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:35,486 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:35,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75691718] [2020-01-16 17:50:35,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:35,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:35,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640475102] [2020-01-16 17:50:35,496 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:35,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:35,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:35,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:35,497 INFO L87 Difference]: Start difference. First operand 3128 states and 15606 transitions. Second operand 12 states. [2020-01-16 17:50:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:35,780 INFO L93 Difference]: Finished difference Result 6059 states and 26971 transitions. [2020-01-16 17:50:35,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:35,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:35,795 INFO L225 Difference]: With dead ends: 6059 [2020-01-16 17:50:35,795 INFO L226 Difference]: Without dead ends: 6042 [2020-01-16 17:50:35,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-01-16 17:50:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3134. [2020-01-16 17:50:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:50:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15617 transitions. [2020-01-16 17:50:36,022 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15617 transitions. Word has length 31 [2020-01-16 17:50:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:36,023 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15617 transitions. [2020-01-16 17:50:36,023 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15617 transitions. [2020-01-16 17:50:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:36,028 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:36,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:36,028 INFO L426 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:36,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:36,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1578782542, now seen corresponding path program 78 times [2020-01-16 17:50:36,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:36,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896943846] [2020-01-16 17:50:36,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:36,586 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:50:36,722 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:36,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896943846] [2020-01-16 17:50:36,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:36,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:36,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221727745] [2020-01-16 17:50:36,732 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:36,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:36,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:36,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:36,732 INFO L87 Difference]: Start difference. First operand 3134 states and 15617 transitions. Second operand 12 states. [2020-01-16 17:50:36,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:36,974 INFO L93 Difference]: Finished difference Result 6060 states and 26967 transitions. [2020-01-16 17:50:36,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:36,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:36,990 INFO L225 Difference]: With dead ends: 6060 [2020-01-16 17:50:36,990 INFO L226 Difference]: Without dead ends: 6030 [2020-01-16 17:50:36,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:37,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-01-16 17:50:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3122. [2020-01-16 17:50:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:50:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15589 transitions. [2020-01-16 17:50:37,217 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15589 transitions. Word has length 31 [2020-01-16 17:50:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:37,217 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15589 transitions. [2020-01-16 17:50:37,217 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15589 transitions. [2020-01-16 17:50:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:37,222 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:37,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:37,223 INFO L426 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:37,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:37,223 INFO L82 PathProgramCache]: Analyzing trace with hash -824298636, now seen corresponding path program 79 times [2020-01-16 17:50:37,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:37,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939392511] [2020-01-16 17:50:37,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:37,805 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:50:37,935 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:37,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:37,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939392511] [2020-01-16 17:50:37,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:37,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:37,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591748206] [2020-01-16 17:50:37,946 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:37,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:37,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:37,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:37,946 INFO L87 Difference]: Start difference. First operand 3122 states and 15589 transitions. Second operand 12 states. [2020-01-16 17:50:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:38,184 INFO L93 Difference]: Finished difference Result 6070 states and 27000 transitions. [2020-01-16 17:50:38,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:38,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:38,199 INFO L225 Difference]: With dead ends: 6070 [2020-01-16 17:50:38,199 INFO L226 Difference]: Without dead ends: 6051 [2020-01-16 17:50:38,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-01-16 17:50:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3135. [2020-01-16 17:50:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:50:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15626 transitions. [2020-01-16 17:50:38,422 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15626 transitions. Word has length 31 [2020-01-16 17:50:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:38,423 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15626 transitions. [2020-01-16 17:50:38,423 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15626 transitions. [2020-01-16 17:50:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:38,428 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:38,428 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:38,428 INFO L426 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:38,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:38,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1358240030, now seen corresponding path program 80 times [2020-01-16 17:50:38,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:38,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338693046] [2020-01-16 17:50:38,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:39,084 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:39,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-01-16 17:50:39,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338693046] [2020-01-16 17:50:39,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:39,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:39,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16431509] [2020-01-16 17:50:39,095 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:39,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:39,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:39,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:39,095 INFO L87 Difference]: Start difference. First operand 3135 states and 15626 transitions. Second operand 12 states. [2020-01-16 17:50:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:39,337 INFO L93 Difference]: Finished difference Result 6068 states and 26990 transitions. [2020-01-16 17:50:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:39,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:39,355 INFO L225 Difference]: With dead ends: 6068 [2020-01-16 17:50:39,355 INFO L226 Difference]: Without dead ends: 6045 [2020-01-16 17:50:39,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:39,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-01-16 17:50:39,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3129. [2020-01-16 17:50:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:50:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15609 transitions. [2020-01-16 17:50:39,582 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15609 transitions. Word has length 31 [2020-01-16 17:50:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:39,582 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15609 transitions. [2020-01-16 17:50:39,582 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15609 transitions. [2020-01-16 17:50:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:39,587 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:39,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:39,588 INFO L426 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:39,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:39,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1885076726, now seen corresponding path program 81 times [2020-01-16 17:50:39,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:39,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448656697] [2020-01-16 17:50:39,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:40,264 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:40,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-01-16 17:50:40,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448656697] [2020-01-16 17:50:40,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:40,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:40,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403795532] [2020-01-16 17:50:40,274 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:40,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:40,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:40,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:40,275 INFO L87 Difference]: Start difference. First operand 3129 states and 15609 transitions. Second operand 12 states. [2020-01-16 17:50:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:40,512 INFO L93 Difference]: Finished difference Result 6078 states and 27011 transitions. [2020-01-16 17:50:40,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:40,513 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:40,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:40,528 INFO L225 Difference]: With dead ends: 6078 [2020-01-16 17:50:40,528 INFO L226 Difference]: Without dead ends: 6059 [2020-01-16 17:50:40,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-01-16 17:50:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3138. [2020-01-16 17:50:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-01-16 17:50:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15626 transitions. [2020-01-16 17:50:40,755 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15626 transitions. Word has length 31 [2020-01-16 17:50:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:40,755 INFO L478 AbstractCegarLoop]: Abstraction has 3138 states and 15626 transitions. [2020-01-16 17:50:40,755 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15626 transitions. [2020-01-16 17:50:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:40,760 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:40,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:40,760 INFO L426 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:40,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:40,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1814966690, now seen corresponding path program 82 times [2020-01-16 17:50:40,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:40,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284103084] [2020-01-16 17:50:40,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:41,367 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:50:41,496 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:41,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284103084] [2020-01-16 17:50:41,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:41,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:41,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186221957] [2020-01-16 17:50:41,506 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:41,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:41,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:41,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:41,506 INFO L87 Difference]: Start difference. First operand 3138 states and 15626 transitions. Second operand 12 states. [2020-01-16 17:50:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:41,711 INFO L93 Difference]: Finished difference Result 6081 states and 27008 transitions. [2020-01-16 17:50:41,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:41,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:41,725 INFO L225 Difference]: With dead ends: 6081 [2020-01-16 17:50:41,725 INFO L226 Difference]: Without dead ends: 6050 [2020-01-16 17:50:41,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:41,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-01-16 17:50:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3129. [2020-01-16 17:50:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:50:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15602 transitions. [2020-01-16 17:50:41,952 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15602 transitions. Word has length 31 [2020-01-16 17:50:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:41,953 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15602 transitions. [2020-01-16 17:50:41,953 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15602 transitions. [2020-01-16 17:50:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:41,960 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:41,960 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:41,960 INFO L426 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash -763316150, now seen corresponding path program 83 times [2020-01-16 17:50:41,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:41,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159466955] [2020-01-16 17:50:41,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:42,496 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:50:42,626 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:42,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159466955] [2020-01-16 17:50:42,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:42,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:42,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944307383] [2020-01-16 17:50:42,636 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:42,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:42,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:42,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:42,636 INFO L87 Difference]: Start difference. First operand 3129 states and 15602 transitions. Second operand 12 states. [2020-01-16 17:50:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:42,872 INFO L93 Difference]: Finished difference Result 6072 states and 26990 transitions. [2020-01-16 17:50:42,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:42,872 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:42,887 INFO L225 Difference]: With dead ends: 6072 [2020-01-16 17:50:42,888 INFO L226 Difference]: Without dead ends: 6055 [2020-01-16 17:50:42,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:43,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2020-01-16 17:50:43,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3136. [2020-01-16 17:50:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-01-16 17:50:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15615 transitions. [2020-01-16 17:50:43,116 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15615 transitions. Word has length 31 [2020-01-16 17:50:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:43,116 INFO L478 AbstractCegarLoop]: Abstraction has 3136 states and 15615 transitions. [2020-01-16 17:50:43,116 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15615 transitions. [2020-01-16 17:50:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:43,121 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:43,121 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:43,121 INFO L426 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1419222516, now seen corresponding path program 84 times [2020-01-16 17:50:43,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:43,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937092085] [2020-01-16 17:50:43,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:43,695 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:50:43,826 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:50:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:43,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937092085] [2020-01-16 17:50:43,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:43,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:43,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078282146] [2020-01-16 17:50:43,837 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:43,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:43,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:43,838 INFO L87 Difference]: Start difference. First operand 3136 states and 15615 transitions. Second operand 12 states. [2020-01-16 17:50:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:44,063 INFO L93 Difference]: Finished difference Result 6077 states and 26993 transitions. [2020-01-16 17:50:44,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:44,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:44,078 INFO L225 Difference]: With dead ends: 6077 [2020-01-16 17:50:44,079 INFO L226 Difference]: Without dead ends: 6041 [2020-01-16 17:50:44,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2020-01-16 17:50:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3122. [2020-01-16 17:50:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:50:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15582 transitions. [2020-01-16 17:50:44,301 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15582 transitions. Word has length 31 [2020-01-16 17:50:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:44,302 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15582 transitions. [2020-01-16 17:50:44,302 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15582 transitions. [2020-01-16 17:50:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:44,307 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:44,307 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:44,307 INFO L426 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:44,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:44,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1517356300, now seen corresponding path program 85 times [2020-01-16 17:50:44,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:44,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657571674] [2020-01-16 17:50:44,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:44,907 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:50:45,039 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:50:45,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-01-16 17:50:45,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657571674] [2020-01-16 17:50:45,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:45,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:45,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510423895] [2020-01-16 17:50:45,049 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:45,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:45,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:45,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:45,049 INFO L87 Difference]: Start difference. First operand 3122 states and 15582 transitions. Second operand 12 states. [2020-01-16 17:50:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:45,343 INFO L93 Difference]: Finished difference Result 6076 states and 27010 transitions. [2020-01-16 17:50:45,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:45,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:45,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:45,359 INFO L225 Difference]: With dead ends: 6076 [2020-01-16 17:50:45,359 INFO L226 Difference]: Without dead ends: 6057 [2020-01-16 17:50:45,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-01-16 17:50:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3137. [2020-01-16 17:50:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-01-16 17:50:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15625 transitions. [2020-01-16 17:50:45,587 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15625 transitions. Word has length 31 [2020-01-16 17:50:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:45,587 INFO L478 AbstractCegarLoop]: Abstraction has 3137 states and 15625 transitions. [2020-01-16 17:50:45,587 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15625 transitions. [2020-01-16 17:50:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:45,593 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:45,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:45,593 INFO L426 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:45,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:45,593 INFO L82 PathProgramCache]: Analyzing trace with hash -179789086, now seen corresponding path program 86 times [2020-01-16 17:50:45,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:45,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717278247] [2020-01-16 17:50:45,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:46,155 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:50:46,284 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:46,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-01-16 17:50:46,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717278247] [2020-01-16 17:50:46,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:46,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:46,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615835176] [2020-01-16 17:50:46,295 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:46,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:46,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:46,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:46,295 INFO L87 Difference]: Start difference. First operand 3137 states and 15625 transitions. Second operand 12 states. [2020-01-16 17:50:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:46,591 INFO L93 Difference]: Finished difference Result 6075 states and 27001 transitions. [2020-01-16 17:50:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:46,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:46,606 INFO L225 Difference]: With dead ends: 6075 [2020-01-16 17:50:46,606 INFO L226 Difference]: Without dead ends: 6050 [2020-01-16 17:50:46,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-01-16 17:50:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3130. [2020-01-16 17:50:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:50:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15605 transitions. [2020-01-16 17:50:46,830 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15605 transitions. Word has length 31 [2020-01-16 17:50:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:46,830 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15605 transitions. [2020-01-16 17:50:46,830 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15605 transitions. [2020-01-16 17:50:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:46,835 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:46,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:46,835 INFO L426 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:46,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:46,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2141144142, now seen corresponding path program 87 times [2020-01-16 17:50:46,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:46,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368743113] [2020-01-16 17:50:46,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:47,393 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:50:47,524 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:50:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:47,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368743113] [2020-01-16 17:50:47,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:47,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:47,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169007984] [2020-01-16 17:50:47,535 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:47,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:47,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:47,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:47,535 INFO L87 Difference]: Start difference. First operand 3130 states and 15605 transitions. Second operand 12 states. [2020-01-16 17:50:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:47,790 INFO L93 Difference]: Finished difference Result 6082 states and 27015 transitions. [2020-01-16 17:50:47,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:47,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:47,805 INFO L225 Difference]: With dead ends: 6082 [2020-01-16 17:50:47,806 INFO L226 Difference]: Without dead ends: 6063 [2020-01-16 17:50:47,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-01-16 17:50:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3139. [2020-01-16 17:50:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-01-16 17:50:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15622 transitions. [2020-01-16 17:50:48,028 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15622 transitions. Word has length 31 [2020-01-16 17:50:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:48,029 INFO L478 AbstractCegarLoop]: Abstraction has 3139 states and 15622 transitions. [2020-01-16 17:50:48,029 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15622 transitions. [2020-01-16 17:50:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:48,034 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:48,034 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:48,034 INFO L426 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:48,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:48,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2083713118, now seen corresponding path program 88 times [2020-01-16 17:50:48,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:48,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150749069] [2020-01-16 17:50:48,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:48,610 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-01-16 17:50:48,742 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:50:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:48,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150749069] [2020-01-16 17:50:48,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:48,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:48,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860188245] [2020-01-16 17:50:48,753 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:48,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:48,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:48,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:48,753 INFO L87 Difference]: Start difference. First operand 3139 states and 15622 transitions. Second operand 12 states. [2020-01-16 17:50:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:48,977 INFO L93 Difference]: Finished difference Result 6085 states and 27012 transitions. [2020-01-16 17:50:48,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:48,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:48,993 INFO L225 Difference]: With dead ends: 6085 [2020-01-16 17:50:48,993 INFO L226 Difference]: Without dead ends: 6054 [2020-01-16 17:50:48,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-01-16 17:50:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3130. [2020-01-16 17:50:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:50:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15597 transitions. [2020-01-16 17:50:49,222 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15597 transitions. Word has length 31 [2020-01-16 17:50:49,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:49,222 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15597 transitions. [2020-01-16 17:50:49,222 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15597 transitions. [2020-01-16 17:50:49,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:49,227 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:49,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:49,227 INFO L426 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:49,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:49,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1993622030, now seen corresponding path program 89 times [2020-01-16 17:50:49,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:49,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463952374] [2020-01-16 17:50:49,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:49,784 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:50:49,916 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:49,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463952374] [2020-01-16 17:50:49,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:49,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:49,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475423470] [2020-01-16 17:50:49,927 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:49,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:49,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:49,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:49,927 INFO L87 Difference]: Start difference. First operand 3130 states and 15597 transitions. Second operand 12 states. [2020-01-16 17:50:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:50,155 INFO L93 Difference]: Finished difference Result 6079 states and 27000 transitions. [2020-01-16 17:50:50,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:50,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:50,171 INFO L225 Difference]: With dead ends: 6079 [2020-01-16 17:50:50,171 INFO L226 Difference]: Without dead ends: 6061 [2020-01-16 17:50:50,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-01-16 17:50:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3138. [2020-01-16 17:50:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-01-16 17:50:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15612 transitions. [2020-01-16 17:50:50,402 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15612 transitions. Word has length 31 [2020-01-16 17:50:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:50,403 INFO L478 AbstractCegarLoop]: Abstraction has 3138 states and 15612 transitions. [2020-01-16 17:50:50,403 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15612 transitions. [2020-01-16 17:50:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:50,408 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:50,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:50,408 INFO L426 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:50,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:50,408 INFO L82 PathProgramCache]: Analyzing trace with hash 726164852, now seen corresponding path program 90 times [2020-01-16 17:50:50,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:50,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339008796] [2020-01-16 17:50:50,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:50,970 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-01-16 17:50:51,104 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:51,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339008796] [2020-01-16 17:50:51,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:51,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:51,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447118049] [2020-01-16 17:50:51,115 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:51,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:51,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:51,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:51,115 INFO L87 Difference]: Start difference. First operand 3138 states and 15612 transitions. Second operand 12 states. [2020-01-16 17:50:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:51,313 INFO L93 Difference]: Finished difference Result 6083 states and 27000 transitions. [2020-01-16 17:50:51,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:51,313 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:51,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:51,327 INFO L225 Difference]: With dead ends: 6083 [2020-01-16 17:50:51,327 INFO L226 Difference]: Without dead ends: 6045 [2020-01-16 17:50:51,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-01-16 17:50:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3122. [2020-01-16 17:50:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:50:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15575 transitions. [2020-01-16 17:50:51,550 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15575 transitions. Word has length 31 [2020-01-16 17:50:51,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:51,550 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15575 transitions. [2020-01-16 17:50:51,550 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15575 transitions. [2020-01-16 17:50:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:51,555 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:51,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:51,556 INFO L426 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:51,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:51,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1080021854, now seen corresponding path program 91 times [2020-01-16 17:50:51,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:51,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463544287] [2020-01-16 17:50:51,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:52,276 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:52,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463544287] [2020-01-16 17:50:52,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:52,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:52,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370756799] [2020-01-16 17:50:52,287 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:52,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:52,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:52,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:52,288 INFO L87 Difference]: Start difference. First operand 3122 states and 15575 transitions. Second operand 12 states. [2020-01-16 17:50:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:52,586 INFO L93 Difference]: Finished difference Result 6065 states and 26975 transitions. [2020-01-16 17:50:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:52,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:52,601 INFO L225 Difference]: With dead ends: 6065 [2020-01-16 17:50:52,601 INFO L226 Difference]: Without dead ends: 6048 [2020-01-16 17:50:52,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-01-16 17:50:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3135. [2020-01-16 17:50:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:50:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15612 transitions. [2020-01-16 17:50:52,829 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15612 transitions. Word has length 31 [2020-01-16 17:50:52,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:52,829 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15612 transitions. [2020-01-16 17:50:52,829 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:52,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15612 transitions. [2020-01-16 17:50:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:52,835 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:52,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:52,835 INFO L426 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:52,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:52,835 INFO L82 PathProgramCache]: Analyzing trace with hash 235050402, now seen corresponding path program 92 times [2020-01-16 17:50:52,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:52,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175281323] [2020-01-16 17:50:52,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:53,396 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:50:53,531 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:53,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-01-16 17:50:53,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175281323] [2020-01-16 17:50:53,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:53,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:53,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954784146] [2020-01-16 17:50:53,541 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:53,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:53,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:53,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:53,542 INFO L87 Difference]: Start difference. First operand 3135 states and 15612 transitions. Second operand 12 states. [2020-01-16 17:50:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:53,784 INFO L93 Difference]: Finished difference Result 6066 states and 26971 transitions. [2020-01-16 17:50:53,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:53,785 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:53,800 INFO L225 Difference]: With dead ends: 6066 [2020-01-16 17:50:53,800 INFO L226 Difference]: Without dead ends: 6042 [2020-01-16 17:50:53,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-01-16 17:50:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3129. [2020-01-16 17:50:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:50:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15595 transitions. [2020-01-16 17:50:54,024 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15595 transitions. Word has length 31 [2020-01-16 17:50:54,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:54,024 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15595 transitions. [2020-01-16 17:50:54,024 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15595 transitions. [2020-01-16 17:50:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:54,029 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:54,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:54,029 INFO L426 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:54,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:54,030 INFO L82 PathProgramCache]: Analyzing trace with hash 443555000, now seen corresponding path program 93 times [2020-01-16 17:50:54,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:54,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473997393] [2020-01-16 17:50:54,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:54,579 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:50:54,711 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:54,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-01-16 17:50:54,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473997393] [2020-01-16 17:50:54,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:54,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:54,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490852710] [2020-01-16 17:50:54,720 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:54,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:54,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:54,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:54,721 INFO L87 Difference]: Start difference. First operand 3129 states and 15595 transitions. Second operand 12 states. [2020-01-16 17:50:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:54,981 INFO L93 Difference]: Finished difference Result 6070 states and 26978 transitions. [2020-01-16 17:50:54,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:54,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:54,997 INFO L225 Difference]: With dead ends: 6070 [2020-01-16 17:50:54,997 INFO L226 Difference]: Without dead ends: 6053 [2020-01-16 17:50:54,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2020-01-16 17:50:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3136. [2020-01-16 17:50:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-01-16 17:50:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15608 transitions. [2020-01-16 17:50:55,225 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15608 transitions. Word has length 31 [2020-01-16 17:50:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:55,225 INFO L478 AbstractCegarLoop]: Abstraction has 3136 states and 15608 transitions. [2020-01-16 17:50:55,225 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15608 transitions. [2020-01-16 17:50:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:55,230 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:55,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:55,230 INFO L426 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1668873630, now seen corresponding path program 94 times [2020-01-16 17:50:55,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:55,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620061392] [2020-01-16 17:50:55,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:55,776 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-01-16 17:50:55,905 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:55,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-01-16 17:50:55,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620061392] [2020-01-16 17:50:55,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:55,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:55,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26198633] [2020-01-16 17:50:55,915 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:55,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:55,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:55,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:55,916 INFO L87 Difference]: Start difference. First operand 3136 states and 15608 transitions. Second operand 12 states. [2020-01-16 17:50:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:56,156 INFO L93 Difference]: Finished difference Result 6075 states and 26981 transitions. [2020-01-16 17:50:56,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:56,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:56,171 INFO L225 Difference]: With dead ends: 6075 [2020-01-16 17:50:56,171 INFO L226 Difference]: Without dead ends: 6046 [2020-01-16 17:50:56,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-01-16 17:50:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3129. [2020-01-16 17:50:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:50:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15588 transitions. [2020-01-16 17:50:56,399 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15588 transitions. Word has length 31 [2020-01-16 17:50:56,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:56,399 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15588 transitions. [2020-01-16 17:50:56,399 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:56,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15588 transitions. [2020-01-16 17:50:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:56,404 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:56,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:56,404 INFO L426 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:56,404 INFO L82 PathProgramCache]: Analyzing trace with hash -825727688, now seen corresponding path program 95 times [2020-01-16 17:50:56,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:56,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404050210] [2020-01-16 17:50:56,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:56,954 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:50:57,085 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:57,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404050210] [2020-01-16 17:50:57,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:57,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:57,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337938133] [2020-01-16 17:50:57,096 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:57,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:57,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:57,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:57,096 INFO L87 Difference]: Start difference. First operand 3129 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:50:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:57,360 INFO L93 Difference]: Finished difference Result 6073 states and 26978 transitions. [2020-01-16 17:50:57,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:57,361 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:57,378 INFO L225 Difference]: With dead ends: 6073 [2020-01-16 17:50:57,378 INFO L226 Difference]: Without dead ends: 6055 [2020-01-16 17:50:57,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2020-01-16 17:50:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3137. [2020-01-16 17:50:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-01-16 17:50:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15603 transitions. [2020-01-16 17:50:57,600 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15603 transitions. Word has length 31 [2020-01-16 17:50:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:57,600 INFO L478 AbstractCegarLoop]: Abstraction has 3137 states and 15603 transitions. [2020-01-16 17:50:57,600 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15603 transitions. [2020-01-16 17:50:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:57,605 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:57,605 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:57,605 INFO L426 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:57,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:57,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2093184866, now seen corresponding path program 96 times [2020-01-16 17:50:57,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:57,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978840244] [2020-01-16 17:50:57,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:58,165 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-01-16 17:50:58,296 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:58,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978840244] [2020-01-16 17:50:58,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:58,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:58,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478138772] [2020-01-16 17:50:58,307 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:58,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:58,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:58,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:58,307 INFO L87 Difference]: Start difference. First operand 3137 states and 15603 transitions. Second operand 12 states. [2020-01-16 17:50:58,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:58,631 INFO L93 Difference]: Finished difference Result 6077 states and 26978 transitions. [2020-01-16 17:50:58,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:58,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:58,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:58,647 INFO L225 Difference]: With dead ends: 6077 [2020-01-16 17:50:58,647 INFO L226 Difference]: Without dead ends: 6033 [2020-01-16 17:50:58,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:50:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-01-16 17:50:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3115. [2020-01-16 17:50:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-01-16 17:50:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15555 transitions. [2020-01-16 17:50:58,873 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15555 transitions. Word has length 31 [2020-01-16 17:50:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:50:58,873 INFO L478 AbstractCegarLoop]: Abstraction has 3115 states and 15555 transitions. [2020-01-16 17:50:58,873 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:50:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15555 transitions. [2020-01-16 17:50:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:50:58,878 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:50:58,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:50:58,878 INFO L426 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:50:58,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:50:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash -192546034, now seen corresponding path program 97 times [2020-01-16 17:50:58,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:50:58,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660397323] [2020-01-16 17:50:58,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:50:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:50:59,466 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:50:59,597 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:50:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:50:59,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660397323] [2020-01-16 17:50:59,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:50:59,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:50:59,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127311693] [2020-01-16 17:50:59,607 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:50:59,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:50:59,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:50:59,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:50:59,608 INFO L87 Difference]: Start difference. First operand 3115 states and 15555 transitions. Second operand 12 states. [2020-01-16 17:50:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:50:59,917 INFO L93 Difference]: Finished difference Result 6071 states and 27001 transitions. [2020-01-16 17:50:59,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:50:59,917 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:50:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:50:59,932 INFO L225 Difference]: With dead ends: 6071 [2020-01-16 17:50:59,933 INFO L226 Difference]: Without dead ends: 6051 [2020-01-16 17:50:59,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-01-16 17:51:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3135. [2020-01-16 17:51:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:51:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15625 transitions. [2020-01-16 17:51:00,157 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15625 transitions. Word has length 31 [2020-01-16 17:51:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:00,157 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15625 transitions. [2020-01-16 17:51:00,157 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15625 transitions. [2020-01-16 17:51:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:00,162 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:00,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:00,163 INFO L426 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:00,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:00,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1037517486, now seen corresponding path program 98 times [2020-01-16 17:51:00,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:00,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787446409] [2020-01-16 17:51:00,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:00,709 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:51:00,841 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:00,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787446409] [2020-01-16 17:51:00,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:00,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:00,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665869328] [2020-01-16 17:51:00,851 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:00,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:00,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:00,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:00,851 INFO L87 Difference]: Start difference. First operand 3135 states and 15625 transitions. Second operand 12 states. [2020-01-16 17:51:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:01,108 INFO L93 Difference]: Finished difference Result 6068 states and 26989 transitions. [2020-01-16 17:51:01,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:01,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:01,122 INFO L225 Difference]: With dead ends: 6068 [2020-01-16 17:51:01,123 INFO L226 Difference]: Without dead ends: 6045 [2020-01-16 17:51:01,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-01-16 17:51:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3129. [2020-01-16 17:51:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:51:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15608 transitions. [2020-01-16 17:51:01,346 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15608 transitions. Word has length 31 [2020-01-16 17:51:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:01,346 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15608 transitions. [2020-01-16 17:51:01,346 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15608 transitions. [2020-01-16 17:51:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:01,351 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51: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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:01,352 INFO L426 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash -616857270, now seen corresponding path program 99 times [2020-01-16 17:51:01,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:01,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144699680] [2020-01-16 17:51:01,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:01,901 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:51:02,036 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:02,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144699680] [2020-01-16 17:51:02,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:02,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:02,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352440069] [2020-01-16 17:51:02,046 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:02,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:02,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:02,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:02,047 INFO L87 Difference]: Start difference. First operand 3129 states and 15608 transitions. Second operand 12 states. [2020-01-16 17:51:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:02,374 INFO L93 Difference]: Finished difference Result 6073 states and 27000 transitions. [2020-01-16 17:51:02,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:02,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:02,389 INFO L225 Difference]: With dead ends: 6073 [2020-01-16 17:51:02,389 INFO L226 Difference]: Without dead ends: 6053 [2020-01-16 17:51:02,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2020-01-16 17:51:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3136. [2020-01-16 17:51:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-01-16 17:51:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15621 transitions. [2020-01-16 17:51:02,612 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15621 transitions. Word has length 31 [2020-01-16 17:51:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:02,613 INFO L478 AbstractCegarLoop]: Abstraction has 3136 states and 15621 transitions. [2020-01-16 17:51:02,613 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15621 transitions. [2020-01-16 17:51:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:02,618 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:02,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:02,618 INFO L426 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:02,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:02,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1988167122, now seen corresponding path program 100 times [2020-01-16 17:51:02,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:02,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499249620] [2020-01-16 17:51:02,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:03,184 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:51:03,315 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:03,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499249620] [2020-01-16 17:51:03,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:03,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:03,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752359389] [2020-01-16 17:51:03,325 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:03,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:03,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:03,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:03,326 INFO L87 Difference]: Start difference. First operand 3136 states and 15621 transitions. Second operand 12 states. [2020-01-16 17:51:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:03,685 INFO L93 Difference]: Finished difference Result 6071 states and 26989 transitions. [2020-01-16 17:51:03,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:03,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:03,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:03,700 INFO L225 Difference]: With dead ends: 6071 [2020-01-16 17:51:03,700 INFO L226 Difference]: Without dead ends: 6046 [2020-01-16 17:51:03,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-01-16 17:51:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3129. [2020-01-16 17:51:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:51:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15602 transitions. [2020-01-16 17:51:03,926 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15602 transitions. Word has length 31 [2020-01-16 17:51:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:03,926 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15602 transitions. [2020-01-16 17:51:03,926 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15602 transitions. [2020-01-16 17:51:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:03,931 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:03,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:03,932 INFO L426 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:03,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1886139958, now seen corresponding path program 101 times [2020-01-16 17:51:03,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:03,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259922869] [2020-01-16 17:51:03,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:04,600 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:04,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-01-16 17:51:04,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259922869] [2020-01-16 17:51:04,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:04,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:04,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751884390] [2020-01-16 17:51:04,610 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:04,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:04,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:04,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:04,611 INFO L87 Difference]: Start difference. First operand 3129 states and 15602 transitions. Second operand 12 states. [2020-01-16 17:51:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:04,839 INFO L93 Difference]: Finished difference Result 6066 states and 26979 transitions. [2020-01-16 17:51:04,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:04,839 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:04,854 INFO L225 Difference]: With dead ends: 6066 [2020-01-16 17:51:04,854 INFO L226 Difference]: Without dead ends: 6049 [2020-01-16 17:51:04,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-01-16 17:51:05,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3135. [2020-01-16 17:51:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:51:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15613 transitions. [2020-01-16 17:51:05,076 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15613 transitions. Word has length 31 [2020-01-16 17:51:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:05,077 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15613 transitions. [2020-01-16 17:51:05,077 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15613 transitions. [2020-01-16 17:51:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:05,082 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:05,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:05,082 INFO L426 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:05,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:05,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1563855886, now seen corresponding path program 102 times [2020-01-16 17:51:05,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:05,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729265880] [2020-01-16 17:51:05,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:05,626 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:51:05,753 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:05,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-01-16 17:51:05,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729265880] [2020-01-16 17:51:05,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:05,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:05,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587167019] [2020-01-16 17:51:05,763 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:05,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:05,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:05,764 INFO L87 Difference]: Start difference. First operand 3135 states and 15613 transitions. Second operand 12 states. [2020-01-16 17:51:06,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:06,007 INFO L93 Difference]: Finished difference Result 6067 states and 26975 transitions. [2020-01-16 17:51:06,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:06,007 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:06,022 INFO L225 Difference]: With dead ends: 6067 [2020-01-16 17:51:06,022 INFO L226 Difference]: Without dead ends: 6037 [2020-01-16 17:51:06,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-01-16 17:51:06,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3123. [2020-01-16 17:51:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:51:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15585 transitions. [2020-01-16 17:51:06,242 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15585 transitions. Word has length 31 [2020-01-16 17:51:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:06,242 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15585 transitions. [2020-01-16 17:51:06,242 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15585 transitions. [2020-01-16 17:51:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:06,247 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:06,248 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:06,248 INFO L426 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:06,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:06,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1551817972, now seen corresponding path program 103 times [2020-01-16 17:51:06,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:06,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527713174] [2020-01-16 17:51:06,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:06,849 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:51:06,978 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:06,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-01-16 17:51:06,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527713174] [2020-01-16 17:51:06,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:06,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:06,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874055189] [2020-01-16 17:51:06,989 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:06,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:06,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:06,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:06,990 INFO L87 Difference]: Start difference. First operand 3123 states and 15585 transitions. Second operand 12 states. [2020-01-16 17:51:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:07,224 INFO L93 Difference]: Finished difference Result 6082 states and 27018 transitions. [2020-01-16 17:51:07,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:07,224 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:07,239 INFO L225 Difference]: With dead ends: 6082 [2020-01-16 17:51:07,239 INFO L226 Difference]: Without dead ends: 6062 [2020-01-16 17:51:07,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-01-16 17:51:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3137. [2020-01-16 17:51:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-01-16 17:51:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15624 transitions. [2020-01-16 17:51:07,465 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15624 transitions. Word has length 31 [2020-01-16 17:51:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:07,465 INFO L478 AbstractCegarLoop]: Abstraction has 3137 states and 15624 transitions. [2020-01-16 17:51:07,465 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15624 transitions. [2020-01-16 17:51:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:07,471 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:07,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:07,471 INFO L426 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:07,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:07,471 INFO L82 PathProgramCache]: Analyzing trace with hash 706846520, now seen corresponding path program 104 times [2020-01-16 17:51:07,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:07,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673502529] [2020-01-16 17:51:07,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:08,011 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:51:08,139 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:08,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673502529] [2020-01-16 17:51:08,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:08,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:08,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311634979] [2020-01-16 17:51:08,150 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:08,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:08,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:08,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:08,150 INFO L87 Difference]: Start difference. First operand 3137 states and 15624 transitions. Second operand 12 states. [2020-01-16 17:51:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:08,365 INFO L93 Difference]: Finished difference Result 6079 states and 27006 transitions. [2020-01-16 17:51:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:08,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:08,380 INFO L225 Difference]: With dead ends: 6079 [2020-01-16 17:51:08,381 INFO L226 Difference]: Without dead ends: 6056 [2020-01-16 17:51:08,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:08,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-01-16 17:51:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3131. [2020-01-16 17:51:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:51:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15607 transitions. [2020-01-16 17:51:08,609 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15607 transitions. Word has length 31 [2020-01-16 17:51:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:08,609 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15607 transitions. [2020-01-16 17:51:08,609 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15607 transitions. [2020-01-16 17:51:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:08,614 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:08,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:08,615 INFO L426 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:08,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash 491039882, now seen corresponding path program 105 times [2020-01-16 17:51:08,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:08,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858862280] [2020-01-16 17:51:08,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:09,408 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:09,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-01-16 17:51:09,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858862280] [2020-01-16 17:51:09,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:09,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:09,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457101395] [2020-01-16 17:51:09,418 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:09,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:09,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:09,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:09,419 INFO L87 Difference]: Start difference. First operand 3131 states and 15607 transitions. Second operand 12 states. [2020-01-16 17:51:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:09,640 INFO L93 Difference]: Finished difference Result 6092 states and 27033 transitions. [2020-01-16 17:51:09,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:09,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:09,656 INFO L225 Difference]: With dead ends: 6092 [2020-01-16 17:51:09,656 INFO L226 Difference]: Without dead ends: 6072 [2020-01-16 17:51:09,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2020-01-16 17:51:09,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 3142. [2020-01-16 17:51:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-01-16 17:51:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15627 transitions. [2020-01-16 17:51:09,882 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15627 transitions. Word has length 31 [2020-01-16 17:51:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:09,882 INFO L478 AbstractCegarLoop]: Abstraction has 3142 states and 15627 transitions. [2020-01-16 17:51:09,882 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15627 transitions. [2020-01-16 17:51:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:09,888 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:09,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:09,888 INFO L426 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:09,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:09,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1828607096, now seen corresponding path program 106 times [2020-01-16 17:51:09,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:09,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858618971] [2020-01-16 17:51:09,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:10,456 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:51:10,581 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:10,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858618971] [2020-01-16 17:51:10,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:10,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:10,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317858810] [2020-01-16 17:51:10,591 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:10,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:10,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:10,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:10,592 INFO L87 Difference]: Start difference. First operand 3142 states and 15627 transitions. Second operand 12 states. [2020-01-16 17:51:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:10,782 INFO L93 Difference]: Finished difference Result 6094 states and 27027 transitions. [2020-01-16 17:51:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:10,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:10,796 INFO L225 Difference]: With dead ends: 6094 [2020-01-16 17:51:10,796 INFO L226 Difference]: Without dead ends: 6061 [2020-01-16 17:51:10,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-01-16 17:51:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3131. [2020-01-16 17:51:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:51:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15599 transitions. [2020-01-16 17:51:11,019 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15599 transitions. Word has length 31 [2020-01-16 17:51:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:11,019 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15599 transitions. [2020-01-16 17:51:11,019 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15599 transitions. [2020-01-16 17:51:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:11,024 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:11,024 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:11,024 INFO L426 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:11,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:11,024 INFO L82 PathProgramCache]: Analyzing trace with hash -778242806, now seen corresponding path program 107 times [2020-01-16 17:51:11,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:11,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113122931] [2020-01-16 17:51:11,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:11,695 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:11,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113122931] [2020-01-16 17:51:11,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:11,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:11,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552724979] [2020-01-16 17:51:11,705 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:11,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:11,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:11,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:11,706 INFO L87 Difference]: Start difference. First operand 3131 states and 15599 transitions. Second operand 12 states. [2020-01-16 17:51:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:11,945 INFO L93 Difference]: Finished difference Result 6082 states and 27003 transitions. [2020-01-16 17:51:11,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:11,945 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:11,961 INFO L225 Difference]: With dead ends: 6082 [2020-01-16 17:51:11,961 INFO L226 Difference]: Without dead ends: 6065 [2020-01-16 17:51:11,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-01-16 17:51:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3138. [2020-01-16 17:51:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-01-16 17:51:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15612 transitions. [2020-01-16 17:51:12,183 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15612 transitions. Word has length 31 [2020-01-16 17:51:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:12,183 INFO L478 AbstractCegarLoop]: Abstraction has 3138 states and 15612 transitions. [2020-01-16 17:51:12,183 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15612 transitions. [2020-01-16 17:51:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:12,189 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:12,189 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:12,189 INFO L426 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:12,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:12,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1404295860, now seen corresponding path program 108 times [2020-01-16 17:51:12,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:12,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281755986] [2020-01-16 17:51:12,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:12,755 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:51:12,887 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:12,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281755986] [2020-01-16 17:51:12,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:12,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:12,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658973827] [2020-01-16 17:51:12,898 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:12,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:12,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:12,899 INFO L87 Difference]: Start difference. First operand 3138 states and 15612 transitions. Second operand 12 states. [2020-01-16 17:51:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:13,085 INFO L93 Difference]: Finished difference Result 6087 states and 27006 transitions. [2020-01-16 17:51:13,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:13,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:13,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:13,100 INFO L225 Difference]: With dead ends: 6087 [2020-01-16 17:51:13,101 INFO L226 Difference]: Without dead ends: 6050 [2020-01-16 17:51:13,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:13,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-01-16 17:51:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3123. [2020-01-16 17:51:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:51:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15577 transitions. [2020-01-16 17:51:13,327 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15577 transitions. Word has length 31 [2020-01-16 17:51:13,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:13,328 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15577 transitions. [2020-01-16 17:51:13,328 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15577 transitions. [2020-01-16 17:51:13,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:13,333 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:13,333 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:13,333 INFO L426 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:13,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:13,333 INFO L82 PathProgramCache]: Analyzing trace with hash 858760308, now seen corresponding path program 109 times [2020-01-16 17:51:13,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:13,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108647077] [2020-01-16 17:51:13,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:14,059 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:14,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108647077] [2020-01-16 17:51:14,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:14,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:14,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340575962] [2020-01-16 17:51:14,069 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:14,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:14,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:14,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:14,070 INFO L87 Difference]: Start difference. First operand 3123 states and 15577 transitions. Second operand 12 states. [2020-01-16 17:51:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:14,306 INFO L93 Difference]: Finished difference Result 6088 states and 27027 transitions. [2020-01-16 17:51:14,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:14,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:14,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:14,321 INFO L225 Difference]: With dead ends: 6088 [2020-01-16 17:51:14,321 INFO L226 Difference]: Without dead ends: 6068 [2020-01-16 17:51:14,321 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-01-16 17:51:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 3139. [2020-01-16 17:51:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-01-16 17:51:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15622 transitions. [2020-01-16 17:51:14,557 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15622 transitions. Word has length 31 [2020-01-16 17:51:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:14,557 INFO L478 AbstractCegarLoop]: Abstraction has 3139 states and 15622 transitions. [2020-01-16 17:51:14,558 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15622 transitions. [2020-01-16 17:51:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:14,563 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:14,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:14,563 INFO L426 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:14,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:14,563 INFO L82 PathProgramCache]: Analyzing trace with hash -831182596, now seen corresponding path program 110 times [2020-01-16 17:51:14,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:14,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60281849] [2020-01-16 17:51:14,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:15,122 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:51:15,248 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:15,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-01-16 17:51:15,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60281849] [2020-01-16 17:51:15,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:15,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:15,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313394686] [2020-01-16 17:51:15,258 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:15,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:15,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:15,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:15,259 INFO L87 Difference]: Start difference. First operand 3139 states and 15622 transitions. Second operand 12 states. [2020-01-16 17:51:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:15,541 INFO L93 Difference]: Finished difference Result 6086 states and 27016 transitions. [2020-01-16 17:51:15,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:15,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:15,557 INFO L225 Difference]: With dead ends: 6086 [2020-01-16 17:51:15,557 INFO L226 Difference]: Without dead ends: 6061 [2020-01-16 17:51:15,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-01-16 17:51:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3132. [2020-01-16 17:51:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:51:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15602 transitions. [2020-01-16 17:51:15,781 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15602 transitions. Word has length 31 [2020-01-16 17:51:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:15,781 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15602 transitions. [2020-01-16 17:51:15,781 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15602 transitions. [2020-01-16 17:51:15,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:15,787 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:15,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:15,787 INFO L426 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:15,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash 222293454, now seen corresponding path program 111 times [2020-01-16 17:51:15,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:15,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396989540] [2020-01-16 17:51:15,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:16,337 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:51:16,471 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:16,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396989540] [2020-01-16 17:51:16,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:16,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:16,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918972103] [2020-01-16 17:51:16,481 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:16,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:16,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:16,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:16,482 INFO L87 Difference]: Start difference. First operand 3132 states and 15602 transitions. Second operand 12 states. [2020-01-16 17:51:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:16,702 INFO L93 Difference]: Finished difference Result 6096 states and 27036 transitions. [2020-01-16 17:51:16,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:16,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:16,717 INFO L225 Difference]: With dead ends: 6096 [2020-01-16 17:51:16,717 INFO L226 Difference]: Without dead ends: 6076 [2020-01-16 17:51:16,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-01-16 17:51:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3143. [2020-01-16 17:51:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-01-16 17:51:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15622 transitions. [2020-01-16 17:51:16,943 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15622 transitions. Word has length 31 [2020-01-16 17:51:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:16,943 INFO L478 AbstractCegarLoop]: Abstraction has 3143 states and 15622 transitions. [2020-01-16 17:51:16,943 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15622 transitions. [2020-01-16 17:51:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:16,948 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:16,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:16,949 INFO L426 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:16,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:16,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1559860668, now seen corresponding path program 112 times [2020-01-16 17:51:16,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:16,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180593457] [2020-01-16 17:51:16,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:17,527 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:51:17,655 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:17,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180593457] [2020-01-16 17:51:17,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:17,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:17,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446802160] [2020-01-16 17:51:17,666 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:17,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:17,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:17,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:17,667 INFO L87 Difference]: Start difference. First operand 3143 states and 15622 transitions. Second operand 12 states. [2020-01-16 17:51:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:17,861 INFO L93 Difference]: Finished difference Result 6098 states and 27030 transitions. [2020-01-16 17:51:17,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:17,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:17,876 INFO L225 Difference]: With dead ends: 6098 [2020-01-16 17:51:17,877 INFO L226 Difference]: Without dead ends: 6065 [2020-01-16 17:51:17,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-01-16 17:51:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3132. [2020-01-16 17:51:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:51:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15593 transitions. [2020-01-16 17:51:18,104 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15593 transitions. Word has length 31 [2020-01-16 17:51:18,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:18,104 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15593 transitions. [2020-01-16 17:51:18,104 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15593 transitions. [2020-01-16 17:51:18,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:18,110 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:18,110 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:18,110 INFO L426 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:18,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:18,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1978695374, now seen corresponding path program 113 times [2020-01-16 17:51:18,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:18,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493610773] [2020-01-16 17:51:18,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:18,672 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:51:18,807 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:18,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493610773] [2020-01-16 17:51:18,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:18,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:18,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143402261] [2020-01-16 17:51:18,817 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:18,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:18,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:18,817 INFO L87 Difference]: Start difference. First operand 3132 states and 15593 transitions. Second operand 12 states. [2020-01-16 17:51:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:19,097 INFO L93 Difference]: Finished difference Result 6089 states and 27012 transitions. [2020-01-16 17:51:19,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:19,097 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:19,113 INFO L225 Difference]: With dead ends: 6089 [2020-01-16 17:51:19,113 INFO L226 Difference]: Without dead ends: 6071 [2020-01-16 17:51:19,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-01-16 17:51:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3140. [2020-01-16 17:51:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-01-16 17:51:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15608 transitions. [2020-01-16 17:51:19,341 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15608 transitions. Word has length 31 [2020-01-16 17:51:19,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:19,341 INFO L478 AbstractCegarLoop]: Abstraction has 3140 states and 15608 transitions. [2020-01-16 17:51:19,341 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15608 transitions. [2020-01-16 17:51:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:19,347 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:19,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:19,347 INFO L426 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:19,347 INFO L82 PathProgramCache]: Analyzing trace with hash 711238196, now seen corresponding path program 114 times [2020-01-16 17:51:19,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:19,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985241226] [2020-01-16 17:51:19,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:19,913 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:51:20,040 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:20,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985241226] [2020-01-16 17:51:20,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:20,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:20,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886252856] [2020-01-16 17:51:20,050 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:20,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:20,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:20,051 INFO L87 Difference]: Start difference. First operand 3140 states and 15608 transitions. Second operand 12 states. [2020-01-16 17:51:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:20,274 INFO L93 Difference]: Finished difference Result 6093 states and 27012 transitions. [2020-01-16 17:51:20,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:20,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:20,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:20,289 INFO L225 Difference]: With dead ends: 6093 [2020-01-16 17:51:20,289 INFO L226 Difference]: Without dead ends: 6054 [2020-01-16 17:51:20,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:20,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-01-16 17:51:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3123. [2020-01-16 17:51:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:51:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15569 transitions. [2020-01-16 17:51:20,511 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15569 transitions. Word has length 31 [2020-01-16 17:51:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:20,511 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15569 transitions. [2020-01-16 17:51:20,512 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15569 transitions. [2020-01-16 17:51:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:20,517 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:20,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:20,517 INFO L426 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:20,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash -679268808, now seen corresponding path program 115 times [2020-01-16 17:51:20,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:20,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999253188] [2020-01-16 17:51:20,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:21,125 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-01-16 17:51:21,254 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:21,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999253188] [2020-01-16 17:51:21,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:21,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:21,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904018610] [2020-01-16 17:51:21,265 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:21,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:21,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:21,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:21,265 INFO L87 Difference]: Start difference. First operand 3123 states and 15569 transitions. Second operand 12 states. [2020-01-16 17:51:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:21,543 INFO L93 Difference]: Finished difference Result 6071 states and 26979 transitions. [2020-01-16 17:51:21,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:21,544 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:21,559 INFO L225 Difference]: With dead ends: 6071 [2020-01-16 17:51:21,559 INFO L226 Difference]: Without dead ends: 6054 [2020-01-16 17:51:21,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-01-16 17:51:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3136. [2020-01-16 17:51:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-01-16 17:51:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15606 transitions. [2020-01-16 17:51:21,781 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15606 transitions. Word has length 31 [2020-01-16 17:51:21,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:21,782 INFO L478 AbstractCegarLoop]: Abstraction has 3136 states and 15606 transitions. [2020-01-16 17:51:21,782 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15606 transitions. [2020-01-16 17:51:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:21,787 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:21,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:21,787 INFO L426 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:21,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1524240260, now seen corresponding path program 116 times [2020-01-16 17:51:21,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:21,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012160236] [2020-01-16 17:51:21,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:22,359 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:51:22,490 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:22,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-01-16 17:51:22,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012160236] [2020-01-16 17:51:22,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:22,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:22,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745071500] [2020-01-16 17:51:22,500 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:22,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:22,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:22,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:22,500 INFO L87 Difference]: Start difference. First operand 3136 states and 15606 transitions. Second operand 12 states. [2020-01-16 17:51:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:22,731 INFO L93 Difference]: Finished difference Result 6072 states and 26975 transitions. [2020-01-16 17:51:22,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:22,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:22,747 INFO L225 Difference]: With dead ends: 6072 [2020-01-16 17:51:22,747 INFO L226 Difference]: Without dead ends: 6048 [2020-01-16 17:51:22,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-01-16 17:51:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3130. [2020-01-16 17:51:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:51:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15589 transitions. [2020-01-16 17:51:22,968 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15589 transitions. Word has length 31 [2020-01-16 17:51:22,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:22,968 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15589 transitions. [2020-01-16 17:51:22,968 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15589 transitions. [2020-01-16 17:51:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:22,973 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:22,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:22,973 INFO L426 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:22,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:22,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1315735662, now seen corresponding path program 117 times [2020-01-16 17:51:22,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:22,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22775050] [2020-01-16 17:51:22,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:23,652 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:23,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22775050] [2020-01-16 17:51:23,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:23,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:23,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451894500] [2020-01-16 17:51:23,662 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:23,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:23,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:23,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:23,663 INFO L87 Difference]: Start difference. First operand 3130 states and 15589 transitions. Second operand 12 states. [2020-01-16 17:51:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:23,970 INFO L93 Difference]: Finished difference Result 6076 states and 26982 transitions. [2020-01-16 17:51:23,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:23,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:23,985 INFO L225 Difference]: With dead ends: 6076 [2020-01-16 17:51:23,986 INFO L226 Difference]: Without dead ends: 6059 [2020-01-16 17:51:23,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-01-16 17:51:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3137. [2020-01-16 17:51:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-01-16 17:51:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15602 transitions. [2020-01-16 17:51:24,211 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15602 transitions. Word has length 31 [2020-01-16 17:51:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:24,211 INFO L478 AbstractCegarLoop]: Abstraction has 3137 states and 15602 transitions. [2020-01-16 17:51:24,211 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15602 transitions. [2020-01-16 17:51:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:24,217 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:24,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:24,217 INFO L426 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:24,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:24,217 INFO L82 PathProgramCache]: Analyzing trace with hash 866803004, now seen corresponding path program 118 times [2020-01-16 17:51:24,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:24,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484555064] [2020-01-16 17:51:24,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:24,764 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:51:24,890 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:24,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-01-16 17:51:24,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484555064] [2020-01-16 17:51:24,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:24,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:24,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420019028] [2020-01-16 17:51:24,901 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:24,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:24,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:24,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:24,901 INFO L87 Difference]: Start difference. First operand 3137 states and 15602 transitions. Second operand 12 states. [2020-01-16 17:51:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:25,103 INFO L93 Difference]: Finished difference Result 6081 states and 26985 transitions. [2020-01-16 17:51:25,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:25,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:25,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:25,118 INFO L225 Difference]: With dead ends: 6081 [2020-01-16 17:51:25,118 INFO L226 Difference]: Without dead ends: 6052 [2020-01-16 17:51:25,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2020-01-16 17:51:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3130. [2020-01-16 17:51:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:51:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15582 transitions. [2020-01-16 17:51:25,344 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15582 transitions. Word has length 31 [2020-01-16 17:51:25,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:25,344 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15582 transitions. [2020-01-16 17:51:25,344 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:25,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15582 transitions. [2020-01-16 17:51:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:25,349 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:25,350 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:25,350 INFO L426 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1709948946, now seen corresponding path program 119 times [2020-01-16 17:51:25,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:25,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815544177] [2020-01-16 17:51:25,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:25,903 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:51:26,038 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:26,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815544177] [2020-01-16 17:51:26,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:26,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:26,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136055749] [2020-01-16 17:51:26,049 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:26,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:26,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:26,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:26,049 INFO L87 Difference]: Start difference. First operand 3130 states and 15582 transitions. Second operand 12 states. [2020-01-16 17:51:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:26,344 INFO L93 Difference]: Finished difference Result 6079 states and 26982 transitions. [2020-01-16 17:51:26,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:26,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:26,359 INFO L225 Difference]: With dead ends: 6079 [2020-01-16 17:51:26,359 INFO L226 Difference]: Without dead ends: 6061 [2020-01-16 17:51:26,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-01-16 17:51:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3138. [2020-01-16 17:51:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-01-16 17:51:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15597 transitions. [2020-01-16 17:51:26,586 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15597 transitions. Word has length 31 [2020-01-16 17:51:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:26,587 INFO L478 AbstractCegarLoop]: Abstraction has 3138 states and 15597 transitions. [2020-01-16 17:51:26,587 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15597 transitions. [2020-01-16 17:51:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:26,592 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:26,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:26,592 INFO L426 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:26,593 INFO L82 PathProgramCache]: Analyzing trace with hash 442491768, now seen corresponding path program 120 times [2020-01-16 17:51:26,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:26,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259702124] [2020-01-16 17:51:26,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:27,141 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:51:27,273 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:27,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-01-16 17:51:27,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259702124] [2020-01-16 17:51:27,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:27,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:27,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263276487] [2020-01-16 17:51:27,284 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:27,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:27,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:27,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:27,284 INFO L87 Difference]: Start difference. First operand 3138 states and 15597 transitions. Second operand 12 states. [2020-01-16 17:51:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:27,557 INFO L93 Difference]: Finished difference Result 6083 states and 26982 transitions. [2020-01-16 17:51:27,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:27,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:27,571 INFO L225 Difference]: With dead ends: 6083 [2020-01-16 17:51:27,571 INFO L226 Difference]: Without dead ends: 6027 [2020-01-16 17:51:27,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-01-16 17:51:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3104. [2020-01-16 17:51:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-01-16 17:51:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15527 transitions. [2020-01-16 17:51:27,794 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15527 transitions. Word has length 31 [2020-01-16 17:51:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:27,795 INFO L478 AbstractCegarLoop]: Abstraction has 3104 states and 15527 transitions. [2020-01-16 17:51:27,795 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15527 transitions. [2020-01-16 17:51:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:27,800 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:27,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:27,800 INFO L426 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:27,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:27,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1165855998, now seen corresponding path program 121 times [2020-01-16 17:51:27,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:27,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151888752] [2020-01-16 17:51:27,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:28,361 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:51:28,540 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:51:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:28,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151888752] [2020-01-16 17:51:28,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:28,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:28,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193129217] [2020-01-16 17:51:28,551 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:28,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:28,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:28,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:28,551 INFO L87 Difference]: Start difference. First operand 3104 states and 15527 transitions. Second operand 12 states. [2020-01-16 17:51:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:28,885 INFO L93 Difference]: Finished difference Result 6078 states and 27027 transitions. [2020-01-16 17:51:28,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:28,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:28,900 INFO L225 Difference]: With dead ends: 6078 [2020-01-16 17:51:28,900 INFO L226 Difference]: Without dead ends: 6059 [2020-01-16 17:51:28,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-01-16 17:51:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3139. [2020-01-16 17:51:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-01-16 17:51:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15656 transitions. [2020-01-16 17:51:29,122 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15656 transitions. Word has length 31 [2020-01-16 17:51:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:29,122 INFO L478 AbstractCegarLoop]: Abstraction has 3139 states and 15656 transitions. [2020-01-16 17:51:29,122 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15656 transitions. [2020-01-16 17:51:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:29,127 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:29,127 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:29,127 INFO L426 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:29,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:29,128 INFO L82 PathProgramCache]: Analyzing trace with hash -101601180, now seen corresponding path program 122 times [2020-01-16 17:51:29,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:29,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151713069] [2020-01-16 17:51:29,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:29,688 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:51:29,821 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:29,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151713069] [2020-01-16 17:51:29,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:29,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:29,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708856093] [2020-01-16 17:51:29,832 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:29,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:29,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:29,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:29,832 INFO L87 Difference]: Start difference. First operand 3139 states and 15656 transitions. Second operand 12 states. [2020-01-16 17:51:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:30,148 INFO L93 Difference]: Finished difference Result 6079 states and 27021 transitions. [2020-01-16 17:51:30,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:30,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:30,163 INFO L225 Difference]: With dead ends: 6079 [2020-01-16 17:51:30,164 INFO L226 Difference]: Without dead ends: 6051 [2020-01-16 17:51:30,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-01-16 17:51:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3131. [2020-01-16 17:51:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:51:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15634 transitions. [2020-01-16 17:51:30,385 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15634 transitions. Word has length 31 [2020-01-16 17:51:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:30,385 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15634 transitions. [2020-01-16 17:51:30,385 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15634 transitions. [2020-01-16 17:51:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:30,390 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:30,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:30,391 INFO L426 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:30,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:30,391 INFO L82 PathProgramCache]: Analyzing trace with hash 317233526, now seen corresponding path program 123 times [2020-01-16 17:51:30,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:30,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691367285] [2020-01-16 17:51:30,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:31,092 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:51:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:31,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691367285] [2020-01-16 17:51:31,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:31,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:31,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573212392] [2020-01-16 17:51:31,103 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:31,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:31,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:31,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:31,103 INFO L87 Difference]: Start difference. First operand 3131 states and 15634 transitions. Second operand 12 states. [2020-01-16 17:51:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:31,341 INFO L93 Difference]: Finished difference Result 6075 states and 27013 transitions. [2020-01-16 17:51:31,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:31,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:31,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:31,355 INFO L225 Difference]: With dead ends: 6075 [2020-01-16 17:51:31,355 INFO L226 Difference]: Without dead ends: 6056 [2020-01-16 17:51:31,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-01-16 17:51:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3138. [2020-01-16 17:51:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-01-16 17:51:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15647 transitions. [2020-01-16 17:51:31,577 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15647 transitions. Word has length 31 [2020-01-16 17:51:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:31,577 INFO L478 AbstractCegarLoop]: Abstraction has 3138 states and 15647 transitions. [2020-01-16 17:51:31,577 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15647 transitions. [2020-01-16 17:51:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:31,582 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:31,582 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:31,582 INFO L426 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:31,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1654800740, now seen corresponding path program 124 times [2020-01-16 17:51:31,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:31,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900976499] [2020-01-16 17:51:31,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:32,140 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:51:32,273 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:32,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900976499] [2020-01-16 17:51:32,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:32,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:32,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278684619] [2020-01-16 17:51:32,283 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:32,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:32,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:32,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:32,283 INFO L87 Difference]: Start difference. First operand 3138 states and 15647 transitions. Second operand 12 states. [2020-01-16 17:51:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:32,555 INFO L93 Difference]: Finished difference Result 6074 states and 27004 transitions. [2020-01-16 17:51:32,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:32,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:32,570 INFO L225 Difference]: With dead ends: 6074 [2020-01-16 17:51:32,570 INFO L226 Difference]: Without dead ends: 6049 [2020-01-16 17:51:32,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-01-16 17:51:32,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3131. [2020-01-16 17:51:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:51:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15627 transitions. [2020-01-16 17:51:32,796 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15627 transitions. Word has length 31 [2020-01-16 17:51:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:32,796 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15627 transitions. [2020-01-16 17:51:32,796 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15627 transitions. [2020-01-16 17:51:32,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:32,802 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:32,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:32,802 INFO L426 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:32,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1586690506, now seen corresponding path program 125 times [2020-01-16 17:51:32,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:32,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858566088] [2020-01-16 17:51:32,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:33,356 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:51:33,484 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:51:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:33,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858566088] [2020-01-16 17:51:33,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:33,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:33,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953664639] [2020-01-16 17:51:33,496 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:33,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:33,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:33,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:33,496 INFO L87 Difference]: Start difference. First operand 3131 states and 15627 transitions. Second operand 12 states. [2020-01-16 17:51:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:33,738 INFO L93 Difference]: Finished difference Result 6077 states and 27010 transitions. [2020-01-16 17:51:33,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:33,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:33,754 INFO L225 Difference]: With dead ends: 6077 [2020-01-16 17:51:33,754 INFO L226 Difference]: Without dead ends: 6057 [2020-01-16 17:51:33,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:33,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-01-16 17:51:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3138. [2020-01-16 17:51:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-01-16 17:51:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15640 transitions. [2020-01-16 17:51:33,981 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15640 transitions. Word has length 31 [2020-01-16 17:51:33,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:33,981 INFO L478 AbstractCegarLoop]: Abstraction has 3138 states and 15640 transitions. [2020-01-16 17:51:33,981 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15640 transitions. [2020-01-16 17:51:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:33,986 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:33,986 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:33,986 INFO L426 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:33,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:33,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1018333886, now seen corresponding path program 126 times [2020-01-16 17:51:33,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:33,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070605252] [2020-01-16 17:51:33,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:34,537 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:51:34,668 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:51:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:34,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070605252] [2020-01-16 17:51:34,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:34,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:34,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536955200] [2020-01-16 17:51:34,678 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:34,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:34,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:34,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:34,678 INFO L87 Difference]: Start difference. First operand 3138 states and 15640 transitions. Second operand 12 states. [2020-01-16 17:51:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:34,941 INFO L93 Difference]: Finished difference Result 6075 states and 26999 transitions. [2020-01-16 17:51:34,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:34,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:34,957 INFO L225 Difference]: With dead ends: 6075 [2020-01-16 17:51:34,958 INFO L226 Difference]: Without dead ends: 6043 [2020-01-16 17:51:34,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-01-16 17:51:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3124. [2020-01-16 17:51:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:51:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15607 transitions. [2020-01-16 17:51:35,182 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15607 transitions. Word has length 31 [2020-01-16 17:51:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:35,183 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15607 transitions. [2020-01-16 17:51:35,183 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15607 transitions. [2020-01-16 17:51:35,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:35,188 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:35,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:35,188 INFO L426 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:35,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1384747292, now seen corresponding path program 127 times [2020-01-16 17:51:35,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:35,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340208171] [2020-01-16 17:51:35,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:35,883 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:51:35,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-01-16 17:51:35,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340208171] [2020-01-16 17:51:35,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:35,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:35,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198757907] [2020-01-16 17:51:35,939 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:35,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:35,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:35,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:35,939 INFO L87 Difference]: Start difference. First operand 3124 states and 15607 transitions. Second operand 12 states. [2020-01-16 17:51:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:36,187 INFO L93 Difference]: Finished difference Result 6092 states and 27051 transitions. [2020-01-16 17:51:36,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:36,187 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:36,202 INFO L225 Difference]: With dead ends: 6092 [2020-01-16 17:51:36,202 INFO L226 Difference]: Without dead ends: 6073 [2020-01-16 17:51:36,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2020-01-16 17:51:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3143. [2020-01-16 17:51:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-01-16 17:51:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15659 transitions. [2020-01-16 17:51:36,432 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15659 transitions. Word has length 31 [2020-01-16 17:51:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:36,432 INFO L478 AbstractCegarLoop]: Abstraction has 3143 states and 15659 transitions. [2020-01-16 17:51:36,433 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15659 transitions. [2020-01-16 17:51:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:36,438 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:36,438 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:36,438 INFO L426 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:36,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1642762826, now seen corresponding path program 128 times [2020-01-16 17:51:36,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:36,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838537086] [2020-01-16 17:51:36,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:36,998 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:51:37,129 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:37,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838537086] [2020-01-16 17:51:37,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:37,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:37,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936502259] [2020-01-16 17:51:37,140 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:37,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:37,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:37,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:37,140 INFO L87 Difference]: Start difference. First operand 3143 states and 15659 transitions. Second operand 12 states. [2020-01-16 17:51:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:37,379 INFO L93 Difference]: Finished difference Result 6093 states and 27045 transitions. [2020-01-16 17:51:37,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:37,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:37,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:37,395 INFO L225 Difference]: With dead ends: 6093 [2020-01-16 17:51:37,395 INFO L226 Difference]: Without dead ends: 6065 [2020-01-16 17:51:37,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-01-16 17:51:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3135. [2020-01-16 17:51:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:51:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15636 transitions. [2020-01-16 17:51:37,620 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15636 transitions. Word has length 31 [2020-01-16 17:51:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:37,620 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15636 transitions. [2020-01-16 17:51:37,620 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15636 transitions. [2020-01-16 17:51:37,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:37,625 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:37,625 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:37,626 INFO L426 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:37,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:37,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1425130678, now seen corresponding path program 129 times [2020-01-16 17:51:37,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:37,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556028312] [2020-01-16 17:51:37,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:38,205 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:51:38,332 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:51:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:38,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556028312] [2020-01-16 17:51:38,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:38,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:38,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100835810] [2020-01-16 17:51:38,343 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:38,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:38,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:38,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:38,343 INFO L87 Difference]: Start difference. First operand 3135 states and 15636 transitions. Second operand 12 states. [2020-01-16 17:51:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:38,616 INFO L93 Difference]: Finished difference Result 6095 states and 27048 transitions. [2020-01-16 17:51:38,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:38,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:38,631 INFO L225 Difference]: With dead ends: 6095 [2020-01-16 17:51:38,631 INFO L226 Difference]: Without dead ends: 6076 [2020-01-16 17:51:38,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:38,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-01-16 17:51:38,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3144. [2020-01-16 17:51:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2020-01-16 17:51:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 15653 transitions. [2020-01-16 17:51:38,854 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 15653 transitions. Word has length 31 [2020-01-16 17:51:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:38,854 INFO L478 AbstractCegarLoop]: Abstraction has 3144 states and 15653 transitions. [2020-01-16 17:51:38,854 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 15653 transitions. [2020-01-16 17:51:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:38,859 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:38,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:38,862 INFO L426 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:38,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:38,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1495240714, now seen corresponding path program 130 times [2020-01-16 17:51:38,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:38,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694260761] [2020-01-16 17:51:38,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:39,443 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:51:39,575 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:51:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:39,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694260761] [2020-01-16 17:51:39,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:39,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:39,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727431296] [2020-01-16 17:51:39,585 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:39,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:39,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:39,586 INFO L87 Difference]: Start difference. First operand 3144 states and 15653 transitions. Second operand 12 states. [2020-01-16 17:51:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:39,851 INFO L93 Difference]: Finished difference Result 6098 states and 27045 transitions. [2020-01-16 17:51:39,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:39,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:39,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:39,866 INFO L225 Difference]: With dead ends: 6098 [2020-01-16 17:51:39,866 INFO L226 Difference]: Without dead ends: 6067 [2020-01-16 17:51:39,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-01-16 17:51:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3135. [2020-01-16 17:51:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:51:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15627 transitions. [2020-01-16 17:51:40,088 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15627 transitions. Word has length 31 [2020-01-16 17:51:40,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:40,088 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15627 transitions. [2020-01-16 17:51:40,088 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:40,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15627 transitions. [2020-01-16 17:51:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:40,094 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:40,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:40,094 INFO L426 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:40,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash -478793354, now seen corresponding path program 131 times [2020-01-16 17:51:40,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:40,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874495303] [2020-01-16 17:51:40,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:40,668 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:51:40,802 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:51:40,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-01-16 17:51:40,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874495303] [2020-01-16 17:51:40,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:40,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:40,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312982376] [2020-01-16 17:51:40,812 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:40,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:40,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:40,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:40,813 INFO L87 Difference]: Start difference. First operand 3135 states and 15627 transitions. Second operand 12 states. [2020-01-16 17:51:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:41,062 INFO L93 Difference]: Finished difference Result 6099 states and 27047 transitions. [2020-01-16 17:51:41,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:41,063 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:41,078 INFO L225 Difference]: With dead ends: 6099 [2020-01-16 17:51:41,078 INFO L226 Difference]: Without dead ends: 6079 [2020-01-16 17:51:41,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:41,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states. [2020-01-16 17:51:41,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 3146. [2020-01-16 17:51:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-01-16 17:51:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15647 transitions. [2020-01-16 17:51:41,299 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15647 transitions. Word has length 31 [2020-01-16 17:51:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:41,299 INFO L478 AbstractCegarLoop]: Abstraction has 3146 states and 15647 transitions. [2020-01-16 17:51:41,299 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15647 transitions. [2020-01-16 17:51:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:41,305 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:41,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:41,305 INFO L426 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:41,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:41,305 INFO L82 PathProgramCache]: Analyzing trace with hash 858773860, now seen corresponding path program 132 times [2020-01-16 17:51:41,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:41,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837518272] [2020-01-16 17:51:41,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:41,884 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:51:42,014 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:51:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:42,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837518272] [2020-01-16 17:51:42,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:42,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:42,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581948892] [2020-01-16 17:51:42,024 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:42,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:42,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:42,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:42,025 INFO L87 Difference]: Start difference. First operand 3146 states and 15647 transitions. Second operand 12 states. [2020-01-16 17:51:42,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:42,258 INFO L93 Difference]: Finished difference Result 6101 states and 27041 transitions. [2020-01-16 17:51:42,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:42,259 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:42,274 INFO L225 Difference]: With dead ends: 6101 [2020-01-16 17:51:42,274 INFO L226 Difference]: Without dead ends: 6057 [2020-01-16 17:51:42,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-01-16 17:51:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3124. [2020-01-16 17:51:42,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:51:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15597 transitions. [2020-01-16 17:51:42,495 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15597 transitions. Word has length 31 [2020-01-16 17:51:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:42,495 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15597 transitions. [2020-01-16 17:51:42,495 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15597 transitions. [2020-01-16 17:51:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:42,500 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:42,500 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:42,500 INFO L426 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:42,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:42,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1524104676, now seen corresponding path program 133 times [2020-01-16 17:51:42,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:42,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206574218] [2020-01-16 17:51:42,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:43,179 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:51:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:43,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206574218] [2020-01-16 17:51:43,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:43,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:43,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378075700] [2020-01-16 17:51:43,191 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:43,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:43,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:43,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:43,191 INFO L87 Difference]: Start difference. First operand 3124 states and 15597 transitions. Second operand 12 states. [2020-01-16 17:51:43,482 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2020-01-16 17:51:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:43,500 INFO L93 Difference]: Finished difference Result 6080 states and 27013 transitions. [2020-01-16 17:51:43,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:43,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:43,516 INFO L225 Difference]: With dead ends: 6080 [2020-01-16 17:51:43,516 INFO L226 Difference]: Without dead ends: 6061 [2020-01-16 17:51:43,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-01-16 17:51:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3139. [2020-01-16 17:51:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-01-16 17:51:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15640 transitions. [2020-01-16 17:51:43,743 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15640 transitions. Word has length 31 [2020-01-16 17:51:43,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:43,743 INFO L478 AbstractCegarLoop]: Abstraction has 3139 states and 15640 transitions. [2020-01-16 17:51:43,743 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15640 transitions. [2020-01-16 17:51:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:43,749 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:43,749 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:43,749 INFO L426 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:43,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:43,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1433295406, now seen corresponding path program 134 times [2020-01-16 17:51:43,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:43,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891216093] [2020-01-16 17:51:43,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:44,293 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:51:44,425 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:51:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:44,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891216093] [2020-01-16 17:51:44,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:44,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:44,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820910451] [2020-01-16 17:51:44,435 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:44,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:44,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:44,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:44,436 INFO L87 Difference]: Start difference. First operand 3139 states and 15640 transitions. Second operand 12 states. [2020-01-16 17:51:44,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:44,734 INFO L93 Difference]: Finished difference Result 6079 states and 27004 transitions. [2020-01-16 17:51:44,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:44,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:44,748 INFO L225 Difference]: With dead ends: 6079 [2020-01-16 17:51:44,748 INFO L226 Difference]: Without dead ends: 6054 [2020-01-16 17:51:44,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-01-16 17:51:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3132. [2020-01-16 17:51:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:51:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15620 transitions. [2020-01-16 17:51:44,969 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15620 transitions. Word has length 31 [2020-01-16 17:51:44,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:44,969 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15620 transitions. [2020-01-16 17:51:44,970 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:44,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15620 transitions. [2020-01-16 17:51:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:44,975 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:44,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:44,975 INFO L426 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:44,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:44,975 INFO L82 PathProgramCache]: Analyzing trace with hash 887637822, now seen corresponding path program 135 times [2020-01-16 17:51:44,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:44,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934544627] [2020-01-16 17:51:44,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:45,526 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:51:45,657 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:51:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:45,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934544627] [2020-01-16 17:51:45,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:45,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:45,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081954761] [2020-01-16 17:51:45,667 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:45,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:45,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:45,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:45,668 INFO L87 Difference]: Start difference. First operand 3132 states and 15620 transitions. Second operand 12 states. [2020-01-16 17:51:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:45,942 INFO L93 Difference]: Finished difference Result 6086 states and 27018 transitions. [2020-01-16 17:51:45,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:45,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:45,958 INFO L225 Difference]: With dead ends: 6086 [2020-01-16 17:51:45,958 INFO L226 Difference]: Without dead ends: 6067 [2020-01-16 17:51:45,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-01-16 17:51:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3141. [2020-01-16 17:51:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-01-16 17:51:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15637 transitions. [2020-01-16 17:51:46,183 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15637 transitions. Word has length 31 [2020-01-16 17:51:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:46,183 INFO L478 AbstractCegarLoop]: Abstraction has 3141 states and 15637 transitions. [2020-01-16 17:51:46,183 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15637 transitions. [2020-01-16 17:51:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:46,188 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:46,188 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:46,189 INFO L426 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:46,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:46,189 INFO L82 PathProgramCache]: Analyzing trace with hash 957747858, now seen corresponding path program 136 times [2020-01-16 17:51:46,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:46,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735343611] [2020-01-16 17:51:46,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:46,749 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:51:46,883 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:51:46,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-01-16 17:51:46,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735343611] [2020-01-16 17:51:46,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:46,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:46,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342037879] [2020-01-16 17:51:46,893 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:46,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:46,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:46,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:46,893 INFO L87 Difference]: Start difference. First operand 3141 states and 15637 transitions. Second operand 12 states. [2020-01-16 17:51:47,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:47,133 INFO L93 Difference]: Finished difference Result 6089 states and 27015 transitions. [2020-01-16 17:51:47,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:47,133 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:47,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:47,147 INFO L225 Difference]: With dead ends: 6089 [2020-01-16 17:51:47,148 INFO L226 Difference]: Without dead ends: 6058 [2020-01-16 17:51:47,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:47,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-01-16 17:51:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3132. [2020-01-16 17:51:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:51:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15612 transitions. [2020-01-16 17:51:47,373 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15612 transitions. Word has length 31 [2020-01-16 17:51:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:47,373 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15612 transitions. [2020-01-16 17:51:47,373 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15612 transitions. [2020-01-16 17:51:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:47,378 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:47,378 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:47,378 INFO L426 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash 740115710, now seen corresponding path program 137 times [2020-01-16 17:51:47,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:47,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466049769] [2020-01-16 17:51:47,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:47,921 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:51:48,054 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:51:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:48,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466049769] [2020-01-16 17:51:48,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:48,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:48,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078106007] [2020-01-16 17:51:48,064 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:48,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:48,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:48,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:48,064 INFO L87 Difference]: Start difference. First operand 3132 states and 15612 transitions. Second operand 12 states. [2020-01-16 17:51:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:48,365 INFO L93 Difference]: Finished difference Result 6083 states and 27003 transitions. [2020-01-16 17:51:48,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:48,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:48,381 INFO L225 Difference]: With dead ends: 6083 [2020-01-16 17:51:48,381 INFO L226 Difference]: Without dead ends: 6065 [2020-01-16 17:51:48,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-01-16 17:51:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3140. [2020-01-16 17:51:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-01-16 17:51:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15627 transitions. [2020-01-16 17:51:48,609 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15627 transitions. Word has length 31 [2020-01-16 17:51:48,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:48,609 INFO L478 AbstractCegarLoop]: Abstraction has 3140 states and 15627 transitions. [2020-01-16 17:51:48,609 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15627 transitions. [2020-01-16 17:51:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:48,615 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:48,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:48,615 INFO L426 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:48,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:48,615 INFO L82 PathProgramCache]: Analyzing trace with hash -527341468, now seen corresponding path program 138 times [2020-01-16 17:51:48,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:48,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552685694] [2020-01-16 17:51:48,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:49,185 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:51:49,318 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:51:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:49,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552685694] [2020-01-16 17:51:49,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:49,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:49,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162396550] [2020-01-16 17:51:49,328 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:49,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:49,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:49,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:49,329 INFO L87 Difference]: Start difference. First operand 3140 states and 15627 transitions. Second operand 12 states. [2020-01-16 17:51:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:49,556 INFO L93 Difference]: Finished difference Result 6087 states and 27003 transitions. [2020-01-16 17:51:49,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:49,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:49,571 INFO L225 Difference]: With dead ends: 6087 [2020-01-16 17:51:49,571 INFO L226 Difference]: Without dead ends: 6049 [2020-01-16 17:51:49,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-01-16 17:51:49,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3124. [2020-01-16 17:51:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:51:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-01-16 17:51:49,793 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-01-16 17:51:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:49,793 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-01-16 17:51:49,793 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-01-16 17:51:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:49,798 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:49,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:49,798 INFO L426 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:49,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:49,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1364544650, now seen corresponding path program 139 times [2020-01-16 17:51:49,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:49,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417701989] [2020-01-16 17:51:49,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:50,359 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:51:50,491 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:51:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:50,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417701989] [2020-01-16 17:51:50,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:50,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:50,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651699205] [2020-01-16 17:51:50,502 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:50,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:50,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:50,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:50,502 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-01-16 17:51:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:50,756 INFO L93 Difference]: Finished difference Result 6086 states and 27017 transitions. [2020-01-16 17:51:50,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:50,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:50,771 INFO L225 Difference]: With dead ends: 6086 [2020-01-16 17:51:50,771 INFO L226 Difference]: Without dead ends: 6066 [2020-01-16 17:51:50,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2020-01-16 17:51:51,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 3140. [2020-01-16 17:51:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-01-16 17:51:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15634 transitions. [2020-01-16 17:51:51,034 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15634 transitions. Word has length 31 [2020-01-16 17:51:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:51,034 INFO L478 AbstractCegarLoop]: Abstraction has 3140 states and 15634 transitions. [2020-01-16 17:51:51,034 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15634 transitions. [2020-01-16 17:51:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:51,039 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:51,040 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:51,040 INFO L426 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash -325398254, now seen corresponding path program 140 times [2020-01-16 17:51:51,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:51,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192663668] [2020-01-16 17:51:51,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:51,711 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:51:51,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-01-16 17:51:51,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192663668] [2020-01-16 17:51:51,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:51,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:51,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685261005] [2020-01-16 17:51:51,721 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:51,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:51,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:51,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:51,721 INFO L87 Difference]: Start difference. First operand 3140 states and 15634 transitions. Second operand 12 states. [2020-01-16 17:51:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:52,071 INFO L93 Difference]: Finished difference Result 6084 states and 27006 transitions. [2020-01-16 17:51:52,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:52,071 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:52,086 INFO L225 Difference]: With dead ends: 6084 [2020-01-16 17:51:52,086 INFO L226 Difference]: Without dead ends: 6059 [2020-01-16 17:51:52,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-01-16 17:51:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3133. [2020-01-16 17:51:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:51:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15614 transitions. [2020-01-16 17:51:52,308 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15614 transitions. Word has length 31 [2020-01-16 17:51:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:52,308 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15614 transitions. [2020-01-16 17:51:52,308 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15614 transitions. [2020-01-16 17:51:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:52,313 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:52,313 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:52,313 INFO L426 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:52,313 INFO L82 PathProgramCache]: Analyzing trace with hash 728077796, now seen corresponding path program 141 times [2020-01-16 17:51:52,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:52,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120943546] [2020-01-16 17:51:52,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:53,012 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:51:53,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-01-16 17:51:53,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120943546] [2020-01-16 17:51:53,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:53,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:53,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668315009] [2020-01-16 17:51:53,022 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:53,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:53,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:53,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:53,023 INFO L87 Difference]: Start difference. First operand 3133 states and 15614 transitions. Second operand 12 states. [2020-01-16 17:51:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:53,373 INFO L93 Difference]: Finished difference Result 6094 states and 27026 transitions. [2020-01-16 17:51:53,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:53,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:53,388 INFO L225 Difference]: With dead ends: 6094 [2020-01-16 17:51:53,388 INFO L226 Difference]: Without dead ends: 6074 [2020-01-16 17:51:53,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2020-01-16 17:51:53,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 3144. [2020-01-16 17:51:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2020-01-16 17:51:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 15634 transitions. [2020-01-16 17:51:53,617 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 15634 transitions. Word has length 31 [2020-01-16 17:51:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:53,617 INFO L478 AbstractCegarLoop]: Abstraction has 3144 states and 15634 transitions. [2020-01-16 17:51:53,617 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:53,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 15634 transitions. [2020-01-16 17:51:53,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:53,622 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:53,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:53,622 INFO L426 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:53,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:53,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2065645010, now seen corresponding path program 142 times [2020-01-16 17:51:53,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:53,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973308605] [2020-01-16 17:51:53,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:54,183 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-01-16 17:51:54,316 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:51:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:54,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973308605] [2020-01-16 17:51:54,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:54,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:54,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125851201] [2020-01-16 17:51:54,326 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:54,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:54,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:54,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:54,327 INFO L87 Difference]: Start difference. First operand 3144 states and 15634 transitions. Second operand 12 states. [2020-01-16 17:51:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:54,573 INFO L93 Difference]: Finished difference Result 6096 states and 27020 transitions. [2020-01-16 17:51:54,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:54,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:54,589 INFO L225 Difference]: With dead ends: 6096 [2020-01-16 17:51:54,589 INFO L226 Difference]: Without dead ends: 6063 [2020-01-16 17:51:54,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-01-16 17:51:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3133. [2020-01-16 17:51:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:51:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15605 transitions. [2020-01-16 17:51:54,815 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15605 transitions. Word has length 31 [2020-01-16 17:51:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:54,815 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15605 transitions. [2020-01-16 17:51:54,815 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15605 transitions. [2020-01-16 17:51:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:54,821 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51: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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:54,821 INFO L426 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:54,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:54,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1810487580, now seen corresponding path program 143 times [2020-01-16 17:51:54,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:54,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30637428] [2020-01-16 17:51:54,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:55,370 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-01-16 17:51:55,503 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:51:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:55,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30637428] [2020-01-16 17:51:55,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:55,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:55,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926161806] [2020-01-16 17:51:55,513 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:55,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:55,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:55,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:55,513 INFO L87 Difference]: Start difference. First operand 3133 states and 15605 transitions. Second operand 12 states. [2020-01-16 17:51:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:55,864 INFO L93 Difference]: Finished difference Result 6087 states and 27002 transitions. [2020-01-16 17:51:55,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:55,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:55,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:55,879 INFO L225 Difference]: With dead ends: 6087 [2020-01-16 17:51:55,880 INFO L226 Difference]: Without dead ends: 6069 [2020-01-16 17:51:55,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2020-01-16 17:51:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 3141. [2020-01-16 17:51:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-01-16 17:51:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15620 transitions. [2020-01-16 17:51:56,106 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15620 transitions. Word has length 31 [2020-01-16 17:51:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:56,106 INFO L478 AbstractCegarLoop]: Abstraction has 3141 states and 15620 transitions. [2020-01-16 17:51:56,106 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15620 transitions. [2020-01-16 17:51:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:56,111 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:56,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:56,112 INFO L426 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1217022538, now seen corresponding path program 144 times [2020-01-16 17:51:56,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:56,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086609505] [2020-01-16 17:51:56,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:56,673 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-01-16 17:51:56,803 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:51:56,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-01-16 17:51:56,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086609505] [2020-01-16 17:51:56,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:56,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:56,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822551301] [2020-01-16 17:51:56,813 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:56,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:56,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:56,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:56,813 INFO L87 Difference]: Start difference. First operand 3141 states and 15620 transitions. Second operand 12 states. [2020-01-16 17:51:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:56,993 INFO L93 Difference]: Finished difference Result 6091 states and 27002 transitions. [2020-01-16 17:51:56,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:56,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:57,008 INFO L225 Difference]: With dead ends: 6091 [2020-01-16 17:51:57,008 INFO L226 Difference]: Without dead ends: 6041 [2020-01-16 17:51:57,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2020-01-16 17:51:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3113. [2020-01-16 17:51:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-01-16 17:51:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15561 transitions. [2020-01-16 17:51:57,235 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15561 transitions. Word has length 31 [2020-01-16 17:51:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:57,235 INFO L478 AbstractCegarLoop]: Abstraction has 3113 states and 15561 transitions. [2020-01-16 17:51:57,235 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15561 transitions. [2020-01-16 17:51:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:57,241 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:57,241 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:57,241 INFO L426 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:57,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1443947760, now seen corresponding path program 145 times [2020-01-16 17:51:57,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:57,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805441802] [2020-01-16 17:51:57,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:57,903 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:51:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:57,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805441802] [2020-01-16 17:51:57,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:57,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:57,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118504607] [2020-01-16 17:51:57,914 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:57,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:57,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:57,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:57,914 INFO L87 Difference]: Start difference. First operand 3113 states and 15561 transitions. Second operand 12 states. [2020-01-16 17:51:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:58,128 INFO L93 Difference]: Finished difference Result 6025 states and 26870 transitions. [2020-01-16 17:51:58,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:58,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:58,144 INFO L225 Difference]: With dead ends: 6025 [2020-01-16 17:51:58,144 INFO L226 Difference]: Without dead ends: 6006 [2020-01-16 17:51:58,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-01-16 17:51:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3128. [2020-01-16 17:51:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:51:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15613 transitions. [2020-01-16 17:51:58,414 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15613 transitions. Word has length 31 [2020-01-16 17:51:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:58,414 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15613 transitions. [2020-01-16 17:51:58,414 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15613 transitions. [2020-01-16 17:51:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:58,419 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:58,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:58,419 INFO L426 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:58,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1021462034, now seen corresponding path program 146 times [2020-01-16 17:51:58,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:58,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927931456] [2020-01-16 17:51:58,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:51:58,951 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-01-16 17:51:59,084 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:51:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:51:59,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927931456] [2020-01-16 17:51:59,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:51:59,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:51:59,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001929535] [2020-01-16 17:51:59,094 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:51:59,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:51:59,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:51:59,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:51:59,094 INFO L87 Difference]: Start difference. First operand 3128 states and 15613 transitions. Second operand 12 states. [2020-01-16 17:51:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:51:59,323 INFO L93 Difference]: Finished difference Result 6022 states and 26859 transitions. [2020-01-16 17:51:59,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:51:59,323 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:51:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:51:59,339 INFO L225 Difference]: With dead ends: 6022 [2020-01-16 17:51:59,339 INFO L226 Difference]: Without dead ends: 6001 [2020-01-16 17:51:59,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:51:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-01-16 17:51:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3123. [2020-01-16 17:51:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:51:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15599 transitions. [2020-01-16 17:51:59,561 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15599 transitions. Word has length 31 [2020-01-16 17:51:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:51:59,561 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15599 transitions. [2020-01-16 17:51:59,561 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:51:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15599 transitions. [2020-01-16 17:51:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:51:59,566 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:51:59,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:51:59,566 INFO L426 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:51:59,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:51:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1019636524, now seen corresponding path program 147 times [2020-01-16 17:51:59,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:51:59,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979495472] [2020-01-16 17:51:59,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:51:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:00,101 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:00,226 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:52:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:00,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979495472] [2020-01-16 17:52:00,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:00,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:00,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535343156] [2020-01-16 17:52:00,236 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:00,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:00,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:00,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:00,237 INFO L87 Difference]: Start difference. First operand 3123 states and 15599 transitions. Second operand 12 states. [2020-01-16 17:52:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:00,459 INFO L93 Difference]: Finished difference Result 6032 states and 26882 transitions. [2020-01-16 17:52:00,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:00,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:00,475 INFO L225 Difference]: With dead ends: 6032 [2020-01-16 17:52:00,475 INFO L226 Difference]: Without dead ends: 6013 [2020-01-16 17:52:00,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-01-16 17:52:00,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3131. [2020-01-16 17:52:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:52:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15614 transitions. [2020-01-16 17:52:00,702 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15614 transitions. Word has length 31 [2020-01-16 17:52:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:00,702 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15614 transitions. [2020-01-16 17:52:00,702 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15614 transitions. [2020-01-16 17:52:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:00,708 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:00,708 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:00,708 INFO L426 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:00,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:00,708 INFO L82 PathProgramCache]: Analyzing trace with hash -247820654, now seen corresponding path program 148 times [2020-01-16 17:52:00,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:00,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408877581] [2020-01-16 17:52:00,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:01,249 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:01,381 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:01,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408877581] [2020-01-16 17:52:01,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:01,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:01,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386626086] [2020-01-16 17:52:01,392 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:01,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:01,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:01,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:01,392 INFO L87 Difference]: Start difference. First operand 3131 states and 15614 transitions. Second operand 12 states. [2020-01-16 17:52:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:01,616 INFO L93 Difference]: Finished difference Result 6033 states and 26876 transitions. [2020-01-16 17:52:01,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:01,616 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:01,631 INFO L225 Difference]: With dead ends: 6033 [2020-01-16 17:52:01,631 INFO L226 Difference]: Without dead ends: 6005 [2020-01-16 17:52:01,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-01-16 17:52:01,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3123. [2020-01-16 17:52:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:52:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15594 transitions. [2020-01-16 17:52:01,854 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15594 transitions. Word has length 31 [2020-01-16 17:52:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:01,855 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15594 transitions. [2020-01-16 17:52:01,855 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15594 transitions. [2020-01-16 17:52:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:01,861 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:01,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:01,861 INFO L426 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:01,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash 384995180, now seen corresponding path program 149 times [2020-01-16 17:52:01,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:01,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262483194] [2020-01-16 17:52:01,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:02,401 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:52:02,532 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:02,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262483194] [2020-01-16 17:52:02,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:02,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:02,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30126698] [2020-01-16 17:52:02,542 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:02,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:02,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:02,543 INFO L87 Difference]: Start difference. First operand 3123 states and 15594 transitions. Second operand 12 states. [2020-01-16 17:52:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:02,838 INFO L93 Difference]: Finished difference Result 6023 states and 26856 transitions. [2020-01-16 17:52:02,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:02,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:02,854 INFO L225 Difference]: With dead ends: 6023 [2020-01-16 17:52:02,854 INFO L226 Difference]: Without dead ends: 6007 [2020-01-16 17:52:02,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-01-16 17:52:03,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3128. [2020-01-16 17:52:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:52:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15603 transitions. [2020-01-16 17:52:03,081 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15603 transitions. Word has length 31 [2020-01-16 17:52:03,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:03,081 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15603 transitions. [2020-01-16 17:52:03,081 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:03,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15603 transitions. [2020-01-16 17:52:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:03,086 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:03,086 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:03,087 INFO L426 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:03,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:03,087 INFO L82 PathProgramCache]: Analyzing trace with hash -459976272, now seen corresponding path program 150 times [2020-01-16 17:52:03,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:03,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907564105] [2020-01-16 17:52:03,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:03,614 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:03,746 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:03,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907564105] [2020-01-16 17:52:03,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:03,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:03,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499482398] [2020-01-16 17:52:03,756 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:03,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:03,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:03,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:03,756 INFO L87 Difference]: Start difference. First operand 3128 states and 15603 transitions. Second operand 12 states. [2020-01-16 17:52:03,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:03,982 INFO L93 Difference]: Finished difference Result 6027 states and 26859 transitions. [2020-01-16 17:52:03,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:03,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:03,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:03,997 INFO L225 Difference]: With dead ends: 6027 [2020-01-16 17:52:03,998 INFO L226 Difference]: Without dead ends: 5997 [2020-01-16 17:52:03,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-01-16 17:52:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3118. [2020-01-16 17:52:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-01-16 17:52:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15580 transitions. [2020-01-16 17:52:04,220 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15580 transitions. Word has length 31 [2020-01-16 17:52:04,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:04,220 INFO L478 AbstractCegarLoop]: Abstraction has 3118 states and 15580 transitions. [2020-01-16 17:52:04,220 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15580 transitions. [2020-01-16 17:52:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:04,225 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:04,225 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:04,226 INFO L426 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:04,226 INFO L82 PathProgramCache]: Analyzing trace with hash 906454904, now seen corresponding path program 151 times [2020-01-16 17:52:04,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:04,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607603369] [2020-01-16 17:52:04,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:04,762 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:04,896 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:52:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:04,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607603369] [2020-01-16 17:52:04,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:04,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:04,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888867466] [2020-01-16 17:52:04,907 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:04,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:04,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:04,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:04,912 INFO L87 Difference]: Start difference. First operand 3118 states and 15580 transitions. Second operand 12 states. [2020-01-16 17:52:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:05,164 INFO L93 Difference]: Finished difference Result 6022 states and 26858 transitions. [2020-01-16 17:52:05,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:05,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:05,179 INFO L225 Difference]: With dead ends: 6022 [2020-01-16 17:52:05,179 INFO L226 Difference]: Without dead ends: 6003 [2020-01-16 17:52:05,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-01-16 17:52:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3128. [2020-01-16 17:52:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:52:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15608 transitions. [2020-01-16 17:52:05,401 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15608 transitions. Word has length 31 [2020-01-16 17:52:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:05,402 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15608 transitions. [2020-01-16 17:52:05,402 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15608 transitions. [2020-01-16 17:52:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:05,407 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:05,407 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:05,407 INFO L426 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:05,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:05,408 INFO L82 PathProgramCache]: Analyzing trace with hash 483969178, now seen corresponding path program 152 times [2020-01-16 17:52:05,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:05,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630113065] [2020-01-16 17:52:05,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:05,761 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2020-01-16 17:52:06,117 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:52:06,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-01-16 17:52:06,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630113065] [2020-01-16 17:52:06,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:06,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:06,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707756538] [2020-01-16 17:52:06,127 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:06,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:06,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:06,128 INFO L87 Difference]: Start difference. First operand 3128 states and 15608 transitions. Second operand 12 states. [2020-01-16 17:52:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:06,401 INFO L93 Difference]: Finished difference Result 6019 states and 26847 transitions. [2020-01-16 17:52:06,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:06,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:06,415 INFO L225 Difference]: With dead ends: 6019 [2020-01-16 17:52:06,415 INFO L226 Difference]: Without dead ends: 5998 [2020-01-16 17:52:06,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-01-16 17:52:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3123. [2020-01-16 17:52:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:52:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15594 transitions. [2020-01-16 17:52:06,637 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15594 transitions. Word has length 31 [2020-01-16 17:52:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:06,637 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15594 transitions. [2020-01-16 17:52:06,638 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15594 transitions. [2020-01-16 17:52:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:06,643 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:06,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:06,643 INFO L426 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:06,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:06,643 INFO L82 PathProgramCache]: Analyzing trace with hash -366478804, now seen corresponding path program 153 times [2020-01-16 17:52:06,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:06,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491921351] [2020-01-16 17:52:06,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:07,317 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:52:07,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-01-16 17:52:07,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491921351] [2020-01-16 17:52:07,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:07,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:07,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772245078] [2020-01-16 17:52:07,327 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:07,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:07,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:07,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:07,327 INFO L87 Difference]: Start difference. First operand 3123 states and 15594 transitions. Second operand 12 states. [2020-01-16 17:52:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:07,555 INFO L93 Difference]: Finished difference Result 6026 states and 26863 transitions. [2020-01-16 17:52:07,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:07,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:07,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:07,571 INFO L225 Difference]: With dead ends: 6026 [2020-01-16 17:52:07,571 INFO L226 Difference]: Without dead ends: 6007 [2020-01-16 17:52:07,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:07,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-01-16 17:52:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3130. [2020-01-16 17:52:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:52:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15607 transitions. [2020-01-16 17:52:07,799 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15607 transitions. Word has length 31 [2020-01-16 17:52:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:07,800 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15607 transitions. [2020-01-16 17:52:07,800 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15607 transitions. [2020-01-16 17:52:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:07,805 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52: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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:07,805 INFO L426 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:07,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash 971088410, now seen corresponding path program 154 times [2020-01-16 17:52:07,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:07,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590883388] [2020-01-16 17:52:07,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:08,466 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:08,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590883388] [2020-01-16 17:52:08,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:08,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:08,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475776435] [2020-01-16 17:52:08,476 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:08,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:08,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:08,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:08,477 INFO L87 Difference]: Start difference. First operand 3130 states and 15607 transitions. Second operand 12 states. [2020-01-16 17:52:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:08,748 INFO L93 Difference]: Finished difference Result 6025 states and 26854 transitions. [2020-01-16 17:52:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:08,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:08,764 INFO L225 Difference]: With dead ends: 6025 [2020-01-16 17:52:08,764 INFO L226 Difference]: Without dead ends: 6000 [2020-01-16 17:52:08,764 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-01-16 17:52:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3123. [2020-01-16 17:52:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:52:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15589 transitions. [2020-01-16 17:52:08,985 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15589 transitions. Word has length 31 [2020-01-16 17:52:08,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:08,986 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15589 transitions. [2020-01-16 17:52:08,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15589 transitions. [2020-01-16 17:52:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:08,991 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:08,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:08,991 INFO L426 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:08,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:08,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1001120148, now seen corresponding path program 155 times [2020-01-16 17:52:08,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:08,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114913167] [2020-01-16 17:52:08,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:09,523 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:52:09,658 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:09,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114913167] [2020-01-16 17:52:09,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:09,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:09,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002609817] [2020-01-16 17:52:09,668 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:09,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:09,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:09,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:09,668 INFO L87 Difference]: Start difference. First operand 3123 states and 15589 transitions. Second operand 12 states. [2020-01-16 17:52:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:09,937 INFO L93 Difference]: Finished difference Result 6018 states and 26840 transitions. [2020-01-16 17:52:09,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:09,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:09,953 INFO L225 Difference]: With dead ends: 6018 [2020-01-16 17:52:09,953 INFO L226 Difference]: Without dead ends: 6002 [2020-01-16 17:52:09,953 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-01-16 17:52:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3128. [2020-01-16 17:52:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:52:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15598 transitions. [2020-01-16 17:52:10,180 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15598 transitions. Word has length 31 [2020-01-16 17:52:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:10,180 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15598 transitions. [2020-01-16 17:52:10,180 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15598 transitions. [2020-01-16 17:52:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:10,186 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:10,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:10,186 INFO L426 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:10,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:10,187 INFO L82 PathProgramCache]: Analyzing trace with hash 758932792, now seen corresponding path program 156 times [2020-01-16 17:52:10,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:10,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279942358] [2020-01-16 17:52:10,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:10,718 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:52:10,852 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:10,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279942358] [2020-01-16 17:52:10,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:10,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:10,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602154554] [2020-01-16 17:52:10,863 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:10,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:10,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:10,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:10,863 INFO L87 Difference]: Start difference. First operand 3128 states and 15598 transitions. Second operand 12 states. [2020-01-16 17:52:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:11,154 INFO L93 Difference]: Finished difference Result 6020 states and 26839 transitions. [2020-01-16 17:52:11,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:11,155 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:11,170 INFO L225 Difference]: With dead ends: 6020 [2020-01-16 17:52:11,170 INFO L226 Difference]: Without dead ends: 5992 [2020-01-16 17:52:11,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-01-16 17:52:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3118. [2020-01-16 17:52:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-01-16 17:52:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15575 transitions. [2020-01-16 17:52:11,391 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15575 transitions. Word has length 31 [2020-01-16 17:52:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:11,391 INFO L478 AbstractCegarLoop]: Abstraction has 3118 states and 15575 transitions. [2020-01-16 17:52:11,391 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15575 transitions. [2020-01-16 17:52:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:11,396 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:11,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:11,396 INFO L426 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:11,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:11,397 INFO L82 PathProgramCache]: Analyzing trace with hash 213397240, now seen corresponding path program 157 times [2020-01-16 17:52:11,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:11,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37972823] [2020-01-16 17:52:11,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:11,949 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:12,075 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:52:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:12,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37972823] [2020-01-16 17:52:12,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:12,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:12,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414108413] [2020-01-16 17:52:12,085 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:12,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:12,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:12,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:12,085 INFO L87 Difference]: Start difference. First operand 3118 states and 15575 transitions. Second operand 12 states. [2020-01-16 17:52:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:12,313 INFO L93 Difference]: Finished difference Result 6040 states and 26901 transitions. [2020-01-16 17:52:12,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:12,313 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:12,328 INFO L225 Difference]: With dead ends: 6040 [2020-01-16 17:52:12,328 INFO L226 Difference]: Without dead ends: 6021 [2020-01-16 17:52:12,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2020-01-16 17:52:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 3133. [2020-01-16 17:52:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:52:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15617 transitions. [2020-01-16 17:52:12,550 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15617 transitions. Word has length 31 [2020-01-16 17:52:12,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:12,551 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15617 transitions. [2020-01-16 17:52:12,551 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15617 transitions. [2020-01-16 17:52:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:12,556 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52: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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:12,556 INFO L426 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:12,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:12,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1054059938, now seen corresponding path program 158 times [2020-01-16 17:52:12,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:12,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895154782] [2020-01-16 17:52:12,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:13,100 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:13,274 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:13,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895154782] [2020-01-16 17:52:13,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:13,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:13,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808992509] [2020-01-16 17:52:13,284 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:13,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:13,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:13,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:13,285 INFO L87 Difference]: Start difference. First operand 3133 states and 15617 transitions. Second operand 12 states. [2020-01-16 17:52:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:13,512 INFO L93 Difference]: Finished difference Result 6041 states and 26895 transitions. [2020-01-16 17:52:13,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:13,513 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:13,528 INFO L225 Difference]: With dead ends: 6041 [2020-01-16 17:52:13,528 INFO L226 Difference]: Without dead ends: 6013 [2020-01-16 17:52:13,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:13,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-01-16 17:52:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3125. [2020-01-16 17:52:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:52:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15595 transitions. [2020-01-16 17:52:13,755 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15595 transitions. Word has length 31 [2020-01-16 17:52:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:13,755 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15595 transitions. [2020-01-16 17:52:13,755 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:13,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15595 transitions. [2020-01-16 17:52:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:13,760 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:13,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:13,760 INFO L426 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash -635225232, now seen corresponding path program 159 times [2020-01-16 17:52:13,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:13,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387232743] [2020-01-16 17:52:13,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:14,300 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:14,425 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:52:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:14,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387232743] [2020-01-16 17:52:14,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:14,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:14,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197019901] [2020-01-16 17:52:14,435 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:14,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:14,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:14,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:14,435 INFO L87 Difference]: Start difference. First operand 3125 states and 15595 transitions. Second operand 12 states. [2020-01-16 17:52:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:14,660 INFO L93 Difference]: Finished difference Result 6037 states and 26887 transitions. [2020-01-16 17:52:14,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:14,661 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:14,676 INFO L225 Difference]: With dead ends: 6037 [2020-01-16 17:52:14,676 INFO L226 Difference]: Without dead ends: 6018 [2020-01-16 17:52:14,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-01-16 17:52:14,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3132. [2020-01-16 17:52:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:52:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15608 transitions. [2020-01-16 17:52:14,903 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15608 transitions. Word has length 31 [2020-01-16 17:52:14,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:14,903 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15608 transitions. [2020-01-16 17:52:14,903 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15608 transitions. [2020-01-16 17:52:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:14,909 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:14,909 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:14,909 INFO L426 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:14,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:14,909 INFO L82 PathProgramCache]: Analyzing trace with hash 702341982, now seen corresponding path program 160 times [2020-01-16 17:52:14,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:14,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256105104] [2020-01-16 17:52:14,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:15,578 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:15,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256105104] [2020-01-16 17:52:15,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:15,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:15,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715966340] [2020-01-16 17:52:15,588 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:15,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:15,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:15,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:15,588 INFO L87 Difference]: Start difference. First operand 3132 states and 15608 transitions. Second operand 12 states. [2020-01-16 17:52:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:15,826 INFO L93 Difference]: Finished difference Result 6036 states and 26878 transitions. [2020-01-16 17:52:15,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:15,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:15,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:15,842 INFO L225 Difference]: With dead ends: 6036 [2020-01-16 17:52:15,842 INFO L226 Difference]: Without dead ends: 6011 [2020-01-16 17:52:15,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-01-16 17:52:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3125. [2020-01-16 17:52:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:52:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15588 transitions. [2020-01-16 17:52:16,069 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15588 transitions. Word has length 31 [2020-01-16 17:52:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:16,069 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15588 transitions. [2020-01-16 17:52:16,069 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15588 transitions. [2020-01-16 17:52:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:16,074 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:16,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:16,075 INFO L426 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:16,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:16,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1755818032, now seen corresponding path program 161 times [2020-01-16 17:52:16,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:16,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893321212] [2020-01-16 17:52:16,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:16,746 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:52:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:16,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893321212] [2020-01-16 17:52:16,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:16,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:16,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422082603] [2020-01-16 17:52:16,756 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:16,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:16,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:16,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:16,759 INFO L87 Difference]: Start difference. First operand 3125 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:52:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:17,025 INFO L93 Difference]: Finished difference Result 6039 states and 26884 transitions. [2020-01-16 17:52:17,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:17,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:17,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:17,040 INFO L225 Difference]: With dead ends: 6039 [2020-01-16 17:52:17,040 INFO L226 Difference]: Without dead ends: 6019 [2020-01-16 17:52:17,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6019 states. [2020-01-16 17:52:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6019 to 3132. [2020-01-16 17:52:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:52:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15601 transitions. [2020-01-16 17:52:17,271 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15601 transitions. Word has length 31 [2020-01-16 17:52:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:17,272 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15601 transitions. [2020-01-16 17:52:17,272 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15601 transitions. [2020-01-16 17:52:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:17,277 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:17,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:17,277 INFO L426 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:17,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash 65875128, now seen corresponding path program 162 times [2020-01-16 17:52:17,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:17,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336461703] [2020-01-16 17:52:17,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:17,819 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:52:17,946 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:52:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:17,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336461703] [2020-01-16 17:52:17,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:17,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:17,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122647417] [2020-01-16 17:52:17,956 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:17,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:17,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:17,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:17,957 INFO L87 Difference]: Start difference. First operand 3132 states and 15601 transitions. Second operand 12 states. [2020-01-16 17:52:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:18,312 INFO L93 Difference]: Finished difference Result 6037 states and 26873 transitions. [2020-01-16 17:52:18,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:18,313 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:18,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:18,328 INFO L225 Difference]: With dead ends: 6037 [2020-01-16 17:52:18,328 INFO L226 Difference]: Without dead ends: 6005 [2020-01-16 17:52:18,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-01-16 17:52:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3118. [2020-01-16 17:52:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-01-16 17:52:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15570 transitions. [2020-01-16 17:52:18,550 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15570 transitions. Word has length 31 [2020-01-16 17:52:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:18,551 INFO L478 AbstractCegarLoop]: Abstraction has 3118 states and 15570 transitions. [2020-01-16 17:52:18,551 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15570 transitions. [2020-01-16 17:52:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:18,556 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:18,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:18,556 INFO L426 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:18,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:18,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1591866330, now seen corresponding path program 163 times [2020-01-16 17:52:18,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:18,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434479616] [2020-01-16 17:52:18,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:19,204 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:52:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:19,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434479616] [2020-01-16 17:52:19,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:19,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:19,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272605674] [2020-01-16 17:52:19,214 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:19,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:19,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:19,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:19,214 INFO L87 Difference]: Start difference. First operand 3118 states and 15570 transitions. Second operand 12 states. [2020-01-16 17:52:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:19,550 INFO L93 Difference]: Finished difference Result 6021 states and 26846 transitions. [2020-01-16 17:52:19,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:19,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:19,568 INFO L225 Difference]: With dead ends: 6021 [2020-01-16 17:52:19,568 INFO L226 Difference]: Without dead ends: 6005 [2020-01-16 17:52:19,568 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-01-16 17:52:19,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3128. [2020-01-16 17:52:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:52:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15598 transitions. [2020-01-16 17:52:19,794 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15598 transitions. Word has length 31 [2020-01-16 17:52:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:19,794 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15598 transitions. [2020-01-16 17:52:19,794 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15598 transitions. [2020-01-16 17:52:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:19,799 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:19,799 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:19,800 INFO L426 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:19,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:19,800 INFO L82 PathProgramCache]: Analyzing trace with hash 746894878, now seen corresponding path program 164 times [2020-01-16 17:52:19,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:19,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419051752] [2020-01-16 17:52:19,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:20,310 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:52:20,438 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:52:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:20,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419051752] [2020-01-16 17:52:20,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:20,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:20,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264532657] [2020-01-16 17:52:20,448 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:20,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:20,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:20,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:20,449 INFO L87 Difference]: Start difference. First operand 3128 states and 15598 transitions. Second operand 12 states. [2020-01-16 17:52:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:20,734 INFO L93 Difference]: Finished difference Result 6025 states and 26849 transitions. [2020-01-16 17:52:20,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:20,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:20,749 INFO L225 Difference]: With dead ends: 6025 [2020-01-16 17:52:20,750 INFO L226 Difference]: Without dead ends: 6000 [2020-01-16 17:52:20,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:20,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-01-16 17:52:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3123. [2020-01-16 17:52:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:52:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15584 transitions. [2020-01-16 17:52:21,010 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15584 transitions. Word has length 31 [2020-01-16 17:52:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:21,010 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15584 transitions. [2020-01-16 17:52:21,011 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15584 transitions. [2020-01-16 17:52:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:21,016 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:21,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:21,016 INFO L426 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:21,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:21,016 INFO L82 PathProgramCache]: Analyzing trace with hash 743243858, now seen corresponding path program 165 times [2020-01-16 17:52:21,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:21,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240456088] [2020-01-16 17:52:21,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:21,537 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:21,670 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:52:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:21,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240456088] [2020-01-16 17:52:21,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:21,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:21,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126286812] [2020-01-16 17:52:21,680 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:21,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:21,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:21,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:21,681 INFO L87 Difference]: Start difference. First operand 3123 states and 15584 transitions. Second operand 12 states. [2020-01-16 17:52:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:21,933 INFO L93 Difference]: Finished difference Result 6019 states and 26837 transitions. [2020-01-16 17:52:21,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:21,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:21,948 INFO L225 Difference]: With dead ends: 6019 [2020-01-16 17:52:21,948 INFO L226 Difference]: Without dead ends: 6003 [2020-01-16 17:52:21,948 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-01-16 17:52:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3128. [2020-01-16 17:52:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:52:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15593 transitions. [2020-01-16 17:52:22,171 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15593 transitions. Word has length 31 [2020-01-16 17:52:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:22,171 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15593 transitions. [2020-01-16 17:52:22,172 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15593 transitions. [2020-01-16 17:52:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:22,177 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:22,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:22,177 INFO L426 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:22,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:22,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1791670498, now seen corresponding path program 166 times [2020-01-16 17:52:22,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:22,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323158467] [2020-01-16 17:52:22,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:22,827 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:52:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:22,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323158467] [2020-01-16 17:52:22,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:22,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:22,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267788960] [2020-01-16 17:52:22,836 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:22,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:22,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:22,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:22,837 INFO L87 Difference]: Start difference. First operand 3128 states and 15593 transitions. Second operand 12 states. [2020-01-16 17:52:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:23,067 INFO L93 Difference]: Finished difference Result 6021 states and 26836 transitions. [2020-01-16 17:52:23,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:23,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:23,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:23,082 INFO L225 Difference]: With dead ends: 6021 [2020-01-16 17:52:23,083 INFO L226 Difference]: Without dead ends: 5998 [2020-01-16 17:52:23,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-01-16 17:52:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3123. [2020-01-16 17:52:23,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:52:23,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15579 transitions. [2020-01-16 17:52:23,309 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15579 transitions. Word has length 31 [2020-01-16 17:52:23,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:23,310 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15579 transitions. [2020-01-16 17:52:23,310 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15579 transitions. [2020-01-16 17:52:23,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:23,315 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:23,315 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:23,315 INFO L426 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:23,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash -526038830, now seen corresponding path program 167 times [2020-01-16 17:52:23,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:23,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962841949] [2020-01-16 17:52:23,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:23,831 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:52:23,961 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:52:23,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-01-16 17:52:23,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962841949] [2020-01-16 17:52:23,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:23,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:23,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22175449] [2020-01-16 17:52:23,970 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:23,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:23,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:23,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:23,970 INFO L87 Difference]: Start difference. First operand 3123 states and 15579 transitions. Second operand 12 states. [2020-01-16 17:52:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:24,198 INFO L93 Difference]: Finished difference Result 6029 states and 26854 transitions. [2020-01-16 17:52:24,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:24,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:24,214 INFO L225 Difference]: With dead ends: 6029 [2020-01-16 17:52:24,214 INFO L226 Difference]: Without dead ends: 6009 [2020-01-16 17:52:24,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2020-01-16 17:52:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 3130. [2020-01-16 17:52:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:52:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15592 transitions. [2020-01-16 17:52:24,444 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15592 transitions. Word has length 31 [2020-01-16 17:52:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:24,444 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15592 transitions. [2020-01-16 17:52:24,444 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15592 transitions. [2020-01-16 17:52:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:24,450 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:24,450 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:24,450 INFO L426 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:24,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2078985562, now seen corresponding path program 168 times [2020-01-16 17:52:24,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:24,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966508607] [2020-01-16 17:52:24,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:24,968 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:52:25,101 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:52:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:25,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966508607] [2020-01-16 17:52:25,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:25,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:25,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864411914] [2020-01-16 17:52:25,111 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:25,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:25,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:25,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:25,112 INFO L87 Difference]: Start difference. First operand 3130 states and 15592 transitions. Second operand 12 states. [2020-01-16 17:52:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:25,342 INFO L93 Difference]: Finished difference Result 6027 states and 26843 transitions. [2020-01-16 17:52:25,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:25,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:25,358 INFO L225 Difference]: With dead ends: 6027 [2020-01-16 17:52:25,358 INFO L226 Difference]: Without dead ends: 5992 [2020-01-16 17:52:25,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-01-16 17:52:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3113. [2020-01-16 17:52:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-01-16 17:52:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15556 transitions. [2020-01-16 17:52:25,578 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15556 transitions. Word has length 31 [2020-01-16 17:52:25,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:25,578 INFO L478 AbstractCegarLoop]: Abstraction has 3113 states and 15556 transitions. [2020-01-16 17:52:25,578 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15556 transitions. [2020-01-16 17:52:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:25,583 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:25,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:25,584 INFO L426 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:25,584 INFO L82 PathProgramCache]: Analyzing trace with hash -315342902, now seen corresponding path program 169 times [2020-01-16 17:52:25,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:25,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463015410] [2020-01-16 17:52:25,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:26,140 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:26,277 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:52:26,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-01-16 17:52:26,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463015410] [2020-01-16 17:52:26,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:26,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:26,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721432814] [2020-01-16 17:52:26,287 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:26,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:26,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:26,288 INFO L87 Difference]: Start difference. First operand 3113 states and 15556 transitions. Second operand 12 states. [2020-01-16 17:52:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:26,537 INFO L93 Difference]: Finished difference Result 6046 states and 26915 transitions. [2020-01-16 17:52:26,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:26,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:26,552 INFO L225 Difference]: With dead ends: 6046 [2020-01-16 17:52:26,552 INFO L226 Difference]: Without dead ends: 6027 [2020-01-16 17:52:26,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-01-16 17:52:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3131. [2020-01-16 17:52:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:52:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15617 transitions. [2020-01-16 17:52:26,775 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15617 transitions. Word has length 31 [2020-01-16 17:52:26,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:26,776 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15617 transitions. [2020-01-16 17:52:26,776 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15617 transitions. [2020-01-16 17:52:26,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:26,781 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:26,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:26,781 INFO L426 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:26,781 INFO L82 PathProgramCache]: Analyzing trace with hash -737828628, now seen corresponding path program 170 times [2020-01-16 17:52:26,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:26,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222081706] [2020-01-16 17:52:26,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:27,327 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-01-16 17:52:27,462 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:52:27,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-01-16 17:52:27,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222081706] [2020-01-16 17:52:27,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:27,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:27,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117382468] [2020-01-16 17:52:27,472 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:27,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:27,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:27,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:27,473 INFO L87 Difference]: Start difference. First operand 3131 states and 15617 transitions. Second operand 12 states. [2020-01-16 17:52:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:27,727 INFO L93 Difference]: Finished difference Result 6043 states and 26904 transitions. [2020-01-16 17:52:27,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:27,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:27,742 INFO L225 Difference]: With dead ends: 6043 [2020-01-16 17:52:27,742 INFO L226 Difference]: Without dead ends: 6022 [2020-01-16 17:52:27,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-01-16 17:52:27,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3126. [2020-01-16 17:52:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:52:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15603 transitions. [2020-01-16 17:52:27,967 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15603 transitions. Word has length 31 [2020-01-16 17:52:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:27,967 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15603 transitions. [2020-01-16 17:52:27,967 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15603 transitions. [2020-01-16 17:52:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:27,973 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:27,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:27,973 INFO L426 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:27,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:27,974 INFO L82 PathProgramCache]: Analyzing trace with hash -739654138, now seen corresponding path program 171 times [2020-01-16 17:52:27,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:27,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414375909] [2020-01-16 17:52:27,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:28,566 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:28,696 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:52:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:28,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414375909] [2020-01-16 17:52:28,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:28,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:28,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015954705] [2020-01-16 17:52:28,706 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:28,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:28,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:28,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:28,706 INFO L87 Difference]: Start difference. First operand 3126 states and 15603 transitions. Second operand 12 states. [2020-01-16 17:52:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:28,959 INFO L93 Difference]: Finished difference Result 6053 states and 26927 transitions. [2020-01-16 17:52:28,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:28,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:28,975 INFO L225 Difference]: With dead ends: 6053 [2020-01-16 17:52:28,975 INFO L226 Difference]: Without dead ends: 6034 [2020-01-16 17:52:28,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-01-16 17:52:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3134. [2020-01-16 17:52:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:52:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15618 transitions. [2020-01-16 17:52:29,205 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15618 transitions. Word has length 31 [2020-01-16 17:52:29,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:29,205 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15618 transitions. [2020-01-16 17:52:29,205 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15618 transitions. [2020-01-16 17:52:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:29,210 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:29,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:29,210 INFO L426 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:29,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2007111316, now seen corresponding path program 172 times [2020-01-16 17:52:29,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:29,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374116401] [2020-01-16 17:52:29,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:29,763 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:29,895 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:29,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374116401] [2020-01-16 17:52:29,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:29,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:29,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902888277] [2020-01-16 17:52:29,905 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:29,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:29,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:29,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:29,905 INFO L87 Difference]: Start difference. First operand 3134 states and 15618 transitions. Second operand 12 states. [2020-01-16 17:52:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:30,154 INFO L93 Difference]: Finished difference Result 6054 states and 26921 transitions. [2020-01-16 17:52:30,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:30,155 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:30,169 INFO L225 Difference]: With dead ends: 6054 [2020-01-16 17:52:30,170 INFO L226 Difference]: Without dead ends: 6026 [2020-01-16 17:52:30,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-01-16 17:52:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3126. [2020-01-16 17:52:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:52:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15598 transitions. [2020-01-16 17:52:30,392 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15598 transitions. Word has length 31 [2020-01-16 17:52:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:30,392 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15598 transitions. [2020-01-16 17:52:30,392 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15598 transitions. [2020-01-16 17:52:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:30,397 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:30,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:30,397 INFO L426 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:30,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:30,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1374295482, now seen corresponding path program 173 times [2020-01-16 17:52:30,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:30,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137757631] [2020-01-16 17:52:30,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:30,937 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:52:31,069 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:31,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137757631] [2020-01-16 17:52:31,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:31,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:31,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311726103] [2020-01-16 17:52:31,079 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:31,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:31,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:31,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:31,080 INFO L87 Difference]: Start difference. First operand 3126 states and 15598 transitions. Second operand 12 states. [2020-01-16 17:52:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:31,310 INFO L93 Difference]: Finished difference Result 6044 states and 26901 transitions. [2020-01-16 17:52:31,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:31,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:31,325 INFO L225 Difference]: With dead ends: 6044 [2020-01-16 17:52:31,325 INFO L226 Difference]: Without dead ends: 6028 [2020-01-16 17:52:31,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-01-16 17:52:31,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3131. [2020-01-16 17:52:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:52:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15607 transitions. [2020-01-16 17:52:31,554 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15607 transitions. Word has length 31 [2020-01-16 17:52:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:31,554 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15607 transitions. [2020-01-16 17:52:31,554 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15607 transitions. [2020-01-16 17:52:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:31,559 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:31,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:31,560 INFO L426 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:31,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:31,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2075700362, now seen corresponding path program 174 times [2020-01-16 17:52:31,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:31,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494317602] [2020-01-16 17:52:31,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:32,092 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:32,223 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:32,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-01-16 17:52:32,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494317602] [2020-01-16 17:52:32,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:32,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:32,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871138743] [2020-01-16 17:52:32,233 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:32,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:32,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:32,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:32,233 INFO L87 Difference]: Start difference. First operand 3131 states and 15607 transitions. Second operand 12 states. [2020-01-16 17:52:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:32,467 INFO L93 Difference]: Finished difference Result 6048 states and 26904 transitions. [2020-01-16 17:52:32,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:32,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:32,482 INFO L225 Difference]: With dead ends: 6048 [2020-01-16 17:52:32,483 INFO L226 Difference]: Without dead ends: 6018 [2020-01-16 17:52:32,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-01-16 17:52:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3121. [2020-01-16 17:52:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:52:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15584 transitions. [2020-01-16 17:52:32,712 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15584 transitions. Word has length 31 [2020-01-16 17:52:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:32,712 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15584 transitions. [2020-01-16 17:52:32,713 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15584 transitions. [2020-01-16 17:52:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:32,718 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:32,718 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:32,718 INFO L426 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:32,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:32,718 INFO L82 PathProgramCache]: Analyzing trace with hash 891528248, now seen corresponding path program 175 times [2020-01-16 17:52:32,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:32,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43513471] [2020-01-16 17:52:32,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:33,263 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:52:33,402 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:52:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:33,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43513471] [2020-01-16 17:52:33,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:33,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:33,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005683734] [2020-01-16 17:52:33,412 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:33,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:33,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:33,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:33,412 INFO L87 Difference]: Start difference. First operand 3121 states and 15584 transitions. Second operand 12 states. [2020-01-16 17:52:33,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:33,649 INFO L93 Difference]: Finished difference Result 6051 states and 26920 transitions. [2020-01-16 17:52:33,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:33,649 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:33,664 INFO L225 Difference]: With dead ends: 6051 [2020-01-16 17:52:33,665 INFO L226 Difference]: Without dead ends: 6032 [2020-01-16 17:52:33,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-01-16 17:52:33,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3132. [2020-01-16 17:52:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:52:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15615 transitions. [2020-01-16 17:52:33,892 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15615 transitions. Word has length 31 [2020-01-16 17:52:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:33,892 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15615 transitions. [2020-01-16 17:52:33,892 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15615 transitions. [2020-01-16 17:52:33,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:33,897 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:33,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:33,897 INFO L426 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:33,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:33,898 INFO L82 PathProgramCache]: Analyzing trace with hash 469042522, now seen corresponding path program 176 times [2020-01-16 17:52:33,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:33,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262598251] [2020-01-16 17:52:33,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:34,462 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:52:34,596 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:52:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:34,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262598251] [2020-01-16 17:52:34,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:34,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:34,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211278069] [2020-01-16 17:52:34,606 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:34,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:34,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:34,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:34,606 INFO L87 Difference]: Start difference. First operand 3132 states and 15615 transitions. Second operand 12 states. [2020-01-16 17:52:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:34,879 INFO L93 Difference]: Finished difference Result 6048 states and 26909 transitions. [2020-01-16 17:52:34,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:34,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:34,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:34,894 INFO L225 Difference]: With dead ends: 6048 [2020-01-16 17:52:34,895 INFO L226 Difference]: Without dead ends: 6027 [2020-01-16 17:52:34,895 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:35,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-01-16 17:52:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3127. [2020-01-16 17:52:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:52:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15601 transitions. [2020-01-16 17:52:35,117 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15601 transitions. Word has length 31 [2020-01-16 17:52:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:35,117 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15601 transitions. [2020-01-16 17:52:35,117 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15601 transitions. [2020-01-16 17:52:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:35,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:35,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:35,122 INFO L426 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:35,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:35,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1017872314, now seen corresponding path program 177 times [2020-01-16 17:52:35,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:35,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015476939] [2020-01-16 17:52:35,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:35,655 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:52:35,786 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:52:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:35,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015476939] [2020-01-16 17:52:35,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:35,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:35,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197738331] [2020-01-16 17:52:35,842 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:35,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:35,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:35,842 INFO L87 Difference]: Start difference. First operand 3127 states and 15601 transitions. Second operand 12 states. [2020-01-16 17:52:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:36,120 INFO L93 Difference]: Finished difference Result 6061 states and 26937 transitions. [2020-01-16 17:52:36,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:36,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:36,135 INFO L225 Difference]: With dead ends: 6061 [2020-01-16 17:52:36,135 INFO L226 Difference]: Without dead ends: 6042 [2020-01-16 17:52:36,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-01-16 17:52:36,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3136. [2020-01-16 17:52:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-01-16 17:52:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15618 transitions. [2020-01-16 17:52:36,365 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15618 transitions. Word has length 31 [2020-01-16 17:52:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:36,365 INFO L478 AbstractCegarLoop]: Abstraction has 3136 states and 15618 transitions. [2020-01-16 17:52:36,365 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:36,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15618 transitions. [2020-01-16 17:52:36,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:36,370 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:36,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:36,370 INFO L426 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:36,371 INFO L82 PathProgramCache]: Analyzing trace with hash -947762278, now seen corresponding path program 178 times [2020-01-16 17:52:36,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:36,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56947953] [2020-01-16 17:52:36,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:36,937 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:52:37,068 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:52:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:37,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56947953] [2020-01-16 17:52:37,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:37,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:37,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940133387] [2020-01-16 17:52:37,077 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:37,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:37,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:37,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:37,078 INFO L87 Difference]: Start difference. First operand 3136 states and 15618 transitions. Second operand 12 states. [2020-01-16 17:52:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:37,277 INFO L93 Difference]: Finished difference Result 6064 states and 26934 transitions. [2020-01-16 17:52:37,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:37,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:37,292 INFO L225 Difference]: With dead ends: 6064 [2020-01-16 17:52:37,292 INFO L226 Difference]: Without dead ends: 6033 [2020-01-16 17:52:37,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-01-16 17:52:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3127. [2020-01-16 17:52:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:52:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15595 transitions. [2020-01-16 17:52:37,514 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15595 transitions. Word has length 31 [2020-01-16 17:52:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:37,514 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15595 transitions. [2020-01-16 17:52:37,514 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15595 transitions. [2020-01-16 17:52:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:37,519 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:37,519 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:37,520 INFO L426 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:37,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:37,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1652513658, now seen corresponding path program 179 times [2020-01-16 17:52:37,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:37,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448434346] [2020-01-16 17:52:37,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:38,058 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:52:38,187 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:52:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:38,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448434346] [2020-01-16 17:52:38,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:38,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:38,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042006160] [2020-01-16 17:52:38,197 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:38,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:38,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:38,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:38,197 INFO L87 Difference]: Start difference. First operand 3127 states and 15595 transitions. Second operand 12 states. [2020-01-16 17:52:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:38,442 INFO L93 Difference]: Finished difference Result 6052 states and 26910 transitions. [2020-01-16 17:52:38,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:38,443 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:38,457 INFO L225 Difference]: With dead ends: 6052 [2020-01-16 17:52:38,457 INFO L226 Difference]: Without dead ends: 6036 [2020-01-16 17:52:38,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-01-16 17:52:38,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3133. [2020-01-16 17:52:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:52:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15606 transitions. [2020-01-16 17:52:38,685 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15606 transitions. Word has length 31 [2020-01-16 17:52:38,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:38,685 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15606 transitions. [2020-01-16 17:52:38,685 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:38,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15606 transitions. [2020-01-16 17:52:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:38,690 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:38,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:38,690 INFO L426 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:38,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:38,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1159917896, now seen corresponding path program 180 times [2020-01-16 17:52:38,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:38,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394863210] [2020-01-16 17:52:38,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:39,225 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:52:39,356 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:52:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:39,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394863210] [2020-01-16 17:52:39,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:39,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:39,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989082937] [2020-01-16 17:52:39,366 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:39,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:39,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:39,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:39,367 INFO L87 Difference]: Start difference. First operand 3133 states and 15606 transitions. Second operand 12 states. [2020-01-16 17:52:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:39,635 INFO L93 Difference]: Finished difference Result 6058 states and 26916 transitions. [2020-01-16 17:52:39,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:39,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:39,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:39,651 INFO L225 Difference]: With dead ends: 6058 [2020-01-16 17:52:39,651 INFO L226 Difference]: Without dead ends: 6024 [2020-01-16 17:52:39,651 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-01-16 17:52:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3121. [2020-01-16 17:52:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:52:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15578 transitions. [2020-01-16 17:52:39,873 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15578 transitions. Word has length 31 [2020-01-16 17:52:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:39,873 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15578 transitions. [2020-01-16 17:52:39,873 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15578 transitions. [2020-01-16 17:52:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:39,878 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:39,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:39,878 INFO L426 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:39,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:39,879 INFO L82 PathProgramCache]: Analyzing trace with hash 198470584, now seen corresponding path program 181 times [2020-01-16 17:52:39,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:39,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602145802] [2020-01-16 17:52:39,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:40,444 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:40,573 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:52:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:40,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602145802] [2020-01-16 17:52:40,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:40,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:40,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250251652] [2020-01-16 17:52:40,582 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:40,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:40,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:40,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:40,582 INFO L87 Difference]: Start difference. First operand 3121 states and 15578 transitions. Second operand 12 states. [2020-01-16 17:52:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:40,864 INFO L93 Difference]: Finished difference Result 6075 states and 26976 transitions. [2020-01-16 17:52:40,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:40,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:40,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:40,879 INFO L225 Difference]: With dead ends: 6075 [2020-01-16 17:52:40,879 INFO L226 Difference]: Without dead ends: 6056 [2020-01-16 17:52:40,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-01-16 17:52:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3140. [2020-01-16 17:52:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-01-16 17:52:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15630 transitions. [2020-01-16 17:52:41,108 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15630 transitions. Word has length 31 [2020-01-16 17:52:41,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:41,109 INFO L478 AbstractCegarLoop]: Abstraction has 3140 states and 15630 transitions. [2020-01-16 17:52:41,109 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15630 transitions. [2020-01-16 17:52:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:41,114 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:41,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:41,115 INFO L426 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:41,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:41,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1068986594, now seen corresponding path program 182 times [2020-01-16 17:52:41,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:41,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700815196] [2020-01-16 17:52:41,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:41,665 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:41,795 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:41,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700815196] [2020-01-16 17:52:41,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:41,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:41,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499208050] [2020-01-16 17:52:41,805 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:41,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:41,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:41,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:41,806 INFO L87 Difference]: Start difference. First operand 3140 states and 15630 transitions. Second operand 12 states. [2020-01-16 17:52:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:42,125 INFO L93 Difference]: Finished difference Result 6076 states and 26970 transitions. [2020-01-16 17:52:42,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:42,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:42,141 INFO L225 Difference]: With dead ends: 6076 [2020-01-16 17:52:42,141 INFO L226 Difference]: Without dead ends: 6048 [2020-01-16 17:52:42,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-01-16 17:52:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3132. [2020-01-16 17:52:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:52:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15607 transitions. [2020-01-16 17:52:42,363 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15607 transitions. Word has length 31 [2020-01-16 17:52:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:42,363 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15607 transitions. [2020-01-16 17:52:42,364 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15607 transitions. [2020-01-16 17:52:42,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:42,369 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:42,369 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:42,369 INFO L426 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:42,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:42,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1286618742, now seen corresponding path program 183 times [2020-01-16 17:52:42,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:42,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379893793] [2020-01-16 17:52:42,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:43,065 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:52:43,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-01-16 17:52:43,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379893793] [2020-01-16 17:52:43,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:43,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:43,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192984932] [2020-01-16 17:52:43,076 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:43,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:43,076 INFO L87 Difference]: Start difference. First operand 3132 states and 15607 transitions. Second operand 12 states. [2020-01-16 17:52:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:43,435 INFO L93 Difference]: Finished difference Result 6078 states and 26973 transitions. [2020-01-16 17:52:43,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:43,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:43,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:43,450 INFO L225 Difference]: With dead ends: 6078 [2020-01-16 17:52:43,451 INFO L226 Difference]: Without dead ends: 6059 [2020-01-16 17:52:43,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-01-16 17:52:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3141. [2020-01-16 17:52:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-01-16 17:52:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15624 transitions. [2020-01-16 17:52:43,712 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15624 transitions. Word has length 31 [2020-01-16 17:52:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:43,712 INFO L478 AbstractCegarLoop]: Abstraction has 3141 states and 15624 transitions. [2020-01-16 17:52:43,712 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15624 transitions. [2020-01-16 17:52:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:43,719 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:43,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:43,719 INFO L426 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:43,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:43,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1216508706, now seen corresponding path program 184 times [2020-01-16 17:52:43,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:43,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273130098] [2020-01-16 17:52:43,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:44,283 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:52:44,408 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:52:44,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-01-16 17:52:44,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273130098] [2020-01-16 17:52:44,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:44,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:44,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065218843] [2020-01-16 17:52:44,419 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:44,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:44,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:44,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:44,419 INFO L87 Difference]: Start difference. First operand 3141 states and 15624 transitions. Second operand 12 states. [2020-01-16 17:52:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:44,731 INFO L93 Difference]: Finished difference Result 6081 states and 26970 transitions. [2020-01-16 17:52:44,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:44,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:44,747 INFO L225 Difference]: With dead ends: 6081 [2020-01-16 17:52:44,747 INFO L226 Difference]: Without dead ends: 6050 [2020-01-16 17:52:44,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-01-16 17:52:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3132. [2020-01-16 17:52:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:52:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15598 transitions. [2020-01-16 17:52:44,977 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15598 transitions. Word has length 31 [2020-01-16 17:52:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:44,978 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15598 transitions. [2020-01-16 17:52:44,978 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15598 transitions. [2020-01-16 17:52:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:44,983 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:44,983 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:44,983 INFO L426 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:44,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:44,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1104424522, now seen corresponding path program 185 times [2020-01-16 17:52:44,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:44,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916041404] [2020-01-16 17:52:44,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:45,544 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:45,675 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:45,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-01-16 17:52:45,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916041404] [2020-01-16 17:52:45,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:45,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:45,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662057400] [2020-01-16 17:52:45,685 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:45,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:45,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:45,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:45,685 INFO L87 Difference]: Start difference. First operand 3132 states and 15598 transitions. Second operand 12 states. [2020-01-16 17:52:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:45,974 INFO L93 Difference]: Finished difference Result 6082 states and 26972 transitions. [2020-01-16 17:52:45,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:45,974 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:45,989 INFO L225 Difference]: With dead ends: 6082 [2020-01-16 17:52:45,989 INFO L226 Difference]: Without dead ends: 6062 [2020-01-16 17:52:45,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:46,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-01-16 17:52:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3143. [2020-01-16 17:52:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-01-16 17:52:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15618 transitions. [2020-01-16 17:52:46,214 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15618 transitions. Word has length 31 [2020-01-16 17:52:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:46,214 INFO L478 AbstractCegarLoop]: Abstraction has 3143 states and 15618 transitions. [2020-01-16 17:52:46,214 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15618 transitions. [2020-01-16 17:52:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:46,219 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:46,219 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:46,219 INFO L426 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:46,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1852975560, now seen corresponding path program 186 times [2020-01-16 17:52:46,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:46,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218238268] [2020-01-16 17:52:46,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:46,778 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:52:46,907 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:52:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:46,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218238268] [2020-01-16 17:52:46,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:46,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:46,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157755129] [2020-01-16 17:52:46,917 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:46,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:46,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:46,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:46,917 INFO L87 Difference]: Start difference. First operand 3143 states and 15618 transitions. Second operand 12 states. [2020-01-16 17:52:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:47,137 INFO L93 Difference]: Finished difference Result 6084 states and 26966 transitions. [2020-01-16 17:52:47,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:47,138 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:47,152 INFO L225 Difference]: With dead ends: 6084 [2020-01-16 17:52:47,152 INFO L226 Difference]: Without dead ends: 6040 [2020-01-16 17:52:47,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:47,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-01-16 17:52:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3121. [2020-01-16 17:52:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:52:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-01-16 17:52:47,373 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-01-16 17:52:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:47,374 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-01-16 17:52:47,374 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-01-16 17:52:47,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:47,379 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:47,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:47,379 INFO L426 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1576939674, now seen corresponding path program 187 times [2020-01-16 17:52:47,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:47,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945824972] [2020-01-16 17:52:47,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:47,912 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:52:48,047 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:48,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945824972] [2020-01-16 17:52:48,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:48,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:48,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724147699] [2020-01-16 17:52:48,058 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:48,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:48,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:48,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:48,058 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-01-16 17:52:48,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:48,274 INFO L93 Difference]: Finished difference Result 6053 states and 26910 transitions. [2020-01-16 17:52:48,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:48,275 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:48,289 INFO L225 Difference]: With dead ends: 6053 [2020-01-16 17:52:48,289 INFO L226 Difference]: Without dead ends: 6037 [2020-01-16 17:52:48,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:48,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-01-16 17:52:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3133. [2020-01-16 17:52:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:52:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15603 transitions. [2020-01-16 17:52:48,511 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15603 transitions. Word has length 31 [2020-01-16 17:52:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:48,511 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15603 transitions. [2020-01-16 17:52:48,511 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15603 transitions. [2020-01-16 17:52:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:48,516 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:48,517 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:48,517 INFO L426 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash 731968222, now seen corresponding path program 188 times [2020-01-16 17:52:48,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:48,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985141637] [2020-01-16 17:52:48,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:49,060 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:49,193 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:49,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985141637] [2020-01-16 17:52:49,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:49,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:49,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295201601] [2020-01-16 17:52:49,202 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:49,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:49,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:49,203 INFO L87 Difference]: Start difference. First operand 3133 states and 15603 transitions. Second operand 12 states. [2020-01-16 17:52:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:49,424 INFO L93 Difference]: Finished difference Result 6057 states and 26913 transitions. [2020-01-16 17:52:49,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:49,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:49,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:49,438 INFO L225 Difference]: With dead ends: 6057 [2020-01-16 17:52:49,438 INFO L226 Difference]: Without dead ends: 6032 [2020-01-16 17:52:49,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-01-16 17:52:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3128. [2020-01-16 17:52:49,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:52:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15589 transitions. [2020-01-16 17:52:49,659 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15589 transitions. Word has length 31 [2020-01-16 17:52:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:49,660 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15589 transitions. [2020-01-16 17:52:49,660 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15589 transitions. [2020-01-16 17:52:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:49,665 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:49,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:49,665 INFO L426 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash 91850348, now seen corresponding path program 189 times [2020-01-16 17:52:49,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:49,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715766569] [2020-01-16 17:52:49,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:50,328 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:52:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:50,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715766569] [2020-01-16 17:52:50,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:50,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:50,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694895436] [2020-01-16 17:52:50,337 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:50,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:50,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:50,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:50,338 INFO L87 Difference]: Start difference. First operand 3128 states and 15589 transitions. Second operand 12 states. [2020-01-16 17:52:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:50,553 INFO L93 Difference]: Finished difference Result 6056 states and 26910 transitions. [2020-01-16 17:52:50,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:50,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:50,569 INFO L225 Difference]: With dead ends: 6056 [2020-01-16 17:52:50,569 INFO L226 Difference]: Without dead ends: 6040 [2020-01-16 17:52:50,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-01-16 17:52:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3134. [2020-01-16 17:52:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:52:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15600 transitions. [2020-01-16 17:52:50,790 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15600 transitions. Word has length 31 [2020-01-16 17:52:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:50,790 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15600 transitions. [2020-01-16 17:52:50,790 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15600 transitions. [2020-01-16 17:52:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:50,796 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52: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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:50,796 INFO L426 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:50,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:50,796 INFO L82 PathProgramCache]: Analyzing trace with hash 584446110, now seen corresponding path program 190 times [2020-01-16 17:52:50,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:50,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289976555] [2020-01-16 17:52:50,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:51,383 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:52:51,517 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:52:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:51,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289976555] [2020-01-16 17:52:51,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:51,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:51,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310479278] [2020-01-16 17:52:51,526 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:51,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:51,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:51,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:51,527 INFO L87 Difference]: Start difference. First operand 3134 states and 15600 transitions. Second operand 12 states. [2020-01-16 17:52:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:51,703 INFO L93 Difference]: Finished difference Result 6062 states and 26916 transitions. [2020-01-16 17:52:51,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:51,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:51,718 INFO L225 Difference]: With dead ends: 6062 [2020-01-16 17:52:51,719 INFO L226 Difference]: Without dead ends: 6034 [2020-01-16 17:52:51,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:51,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-01-16 17:52:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3128. [2020-01-16 17:52:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:52:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-01-16 17:52:51,946 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-01-16 17:52:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:51,946 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-01-16 17:52:51,946 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-01-16 17:52:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:51,951 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:51,951 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:51,952 INFO L426 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:51,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1177432340, now seen corresponding path program 191 times [2020-01-16 17:52:51,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:51,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642503090] [2020-01-16 17:52:51,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:52,632 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:52:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:52,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642503090] [2020-01-16 17:52:52,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:52,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:52,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887922170] [2020-01-16 17:52:52,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:52,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:52,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:52,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:52,642 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-01-16 17:52:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:52,859 INFO L93 Difference]: Finished difference Result 6069 states and 26933 transitions. [2020-01-16 17:52:52,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:52,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:52,875 INFO L225 Difference]: With dead ends: 6069 [2020-01-16 17:52:52,875 INFO L226 Difference]: Without dead ends: 6049 [2020-01-16 17:52:52,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-01-16 17:52:53,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3139. [2020-01-16 17:52:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-01-16 17:52:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15603 transitions. [2020-01-16 17:52:53,110 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15603 transitions. Word has length 31 [2020-01-16 17:52:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:53,110 INFO L478 AbstractCegarLoop]: Abstraction has 3139 states and 15603 transitions. [2020-01-16 17:52:53,110 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15603 transitions. [2020-01-16 17:52:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:53,116 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:53,116 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:53,116 INFO L426 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:53,116 INFO L82 PathProgramCache]: Analyzing trace with hash 160134874, now seen corresponding path program 192 times [2020-01-16 17:52:53,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:53,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389181517] [2020-01-16 17:52:53,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:53,677 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:52:53,810 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:52:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:53,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389181517] [2020-01-16 17:52:53,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:53,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:53,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347047122] [2020-01-16 17:52:53,820 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:53,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:53,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:53,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:53,820 INFO L87 Difference]: Start difference. First operand 3139 states and 15603 transitions. Second operand 12 states. [2020-01-16 17:52:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:54,053 INFO L93 Difference]: Finished difference Result 6071 states and 26927 transitions. [2020-01-16 17:52:54,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:54,053 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:54,068 INFO L225 Difference]: With dead ends: 6071 [2020-01-16 17:52:54,068 INFO L226 Difference]: Without dead ends: 6023 [2020-01-16 17:52:54,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-01-16 17:52:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3113. [2020-01-16 17:52:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-01-16 17:52:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15548 transitions. [2020-01-16 17:52:54,301 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15548 transitions. Word has length 31 [2020-01-16 17:52:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:54,301 INFO L478 AbstractCegarLoop]: Abstraction has 3113 states and 15548 transitions. [2020-01-16 17:52:54,301 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15548 transitions. [2020-01-16 17:52:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:54,307 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:54,307 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:54,307 INFO L426 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:54,307 INFO L82 PathProgramCache]: Analyzing trace with hash -335245110, now seen corresponding path program 193 times [2020-01-16 17:52:54,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:54,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744702007] [2020-01-16 17:52:54,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:54,834 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:52:54,973 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:52:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:54,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744702007] [2020-01-16 17:52:54,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:54,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:54,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69049885] [2020-01-16 17:52:54,982 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:54,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:54,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:54,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:54,982 INFO L87 Difference]: Start difference. First operand 3113 states and 15548 transitions. Second operand 12 states. [2020-01-16 17:52:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:55,202 INFO L93 Difference]: Finished difference Result 6031 states and 26872 transitions. [2020-01-16 17:52:55,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:55,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:55,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:55,217 INFO L225 Difference]: With dead ends: 6031 [2020-01-16 17:52:55,217 INFO L226 Difference]: Without dead ends: 6012 [2020-01-16 17:52:55,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-01-16 17:52:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3129. [2020-01-16 17:52:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:52:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15604 transitions. [2020-01-16 17:52:55,444 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15604 transitions. Word has length 31 [2020-01-16 17:52:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:55,444 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15604 transitions. [2020-01-16 17:52:55,445 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15604 transitions. [2020-01-16 17:52:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:55,450 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:55,450 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:55,450 INFO L426 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:55,450 INFO L82 PathProgramCache]: Analyzing trace with hash -757730836, now seen corresponding path program 194 times [2020-01-16 17:52:55,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:55,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866684344] [2020-01-16 17:52:55,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:55,974 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:52:56,104 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:52:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:56,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866684344] [2020-01-16 17:52:56,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:56,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:56,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909557040] [2020-01-16 17:52:56,114 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:56,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:56,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:56,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:56,114 INFO L87 Difference]: Start difference. First operand 3129 states and 15604 transitions. Second operand 12 states. [2020-01-16 17:52:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:56,358 INFO L93 Difference]: Finished difference Result 6028 states and 26861 transitions. [2020-01-16 17:52:56,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:56,359 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:56,374 INFO L225 Difference]: With dead ends: 6028 [2020-01-16 17:52:56,374 INFO L226 Difference]: Without dead ends: 6007 [2020-01-16 17:52:56,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-01-16 17:52:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3124. [2020-01-16 17:52:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:52:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15590 transitions. [2020-01-16 17:52:56,600 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15590 transitions. Word has length 31 [2020-01-16 17:52:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:56,601 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15590 transitions. [2020-01-16 17:52:56,601 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:56,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15590 transitions. [2020-01-16 17:52:56,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:56,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:56,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:56,606 INFO L426 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:56,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:56,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1608178818, now seen corresponding path program 195 times [2020-01-16 17:52:56,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:56,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602178095] [2020-01-16 17:52:56,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:57,242 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:52:57,373 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:52:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:57,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602178095] [2020-01-16 17:52:57,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:57,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:57,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858003546] [2020-01-16 17:52:57,384 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:57,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:57,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:57,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:57,385 INFO L87 Difference]: Start difference. First operand 3124 states and 15590 transitions. Second operand 12 states. [2020-01-16 17:52:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:57,611 INFO L93 Difference]: Finished difference Result 6035 states and 26877 transitions. [2020-01-16 17:52:57,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:57,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:57,627 INFO L225 Difference]: With dead ends: 6035 [2020-01-16 17:52:57,627 INFO L226 Difference]: Without dead ends: 6016 [2020-01-16 17:52:57,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-01-16 17:52:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3131. [2020-01-16 17:52:57,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:52:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15603 transitions. [2020-01-16 17:52:57,857 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15603 transitions. Word has length 31 [2020-01-16 17:52:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:57,857 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15603 transitions. [2020-01-16 17:52:57,857 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15603 transitions. [2020-01-16 17:52:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:57,863 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:57,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:57,863 INFO L426 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:57,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:57,863 INFO L82 PathProgramCache]: Analyzing trace with hash -270611604, now seen corresponding path program 196 times [2020-01-16 17:52:57,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:57,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403755949] [2020-01-16 17:52:57,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:58,402 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:52:58,536 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:52:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:58,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403755949] [2020-01-16 17:52:58,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:58,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:58,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420696755] [2020-01-16 17:52:58,546 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:58,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:58,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:58,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:58,546 INFO L87 Difference]: Start difference. First operand 3131 states and 15603 transitions. Second operand 12 states. [2020-01-16 17:52:58,842 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-01-16 17:52:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:58,864 INFO L93 Difference]: Finished difference Result 6034 states and 26868 transitions. [2020-01-16 17:52:58,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:58,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:52:58,880 INFO L225 Difference]: With dead ends: 6034 [2020-01-16 17:52:58,880 INFO L226 Difference]: Without dead ends: 6009 [2020-01-16 17:52:58,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:52:59,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2020-01-16 17:52:59,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 3124. [2020-01-16 17:52:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:52:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15585 transitions. [2020-01-16 17:52:59,100 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15585 transitions. Word has length 31 [2020-01-16 17:52:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:52:59,100 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15585 transitions. [2020-01-16 17:52:59,100 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:52:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15585 transitions. [2020-01-16 17:52:59,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:52:59,105 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:52:59,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:52:59,105 INFO L426 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:52:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:52:59,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2052147134, now seen corresponding path program 197 times [2020-01-16 17:52:59,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:52:59,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115052216] [2020-01-16 17:52:59,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:52:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:52:59,624 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:52:59,755 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:52:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:52:59,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115052216] [2020-01-16 17:52:59,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:52:59,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:52:59,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750404831] [2020-01-16 17:52:59,764 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:52:59,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:52:59,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:52:59,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:52:59,764 INFO L87 Difference]: Start difference. First operand 3124 states and 15585 transitions. Second operand 12 states. [2020-01-16 17:52:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:52:59,988 INFO L93 Difference]: Finished difference Result 6027 states and 26854 transitions. [2020-01-16 17:52:59,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:52:59,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:52:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:00,003 INFO L225 Difference]: With dead ends: 6027 [2020-01-16 17:53:00,004 INFO L226 Difference]: Without dead ends: 6011 [2020-01-16 17:53:00,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:00,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-01-16 17:53:00,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3129. [2020-01-16 17:53:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:53:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15594 transitions. [2020-01-16 17:53:00,225 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15594 transitions. Word has length 31 [2020-01-16 17:53:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:00,225 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15594 transitions. [2020-01-16 17:53:00,225 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15594 transitions. [2020-01-16 17:53:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:00,231 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:00,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:00,231 INFO L426 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:00,231 INFO L82 PathProgramCache]: Analyzing trace with hash -482767222, now seen corresponding path program 198 times [2020-01-16 17:53:00,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:00,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265977922] [2020-01-16 17:53:00,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:00,885 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:00,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265977922] [2020-01-16 17:53:00,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:00,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:00,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551962056] [2020-01-16 17:53:00,895 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:00,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:00,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:00,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:00,895 INFO L87 Difference]: Start difference. First operand 3129 states and 15594 transitions. Second operand 12 states. [2020-01-16 17:53:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:01,140 INFO L93 Difference]: Finished difference Result 6029 states and 26853 transitions. [2020-01-16 17:53:01,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:01,140 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:01,155 INFO L225 Difference]: With dead ends: 6029 [2020-01-16 17:53:01,155 INFO L226 Difference]: Without dead ends: 6001 [2020-01-16 17:53:01,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:01,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-01-16 17:53:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3119. [2020-01-16 17:53:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:53:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15571 transitions. [2020-01-16 17:53:01,377 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15571 transitions. Word has length 31 [2020-01-16 17:53:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:01,378 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15571 transitions. [2020-01-16 17:53:01,378 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15571 transitions. [2020-01-16 17:53:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:01,383 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:01,383 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:01,383 INFO L426 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:01,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:01,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1409118896, now seen corresponding path program 199 times [2020-01-16 17:53:01,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:01,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088351785] [2020-01-16 17:53:01,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:01,917 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:02,046 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:53:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:02,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088351785] [2020-01-16 17:53:02,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:02,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:02,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098255345] [2020-01-16 17:53:02,056 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:02,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:02,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:02,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:02,056 INFO L87 Difference]: Start difference. First operand 3119 states and 15571 transitions. Second operand 12 states. [2020-01-16 17:53:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:02,282 INFO L93 Difference]: Finished difference Result 6039 states and 26884 transitions. [2020-01-16 17:53:02,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:02,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:02,297 INFO L225 Difference]: With dead ends: 6039 [2020-01-16 17:53:02,297 INFO L226 Difference]: Without dead ends: 6020 [2020-01-16 17:53:02,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-01-16 17:53:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3130. [2020-01-16 17:53:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:53:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15602 transitions. [2020-01-16 17:53:02,519 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15602 transitions. Word has length 31 [2020-01-16 17:53:02,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:02,519 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15602 transitions. [2020-01-16 17:53:02,519 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:02,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15602 transitions. [2020-01-16 17:53:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:02,525 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:02,525 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:02,525 INFO L426 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:02,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:02,525 INFO L82 PathProgramCache]: Analyzing trace with hash 986633170, now seen corresponding path program 200 times [2020-01-16 17:53:02,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:02,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969755059] [2020-01-16 17:53:02,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:03,064 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:53:03,194 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:53:03,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-01-16 17:53:03,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969755059] [2020-01-16 17:53:03,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:03,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:03,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487038155] [2020-01-16 17:53:03,204 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:03,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:03,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:03,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:03,205 INFO L87 Difference]: Start difference. First operand 3130 states and 15602 transitions. Second operand 12 states. [2020-01-16 17:53:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:03,437 INFO L93 Difference]: Finished difference Result 6036 states and 26873 transitions. [2020-01-16 17:53:03,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:03,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:03,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:03,452 INFO L225 Difference]: With dead ends: 6036 [2020-01-16 17:53:03,452 INFO L226 Difference]: Without dead ends: 6015 [2020-01-16 17:53:03,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2020-01-16 17:53:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 3125. [2020-01-16 17:53:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:53:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15588 transitions. [2020-01-16 17:53:03,672 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15588 transitions. Word has length 31 [2020-01-16 17:53:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:03,673 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15588 transitions. [2020-01-16 17:53:03,673 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15588 transitions. [2020-01-16 17:53:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:03,678 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53: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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:03,678 INFO L426 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:03,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:03,678 INFO L82 PathProgramCache]: Analyzing trace with hash -500281666, now seen corresponding path program 201 times [2020-01-16 17:53:03,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:03,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069688195] [2020-01-16 17:53:03,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:04,228 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:04,359 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:53:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:04,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069688195] [2020-01-16 17:53:04,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:04,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:04,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373596485] [2020-01-16 17:53:04,369 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:04,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:04,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:04,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:04,370 INFO L87 Difference]: Start difference. First operand 3125 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:53:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:04,648 INFO L93 Difference]: Finished difference Result 6049 states and 26901 transitions. [2020-01-16 17:53:04,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:04,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:04,663 INFO L225 Difference]: With dead ends: 6049 [2020-01-16 17:53:04,663 INFO L226 Difference]: Without dead ends: 6030 [2020-01-16 17:53:04,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-01-16 17:53:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3134. [2020-01-16 17:53:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:53:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15605 transitions. [2020-01-16 17:53:04,884 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15605 transitions. Word has length 31 [2020-01-16 17:53:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:04,885 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15605 transitions. [2020-01-16 17:53:04,885 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15605 transitions. [2020-01-16 17:53:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:04,890 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:04,890 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:04,890 INFO L426 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:04,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:04,890 INFO L82 PathProgramCache]: Analyzing trace with hash -430171630, now seen corresponding path program 202 times [2020-01-16 17:53:04,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:04,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998077983] [2020-01-16 17:53:04,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:05,437 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:53:05,566 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:53:05,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-01-16 17:53:05,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998077983] [2020-01-16 17:53:05,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:05,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:05,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379762924] [2020-01-16 17:53:05,577 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:05,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:05,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:05,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:05,578 INFO L87 Difference]: Start difference. First operand 3134 states and 15605 transitions. Second operand 12 states. [2020-01-16 17:53:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:05,780 INFO L93 Difference]: Finished difference Result 6052 states and 26898 transitions. [2020-01-16 17:53:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:05,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:05,795 INFO L225 Difference]: With dead ends: 6052 [2020-01-16 17:53:05,796 INFO L226 Difference]: Without dead ends: 6021 [2020-01-16 17:53:05,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2020-01-16 17:53:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 3125. [2020-01-16 17:53:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:53:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15582 transitions. [2020-01-16 17:53:06,017 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15582 transitions. Word has length 31 [2020-01-16 17:53:06,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:06,017 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15582 transitions. [2020-01-16 17:53:06,017 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15582 transitions. [2020-01-16 17:53:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:06,022 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:06,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:06,022 INFO L426 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:06,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:06,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1134923010, now seen corresponding path program 203 times [2020-01-16 17:53:06,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:06,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033260337] [2020-01-16 17:53:06,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:06,597 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:53:06,726 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:53:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:06,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033260337] [2020-01-16 17:53:06,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:06,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:06,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687972272] [2020-01-16 17:53:06,735 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:06,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:06,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:06,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:06,735 INFO L87 Difference]: Start difference. First operand 3125 states and 15582 transitions. Second operand 12 states. [2020-01-16 17:53:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:06,965 INFO L93 Difference]: Finished difference Result 6040 states and 26874 transitions. [2020-01-16 17:53:06,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:06,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:06,980 INFO L225 Difference]: With dead ends: 6040 [2020-01-16 17:53:06,980 INFO L226 Difference]: Without dead ends: 6024 [2020-01-16 17:53:06,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-01-16 17:53:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3131. [2020-01-16 17:53:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:53:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15593 transitions. [2020-01-16 17:53:07,206 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15593 transitions. Word has length 31 [2020-01-16 17:53:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:07,206 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15593 transitions. [2020-01-16 17:53:07,207 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15593 transitions. [2020-01-16 17:53:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:07,212 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:07,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:07,212 INFO L426 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:07,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:07,212 INFO L82 PathProgramCache]: Analyzing trace with hash -642327248, now seen corresponding path program 204 times [2020-01-16 17:53:07,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:07,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897415301] [2020-01-16 17:53:07,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:07,737 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:53:07,868 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:53:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:07,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897415301] [2020-01-16 17:53:07,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:07,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:07,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379614683] [2020-01-16 17:53:07,878 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:07,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:07,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:07,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:07,878 INFO L87 Difference]: Start difference. First operand 3131 states and 15593 transitions. Second operand 12 states. [2020-01-16 17:53:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:08,102 INFO L93 Difference]: Finished difference Result 6046 states and 26880 transitions. [2020-01-16 17:53:08,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:08,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:08,117 INFO L225 Difference]: With dead ends: 6046 [2020-01-16 17:53:08,117 INFO L226 Difference]: Without dead ends: 6012 [2020-01-16 17:53:08,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-01-16 17:53:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3119. [2020-01-16 17:53:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:53:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-01-16 17:53:08,338 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-01-16 17:53:08,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:08,338 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-01-16 17:53:08,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-01-16 17:53:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:08,344 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:08,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:08,344 INFO L426 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:08,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:08,344 INFO L82 PathProgramCache]: Analyzing trace with hash -670054096, now seen corresponding path program 205 times [2020-01-16 17:53:08,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:08,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56449560] [2020-01-16 17:53:08,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:08,879 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:09,009 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:53:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:09,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56449560] [2020-01-16 17:53:09,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:09,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:09,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855103016] [2020-01-16 17:53:09,019 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:09,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:09,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:09,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:09,019 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-01-16 17:53:09,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:09,300 INFO L93 Difference]: Finished difference Result 6051 states and 26912 transitions. [2020-01-16 17:53:09,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:09,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:09,316 INFO L225 Difference]: With dead ends: 6051 [2020-01-16 17:53:09,316 INFO L226 Difference]: Without dead ends: 6032 [2020-01-16 17:53:09,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-01-16 17:53:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3134. [2020-01-16 17:53:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:53:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15608 transitions. [2020-01-16 17:53:09,538 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15608 transitions. Word has length 31 [2020-01-16 17:53:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:09,538 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15608 transitions. [2020-01-16 17:53:09,538 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15608 transitions. [2020-01-16 17:53:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:09,544 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:09,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:09,544 INFO L426 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:09,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:09,544 INFO L82 PathProgramCache]: Analyzing trace with hash 667513118, now seen corresponding path program 206 times [2020-01-16 17:53:09,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:09,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177913927] [2020-01-16 17:53:09,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:10,076 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:10,205 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:10,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177913927] [2020-01-16 17:53:10,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:10,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:10,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051557934] [2020-01-16 17:53:10,214 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:10,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:10,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:10,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:10,214 INFO L87 Difference]: Start difference. First operand 3134 states and 15608 transitions. Second operand 12 states. [2020-01-16 17:53:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:10,451 INFO L93 Difference]: Finished difference Result 6050 states and 26903 transitions. [2020-01-16 17:53:10,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:10,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:10,466 INFO L225 Difference]: With dead ends: 6050 [2020-01-16 17:53:10,466 INFO L226 Difference]: Without dead ends: 6025 [2020-01-16 17:53:10,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2020-01-16 17:53:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3127. [2020-01-16 17:53:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:53:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15588 transitions. [2020-01-16 17:53:10,693 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15588 transitions. Word has length 31 [2020-01-16 17:53:10,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:10,693 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15588 transitions. [2020-01-16 17:53:10,693 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15588 transitions. [2020-01-16 17:53:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:10,698 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:10,698 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:10,698 INFO L426 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:10,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1306520950, now seen corresponding path program 207 times [2020-01-16 17:53:10,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:10,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573053682] [2020-01-16 17:53:10,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:11,241 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:11,369 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:53:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:11,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573053682] [2020-01-16 17:53:11,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:11,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:11,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733549257] [2020-01-16 17:53:11,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:11,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:11,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:11,378 INFO L87 Difference]: Start difference. First operand 3127 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:53:11,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:11,623 INFO L93 Difference]: Finished difference Result 6057 states and 26917 transitions. [2020-01-16 17:53:11,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:11,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:11,638 INFO L225 Difference]: With dead ends: 6057 [2020-01-16 17:53:11,639 INFO L226 Difference]: Without dead ends: 6038 [2020-01-16 17:53:11,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-01-16 17:53:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3136. [2020-01-16 17:53:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-01-16 17:53:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15605 transitions. [2020-01-16 17:53:11,861 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15605 transitions. Word has length 31 [2020-01-16 17:53:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:11,862 INFO L478 AbstractCegarLoop]: Abstraction has 3136 states and 15605 transitions. [2020-01-16 17:53:11,862 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15605 transitions. [2020-01-16 17:53:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:11,867 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:11,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:11,867 INFO L426 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:11,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1236410914, now seen corresponding path program 208 times [2020-01-16 17:53:11,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:11,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528892461] [2020-01-16 17:53:11,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:12,423 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:53:12,557 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:53: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-01-16 17:53:12,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528892461] [2020-01-16 17:53:12,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:12,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:12,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343518360] [2020-01-16 17:53:12,566 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:12,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:12,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:12,567 INFO L87 Difference]: Start difference. First operand 3136 states and 15605 transitions. Second operand 12 states. [2020-01-16 17:53:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:12,777 INFO L93 Difference]: Finished difference Result 6060 states and 26914 transitions. [2020-01-16 17:53:12,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:12,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:12,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:12,792 INFO L225 Difference]: With dead ends: 6060 [2020-01-16 17:53:12,793 INFO L226 Difference]: Without dead ends: 6029 [2020-01-16 17:53:12,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:12,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2020-01-16 17:53:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3127. [2020-01-16 17:53:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:53:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15580 transitions. [2020-01-16 17:53:13,017 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15580 transitions. Word has length 31 [2020-01-16 17:53:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:13,017 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15580 transitions. [2020-01-16 17:53:13,017 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15580 transitions. [2020-01-16 17:53:13,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:13,022 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:13,023 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:13,023 INFO L426 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:13,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:13,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1454043062, now seen corresponding path program 209 times [2020-01-16 17:53:13,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:13,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991107923] [2020-01-16 17:53:13,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:13,585 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:13,714 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:13,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991107923] [2020-01-16 17:53:13,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:13,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:13,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618318160] [2020-01-16 17:53:13,724 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:13,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:13,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:13,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:13,725 INFO L87 Difference]: Start difference. First operand 3127 states and 15580 transitions. Second operand 12 states. [2020-01-16 17:53:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:13,967 INFO L93 Difference]: Finished difference Result 6054 states and 26902 transitions. [2020-01-16 17:53:13,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:13,968 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:13,982 INFO L225 Difference]: With dead ends: 6054 [2020-01-16 17:53:13,983 INFO L226 Difference]: Without dead ends: 6036 [2020-01-16 17:53:13,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-01-16 17:53:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3135. [2020-01-16 17:53:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:53:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15595 transitions. [2020-01-16 17:53:14,206 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15595 transitions. Word has length 31 [2020-01-16 17:53:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:14,207 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15595 transitions. [2020-01-16 17:53:14,207 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15595 transitions. [2020-01-16 17:53:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:14,212 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:14,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:14,212 INFO L426 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:14,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:14,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1573467056, now seen corresponding path program 210 times [2020-01-16 17:53:14,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:14,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770639394] [2020-01-16 17:53:14,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:14,759 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:53:14,889 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:14,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-01-16 17:53:14,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770639394] [2020-01-16 17:53:14,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:14,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:14,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074480662] [2020-01-16 17:53:14,899 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:14,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:14,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:14,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:14,900 INFO L87 Difference]: Start difference. First operand 3135 states and 15595 transitions. Second operand 12 states. [2020-01-16 17:53:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:15,094 INFO L93 Difference]: Finished difference Result 6058 states and 26902 transitions. [2020-01-16 17:53:15,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:15,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:15,110 INFO L225 Difference]: With dead ends: 6058 [2020-01-16 17:53:15,110 INFO L226 Difference]: Without dead ends: 6020 [2020-01-16 17:53:15,110 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-01-16 17:53:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3119. [2020-01-16 17:53:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:53:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15559 transitions. [2020-01-16 17:53:15,331 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15559 transitions. Word has length 31 [2020-01-16 17:53:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:15,331 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15559 transitions. [2020-01-16 17:53:15,331 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15559 transitions. [2020-01-16 17:53:15,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:15,337 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:15,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:15,337 INFO L426 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:15,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:15,337 INFO L82 PathProgramCache]: Analyzing trace with hash 708414994, now seen corresponding path program 211 times [2020-01-16 17:53:15,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:15,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306522922] [2020-01-16 17:53:15,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:15,861 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:53:15,994 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:16,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306522922] [2020-01-16 17:53:16,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:16,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:16,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207296991] [2020-01-16 17:53:16,004 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:16,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:16,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:16,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:16,005 INFO L87 Difference]: Start difference. First operand 3119 states and 15559 transitions. Second operand 12 states. [2020-01-16 17:53:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:16,242 INFO L93 Difference]: Finished difference Result 6033 states and 26859 transitions. [2020-01-16 17:53:16,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:16,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:16,257 INFO L225 Difference]: With dead ends: 6033 [2020-01-16 17:53:16,257 INFO L226 Difference]: Without dead ends: 6017 [2020-01-16 17:53:16,257 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-01-16 17:53:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3130. [2020-01-16 17:53:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:53:16,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15590 transitions. [2020-01-16 17:53:16,481 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15590 transitions. Word has length 31 [2020-01-16 17:53:16,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:16,481 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15590 transitions. [2020-01-16 17:53:16,481 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:16,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15590 transitions. [2020-01-16 17:53:16,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:16,486 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:16,486 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:16,486 INFO L426 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:16,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:16,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1826499362, now seen corresponding path program 212 times [2020-01-16 17:53:16,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:16,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849325859] [2020-01-16 17:53:16,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:17,007 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:17,139 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:17,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849325859] [2020-01-16 17:53:17,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:17,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:17,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312976418] [2020-01-16 17:53:17,150 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:17,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:17,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:17,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:17,150 INFO L87 Difference]: Start difference. First operand 3130 states and 15590 transitions. Second operand 12 states. [2020-01-16 17:53:17,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:17,407 INFO L93 Difference]: Finished difference Result 6035 states and 26858 transitions. [2020-01-16 17:53:17,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:17,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:17,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:17,422 INFO L225 Difference]: With dead ends: 6035 [2020-01-16 17:53:17,422 INFO L226 Difference]: Without dead ends: 6012 [2020-01-16 17:53:17,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:17,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-01-16 17:53:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3125. [2020-01-16 17:53:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:53:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-01-16 17:53:17,652 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-01-16 17:53:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:17,652 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-01-16 17:53:17,652 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-01-16 17:53:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:17,657 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:17,657 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:17,657 INFO L426 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:17,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash 71948140, now seen corresponding path program 213 times [2020-01-16 17:53:17,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:17,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277663571] [2020-01-16 17:53:17,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:18,298 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:18,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277663571] [2020-01-16 17:53:18,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:18,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:18,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675472072] [2020-01-16 17:53:18,308 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:18,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:18,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:18,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:18,309 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-01-16 17:53:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:18,604 INFO L93 Difference]: Finished difference Result 6038 states and 26863 transitions. [2020-01-16 17:53:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:18,604 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:18,619 INFO L225 Difference]: With dead ends: 6038 [2020-01-16 17:53:18,619 INFO L226 Difference]: Without dead ends: 6022 [2020-01-16 17:53:18,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:18,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-01-16 17:53:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3131. [2020-01-16 17:53:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:53:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15587 transitions. [2020-01-16 17:53:18,848 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15587 transitions. Word has length 31 [2020-01-16 17:53:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:18,849 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15587 transitions. [2020-01-16 17:53:18,849 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15587 transitions. [2020-01-16 17:53:18,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:18,854 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:18,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:18,854 INFO L426 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:18,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:18,855 INFO L82 PathProgramCache]: Analyzing trace with hash 564543902, now seen corresponding path program 214 times [2020-01-16 17:53:18,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:18,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437875511] [2020-01-16 17:53:18,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:19,382 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:53:19,512 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:19,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437875511] [2020-01-16 17:53:19,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:19,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:19,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838319728] [2020-01-16 17:53:19,521 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:19,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:19,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:19,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:19,522 INFO L87 Difference]: Start difference. First operand 3131 states and 15587 transitions. Second operand 12 states. [2020-01-16 17:53:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:19,714 INFO L93 Difference]: Finished difference Result 6044 states and 26869 transitions. [2020-01-16 17:53:19,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:19,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:19,729 INFO L225 Difference]: With dead ends: 6044 [2020-01-16 17:53:19,729 INFO L226 Difference]: Without dead ends: 6016 [2020-01-16 17:53:19,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-01-16 17:53:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3125. [2020-01-16 17:53:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:53:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15570 transitions. [2020-01-16 17:53:19,950 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15570 transitions. Word has length 31 [2020-01-16 17:53:19,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:19,950 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15570 transitions. [2020-01-16 17:53:19,950 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15570 transitions. [2020-01-16 17:53:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:19,955 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:19,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:19,955 INFO L426 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash 559067372, now seen corresponding path program 215 times [2020-01-16 17:53:19,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:19,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817466095] [2020-01-16 17:53:19,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:20,490 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:20,619 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:20,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817466095] [2020-01-16 17:53:20,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:20,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:20,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109934343] [2020-01-16 17:53:20,628 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:20,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:20,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:20,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:20,629 INFO L87 Difference]: Start difference. First operand 3125 states and 15570 transitions. Second operand 12 states. [2020-01-16 17:53:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:20,886 INFO L93 Difference]: Finished difference Result 6044 states and 26871 transitions. [2020-01-16 17:53:20,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:20,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:20,902 INFO L225 Difference]: With dead ends: 6044 [2020-01-16 17:53:20,902 INFO L226 Difference]: Without dead ends: 6026 [2020-01-16 17:53:20,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-01-16 17:53:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3133. [2020-01-16 17:53:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:53:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15585 transitions. [2020-01-16 17:53:21,125 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15585 transitions. Word has length 31 [2020-01-16 17:53:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:21,125 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15585 transitions. [2020-01-16 17:53:21,125 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:21,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15585 transitions. [2020-01-16 17:53:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:21,131 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:21,131 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:21,131 INFO L426 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:21,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:21,131 INFO L82 PathProgramCache]: Analyzing trace with hash -708389806, now seen corresponding path program 216 times [2020-01-16 17:53:21,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:21,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903350649] [2020-01-16 17:53:21,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:21,704 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:53:21,835 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:21,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-01-16 17:53:21,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903350649] [2020-01-16 17:53:21,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:21,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:21,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691520459] [2020-01-16 17:53:21,844 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:21,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:21,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:21,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:21,844 INFO L87 Difference]: Start difference. First operand 3133 states and 15585 transitions. Second operand 12 states. [2020-01-16 17:53:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:22,096 INFO L93 Difference]: Finished difference Result 6048 states and 26871 transitions. [2020-01-16 17:53:22,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:22,097 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:22,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:22,112 INFO L225 Difference]: With dead ends: 6048 [2020-01-16 17:53:22,112 INFO L226 Difference]: Without dead ends: 6006 [2020-01-16 17:53:22,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-01-16 17:53:22,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3113. [2020-01-16 17:53:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-01-16 17:53:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15542 transitions. [2020-01-16 17:53:22,338 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15542 transitions. Word has length 31 [2020-01-16 17:53:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:22,339 INFO L478 AbstractCegarLoop]: Abstraction has 3113 states and 15542 transitions. [2020-01-16 17:53:22,339 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15542 transitions. [2020-01-16 17:53:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:22,344 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:22,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:22,344 INFO L426 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:22,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:22,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1409124346, now seen corresponding path program 217 times [2020-01-16 17:53:22,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:22,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584799568] [2020-01-16 17:53:22,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:22,859 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:53:22,988 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:23,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584799568] [2020-01-16 17:53:23,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:23,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:23,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656692040] [2020-01-16 17:53:23,002 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:23,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:23,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:23,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:23,002 INFO L87 Difference]: Start difference. First operand 3113 states and 15542 transitions. Second operand 12 states. [2020-01-16 17:53:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:23,292 INFO L93 Difference]: Finished difference Result 6036 states and 26877 transitions. [2020-01-16 17:53:23,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:23,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:23,306 INFO L225 Difference]: With dead ends: 6036 [2020-01-16 17:53:23,306 INFO L226 Difference]: Without dead ends: 6020 [2020-01-16 17:53:23,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-01-16 17:53:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3130. [2020-01-16 17:53:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:53:23,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15601 transitions. [2020-01-16 17:53:23,527 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15601 transitions. Word has length 31 [2020-01-16 17:53:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:23,527 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15601 transitions. [2020-01-16 17:53:23,527 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15601 transitions. [2020-01-16 17:53:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:23,532 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:23,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:23,532 INFO L426 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:23,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:23,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2040871498, now seen corresponding path program 218 times [2020-01-16 17:53:23,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:23,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640532920] [2020-01-16 17:53:23,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:24,201 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:24,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640532920] [2020-01-16 17:53:24,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:24,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:24,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472567213] [2020-01-16 17:53:24,211 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:24,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:24,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:24,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:24,212 INFO L87 Difference]: Start difference. First operand 3130 states and 15601 transitions. Second operand 12 states. [2020-01-16 17:53:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:24,472 INFO L93 Difference]: Finished difference Result 6040 states and 26880 transitions. [2020-01-16 17:53:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:24,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:24,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:24,488 INFO L225 Difference]: With dead ends: 6040 [2020-01-16 17:53:24,488 INFO L226 Difference]: Without dead ends: 6015 [2020-01-16 17:53:24,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:24,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2020-01-16 17:53:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 3125. [2020-01-16 17:53:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:53:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15587 transitions. [2020-01-16 17:53:24,714 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15587 transitions. Word has length 31 [2020-01-16 17:53:24,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:24,714 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15587 transitions. [2020-01-16 17:53:24,714 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15587 transitions. [2020-01-16 17:53:24,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:24,720 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:24,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:24,720 INFO L426 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:24,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2037220478, now seen corresponding path program 219 times [2020-01-16 17:53:24,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:24,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586728373] [2020-01-16 17:53:24,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:25,244 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:53:25,369 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:25,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-01-16 17:53:25,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586728373] [2020-01-16 17:53:25,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:25,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:25,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302097835] [2020-01-16 17:53:25,379 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:25,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:25,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:25,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:25,379 INFO L87 Difference]: Start difference. First operand 3125 states and 15587 transitions. Second operand 12 states. [2020-01-16 17:53:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:25,633 INFO L93 Difference]: Finished difference Result 6034 states and 26868 transitions. [2020-01-16 17:53:25,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:25,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:25,649 INFO L225 Difference]: With dead ends: 6034 [2020-01-16 17:53:25,649 INFO L226 Difference]: Without dead ends: 6018 [2020-01-16 17:53:25,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-01-16 17:53:25,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3130. [2020-01-16 17:53:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:53:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15596 transitions. [2020-01-16 17:53:25,876 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15596 transitions. Word has length 31 [2020-01-16 17:53:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:25,876 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15596 transitions. [2020-01-16 17:53:25,876 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15596 transitions. [2020-01-16 17:53:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:25,882 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:25,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:25,882 INFO L426 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:25,882 INFO L82 PathProgramCache]: Analyzing trace with hash -497693878, now seen corresponding path program 220 times [2020-01-16 17:53:25,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:25,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145632312] [2020-01-16 17:53:25,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:26,399 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:53:26,532 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:26,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-01-16 17:53:26,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145632312] [2020-01-16 17:53:26,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:26,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:26,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051961739] [2020-01-16 17:53:26,541 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:26,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:26,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:26,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:26,541 INFO L87 Difference]: Start difference. First operand 3130 states and 15596 transitions. Second operand 12 states. [2020-01-16 17:53:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:26,779 INFO L93 Difference]: Finished difference Result 6036 states and 26867 transitions. [2020-01-16 17:53:26,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:26,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:26,795 INFO L225 Difference]: With dead ends: 6036 [2020-01-16 17:53:26,795 INFO L226 Difference]: Without dead ends: 6013 [2020-01-16 17:53:26,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-01-16 17:53:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3125. [2020-01-16 17:53:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:53:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15582 transitions. [2020-01-16 17:53:27,022 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15582 transitions. Word has length 31 [2020-01-16 17:53:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:27,022 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15582 transitions. [2020-01-16 17:53:27,023 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15582 transitions. [2020-01-16 17:53:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:27,028 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:27,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:27,028 INFO L426 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:27,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash 767937790, now seen corresponding path program 221 times [2020-01-16 17:53:27,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:27,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883790638] [2020-01-16 17:53:27,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:27,558 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:27,688 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:27,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883790638] [2020-01-16 17:53:27,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:27,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:27,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404567420] [2020-01-16 17:53:27,698 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:27,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:27,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:27,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:27,699 INFO L87 Difference]: Start difference. First operand 3125 states and 15582 transitions. Second operand 12 states. [2020-01-16 17:53:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:27,952 INFO L93 Difference]: Finished difference Result 6044 states and 26885 transitions. [2020-01-16 17:53:27,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:27,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:27,966 INFO L225 Difference]: With dead ends: 6044 [2020-01-16 17:53:27,966 INFO L226 Difference]: Without dead ends: 6024 [2020-01-16 17:53:27,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-01-16 17:53:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3132. [2020-01-16 17:53:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:53:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15595 transitions. [2020-01-16 17:53:28,188 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15595 transitions. Word has length 31 [2020-01-16 17:53:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:28,188 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15595 transitions. [2020-01-16 17:53:28,188 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:28,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15595 transitions. [2020-01-16 17:53:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:28,193 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:28,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:28,194 INFO L426 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:28,194 INFO L82 PathProgramCache]: Analyzing trace with hash -922005114, now seen corresponding path program 222 times [2020-01-16 17:53:28,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:28,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535223808] [2020-01-16 17:53:28,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:28,726 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:53:28,855 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:28,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535223808] [2020-01-16 17:53:28,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:28,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:28,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118058149] [2020-01-16 17:53:28,866 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:28,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:28,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:28,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:28,866 INFO L87 Difference]: Start difference. First operand 3132 states and 15595 transitions. Second operand 12 states. [2020-01-16 17:53:29,112 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-01-16 17:53:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:29,134 INFO L93 Difference]: Finished difference Result 6042 states and 26874 transitions. [2020-01-16 17:53:29,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:29,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:29,150 INFO L225 Difference]: With dead ends: 6042 [2020-01-16 17:53:29,150 INFO L226 Difference]: Without dead ends: 6012 [2020-01-16 17:53:29,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:29,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-01-16 17:53:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3120. [2020-01-16 17:53:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:53:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15568 transitions. [2020-01-16 17:53:29,370 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15568 transitions. Word has length 31 [2020-01-16 17:53:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:29,370 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15568 transitions. [2020-01-16 17:53:29,371 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15568 transitions. [2020-01-16 17:53:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:29,376 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:29,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:29,376 INFO L426 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:29,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:29,376 INFO L82 PathProgramCache]: Analyzing trace with hash 335239660, now seen corresponding path program 223 times [2020-01-16 17:53:29,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:29,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664299727] [2020-01-16 17:53:29,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:29,896 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:53:30,022 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:30,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664299727] [2020-01-16 17:53:30,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:30,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:30,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343741965] [2020-01-16 17:53:30,032 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:30,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:30,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:30,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:30,033 INFO L87 Difference]: Start difference. First operand 3120 states and 15568 transitions. Second operand 12 states. [2020-01-16 17:53:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:30,331 INFO L93 Difference]: Finished difference Result 6047 states and 26895 transitions. [2020-01-16 17:53:30,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:30,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:30,345 INFO L225 Difference]: With dead ends: 6047 [2020-01-16 17:53:30,346 INFO L226 Difference]: Without dead ends: 6031 [2020-01-16 17:53:30,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-01-16 17:53:30,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3132. [2020-01-16 17:53:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:53:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15601 transitions. [2020-01-16 17:53:30,570 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15601 transitions. Word has length 31 [2020-01-16 17:53:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:30,571 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15601 transitions. [2020-01-16 17:53:30,571 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15601 transitions. [2020-01-16 17:53:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:30,576 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:30,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:30,576 INFO L426 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:30,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:30,576 INFO L82 PathProgramCache]: Analyzing trace with hash -509731792, now seen corresponding path program 224 times [2020-01-16 17:53:30,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:30,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820855780] [2020-01-16 17:53:30,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:31,090 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:31,221 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:31,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820855780] [2020-01-16 17:53:31,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:31,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:31,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349171235] [2020-01-16 17:53:31,231 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:31,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:31,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:31,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:31,231 INFO L87 Difference]: Start difference. First operand 3132 states and 15601 transitions. Second operand 12 states. [2020-01-16 17:53:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:31,581 INFO L93 Difference]: Finished difference Result 6051 states and 26898 transitions. [2020-01-16 17:53:31,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:31,582 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:31,596 INFO L225 Difference]: With dead ends: 6051 [2020-01-16 17:53:31,596 INFO L226 Difference]: Without dead ends: 6026 [2020-01-16 17:53:31,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:31,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-01-16 17:53:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3127. [2020-01-16 17:53:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:53:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15587 transitions. [2020-01-16 17:53:31,817 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15587 transitions. Word has length 31 [2020-01-16 17:53:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:31,817 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15587 transitions. [2020-01-16 17:53:31,817 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15587 transitions. [2020-01-16 17:53:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:31,823 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:31,823 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:31,824 INFO L426 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:31,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1149849666, now seen corresponding path program 225 times [2020-01-16 17:53:31,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:31,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942623375] [2020-01-16 17:53:31,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:32,346 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:32,478 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:53:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:32,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942623375] [2020-01-16 17:53:32,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:32,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:32,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696230304] [2020-01-16 17:53:32,488 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:32,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:32,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:32,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:32,488 INFO L87 Difference]: Start difference. First operand 3127 states and 15587 transitions. Second operand 12 states. [2020-01-16 17:53:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:32,839 INFO L93 Difference]: Finished difference Result 6050 states and 26895 transitions. [2020-01-16 17:53:32,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:32,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:32,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:32,856 INFO L225 Difference]: With dead ends: 6050 [2020-01-16 17:53:32,856 INFO L226 Difference]: Without dead ends: 6034 [2020-01-16 17:53:32,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-01-16 17:53:33,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3133. [2020-01-16 17:53:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:53:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15598 transitions. [2020-01-16 17:53:33,077 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15598 transitions. Word has length 31 [2020-01-16 17:53:33,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:33,077 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15598 transitions. [2020-01-16 17:53:33,077 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15598 transitions. [2020-01-16 17:53:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:33,082 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:33,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:33,083 INFO L426 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:33,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:33,083 INFO L82 PathProgramCache]: Analyzing trace with hash -657253904, now seen corresponding path program 226 times [2020-01-16 17:53:33,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:33,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878899841] [2020-01-16 17:53:33,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:33,620 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-01-16 17:53:33,751 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:53:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:33,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878899841] [2020-01-16 17:53:33,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:33,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:33,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944266291] [2020-01-16 17:53:33,760 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:33,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:33,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:33,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:33,760 INFO L87 Difference]: Start difference. First operand 3133 states and 15598 transitions. Second operand 12 states. [2020-01-16 17:53:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:34,074 INFO L93 Difference]: Finished difference Result 6056 states and 26901 transitions. [2020-01-16 17:53:34,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:34,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:34,090 INFO L225 Difference]: With dead ends: 6056 [2020-01-16 17:53:34,090 INFO L226 Difference]: Without dead ends: 6028 [2020-01-16 17:53:34,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-01-16 17:53:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3127. [2020-01-16 17:53:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:53:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15581 transitions. [2020-01-16 17:53:34,311 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15581 transitions. Word has length 31 [2020-01-16 17:53:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:34,311 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15581 transitions. [2020-01-16 17:53:34,311 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15581 transitions. [2020-01-16 17:53:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:34,316 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:34,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:34,317 INFO L426 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:34,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:34,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1875834942, now seen corresponding path program 227 times [2020-01-16 17:53:34,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:34,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060525159] [2020-01-16 17:53:34,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:34,866 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:34,997 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:35,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-01-16 17:53:35,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060525159] [2020-01-16 17:53:35,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:35,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:35,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050582444] [2020-01-16 17:53:35,006 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:35,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:35,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:35,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:35,007 INFO L87 Difference]: Start difference. First operand 3127 states and 15581 transitions. Second operand 12 states. [2020-01-16 17:53:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:35,374 INFO L93 Difference]: Finished difference Result 6063 states and 26918 transitions. [2020-01-16 17:53:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:35,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:35,391 INFO L225 Difference]: With dead ends: 6063 [2020-01-16 17:53:35,391 INFO L226 Difference]: Without dead ends: 6043 [2020-01-16 17:53:35,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:35,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-01-16 17:53:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3138. [2020-01-16 17:53:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-01-16 17:53:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15601 transitions. [2020-01-16 17:53:35,619 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15601 transitions. Word has length 31 [2020-01-16 17:53:35,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:35,619 INFO L478 AbstractCegarLoop]: Abstraction has 3138 states and 15601 transitions. [2020-01-16 17:53:35,619 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15601 transitions. [2020-01-16 17:53:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:35,624 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:35,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:35,625 INFO L426 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:35,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:35,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1081565140, now seen corresponding path program 228 times [2020-01-16 17:53:35,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:35,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380277307] [2020-01-16 17:53:35,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:36,190 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-01-16 17:53:36,320 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:53:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:36,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380277307] [2020-01-16 17:53:36,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:36,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:36,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901077645] [2020-01-16 17:53:36,329 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:36,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:36,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:36,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:36,330 INFO L87 Difference]: Start difference. First operand 3138 states and 15601 transitions. Second operand 12 states. [2020-01-16 17:53:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:36,652 INFO L93 Difference]: Finished difference Result 6065 states and 26912 transitions. [2020-01-16 17:53:36,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:36,653 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:36,667 INFO L225 Difference]: With dead ends: 6065 [2020-01-16 17:53:36,668 INFO L226 Difference]: Without dead ends: 6025 [2020-01-16 17:53:36,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2020-01-16 17:53:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3120. [2020-01-16 17:53:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:53:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15561 transitions. [2020-01-16 17:53:36,889 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15561 transitions. Word has length 31 [2020-01-16 17:53:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:36,889 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15561 transitions. [2020-01-16 17:53:36,889 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15561 transitions. [2020-01-16 17:53:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:36,894 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:36,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:36,894 INFO L426 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:36,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:36,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1050875668, now seen corresponding path program 229 times [2020-01-16 17:53:36,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:36,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888152866] [2020-01-16 17:53:36,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:37,474 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:37,605 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:53:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:37,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888152866] [2020-01-16 17:53:37,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:37,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:37,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902819384] [2020-01-16 17:53:37,615 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:37,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:37,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:37,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:37,615 INFO L87 Difference]: Start difference. First operand 3120 states and 15561 transitions. Second operand 12 states. [2020-01-16 17:53:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:37,835 INFO L93 Difference]: Finished difference Result 6039 states and 26871 transitions. [2020-01-16 17:53:37,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:37,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:37,850 INFO L225 Difference]: With dead ends: 6039 [2020-01-16 17:53:37,850 INFO L226 Difference]: Without dead ends: 6023 [2020-01-16 17:53:37,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-01-16 17:53:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3131. [2020-01-16 17:53:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:53:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15592 transitions. [2020-01-16 17:53:38,078 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15592 transitions. Word has length 31 [2020-01-16 17:53:38,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:38,078 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15592 transitions. [2020-01-16 17:53:38,078 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15592 transitions. [2020-01-16 17:53:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:38,083 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:38,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:38,083 INFO L426 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:38,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash 709177272, now seen corresponding path program 230 times [2020-01-16 17:53:38,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:38,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422574742] [2020-01-16 17:53:38,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:38,750 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:53:38,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:38,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422574742] [2020-01-16 17:53:38,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:38,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:38,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445829978] [2020-01-16 17:53:38,758 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:38,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:38,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:38,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:38,758 INFO L87 Difference]: Start difference. First operand 3131 states and 15592 transitions. Second operand 12 states. [2020-01-16 17:53:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:38,972 INFO L93 Difference]: Finished difference Result 6041 states and 26870 transitions. [2020-01-16 17:53:38,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:38,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:38,988 INFO L225 Difference]: With dead ends: 6041 [2020-01-16 17:53:38,988 INFO L226 Difference]: Without dead ends: 6018 [2020-01-16 17:53:38,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-01-16 17:53:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3126. [2020-01-16 17:53:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:53:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15578 transitions. [2020-01-16 17:53:39,218 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15578 transitions. Word has length 31 [2020-01-16 17:53:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:39,218 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15578 transitions. [2020-01-16 17:53:39,218 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15578 transitions. [2020-01-16 17:53:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:39,224 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:39,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:39,224 INFO L426 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1687342522, now seen corresponding path program 231 times [2020-01-16 17:53:39,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:39,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690545028] [2020-01-16 17:53:39,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:39,755 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:39,888 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:53:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:39,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690545028] [2020-01-16 17:53:39,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:39,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:39,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491953033] [2020-01-16 17:53:39,897 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:39,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:39,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:39,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:39,898 INFO L87 Difference]: Start difference. First operand 3126 states and 15578 transitions. Second operand 12 states. [2020-01-16 17:53:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:40,114 INFO L93 Difference]: Finished difference Result 6044 states and 26875 transitions. [2020-01-16 17:53:40,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:40,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:40,130 INFO L225 Difference]: With dead ends: 6044 [2020-01-16 17:53:40,130 INFO L226 Difference]: Without dead ends: 6028 [2020-01-16 17:53:40,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:40,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-01-16 17:53:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3132. [2020-01-16 17:53:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:53:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15589 transitions. [2020-01-16 17:53:40,358 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15589 transitions. Word has length 31 [2020-01-16 17:53:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:40,358 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15589 transitions. [2020-01-16 17:53:40,358 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15589 transitions. [2020-01-16 17:53:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:40,364 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:40,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:40,364 INFO L426 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:40,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:40,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1194746760, now seen corresponding path program 232 times [2020-01-16 17:53:40,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:40,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809236901] [2020-01-16 17:53:40,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:40,904 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-01-16 17:53:41,033 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:53:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:41,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809236901] [2020-01-16 17:53:41,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:41,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:41,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481293051] [2020-01-16 17:53:41,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:41,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:41,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:41,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:41,042 INFO L87 Difference]: Start difference. First operand 3132 states and 15589 transitions. Second operand 12 states. [2020-01-16 17:53:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:41,217 INFO L93 Difference]: Finished difference Result 6050 states and 26881 transitions. [2020-01-16 17:53:41,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:41,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:41,232 INFO L225 Difference]: With dead ends: 6050 [2020-01-16 17:53:41,232 INFO L226 Difference]: Without dead ends: 6022 [2020-01-16 17:53:41,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-01-16 17:53:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3126. [2020-01-16 17:53:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:53:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15572 transitions. [2020-01-16 17:53:41,455 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15572 transitions. Word has length 31 [2020-01-16 17:53:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:41,455 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15572 transitions. [2020-01-16 17:53:41,455 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15572 transitions. [2020-01-16 17:53:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:41,460 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:41,460 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:41,460 INFO L426 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:41,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1200223290, now seen corresponding path program 233 times [2020-01-16 17:53:41,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:41,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099911359] [2020-01-16 17:53:41,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:42,009 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-01-16 17:53:42,136 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:53:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:42,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099911359] [2020-01-16 17:53:42,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:42,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:42,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759648397] [2020-01-16 17:53:42,146 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:42,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:42,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:42,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:42,146 INFO L87 Difference]: Start difference. First operand 3126 states and 15572 transitions. Second operand 12 states. [2020-01-16 17:53:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:42,387 INFO L93 Difference]: Finished difference Result 6050 states and 26883 transitions. [2020-01-16 17:53:42,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:42,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:42,403 INFO L225 Difference]: With dead ends: 6050 [2020-01-16 17:53:42,403 INFO L226 Difference]: Without dead ends: 6032 [2020-01-16 17:53:42,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-01-16 17:53:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3134. [2020-01-16 17:53:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:53:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15587 transitions. [2020-01-16 17:53:42,628 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15587 transitions. Word has length 31 [2020-01-16 17:53:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:42,628 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15587 transitions. [2020-01-16 17:53:42,628 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15587 transitions. [2020-01-16 17:53:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:42,633 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:42,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:42,633 INFO L426 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:42,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:42,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1827286828, now seen corresponding path program 234 times [2020-01-16 17:53:42,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:42,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582032257] [2020-01-16 17:53:42,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:43,174 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-01-16 17:53:43,301 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:53:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:43,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582032257] [2020-01-16 17:53:43,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:43,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:43,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129618983] [2020-01-16 17:53:43,310 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:43,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:43,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:43,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:43,310 INFO L87 Difference]: Start difference. First operand 3134 states and 15587 transitions. Second operand 12 states. [2020-01-16 17:53:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:43,525 INFO L93 Difference]: Finished difference Result 6054 states and 26883 transitions. [2020-01-16 17:53:43,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:43,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:43,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:43,540 INFO L225 Difference]: With dead ends: 6054 [2020-01-16 17:53:43,540 INFO L226 Difference]: Without dead ends: 6018 [2020-01-16 17:53:43,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-01-16 17:53:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3120. [2020-01-16 17:53:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:53:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15555 transitions. [2020-01-16 17:53:43,766 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15555 transitions. Word has length 31 [2020-01-16 17:53:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:43,766 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15555 transitions. [2020-01-16 17:53:43,766 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15555 transitions. [2020-01-16 17:53:43,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:43,771 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:43,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:43,771 INFO L426 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:43,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:43,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1706062512, now seen corresponding path program 235 times [2020-01-16 17:53:43,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:43,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237847745] [2020-01-16 17:53:43,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:44,319 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:44,447 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:44,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237847745] [2020-01-16 17:53:44,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:44,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:44,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905061264] [2020-01-16 17:53:44,457 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:44,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:44,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:44,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:44,457 INFO L87 Difference]: Start difference. First operand 3120 states and 15555 transitions. Second operand 12 states. [2020-01-16 17:53:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:44,683 INFO L93 Difference]: Finished difference Result 6063 states and 26924 transitions. [2020-01-16 17:53:44,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:44,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:44,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:44,699 INFO L225 Difference]: With dead ends: 6063 [2020-01-16 17:53:44,699 INFO L226 Difference]: Without dead ends: 6043 [2020-01-16 17:53:44,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-01-16 17:53:44,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3136. [2020-01-16 17:53:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-01-16 17:53:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15600 transitions. [2020-01-16 17:53:44,965 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15600 transitions. Word has length 31 [2020-01-16 17:53:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:44,965 INFO L478 AbstractCegarLoop]: Abstraction has 3136 states and 15600 transitions. [2020-01-16 17:53:44,965 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:44,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15600 transitions. [2020-01-16 17:53:44,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:44,970 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:44,970 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:44,970 INFO L426 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:44,971 INFO L82 PathProgramCache]: Analyzing trace with hash 16119608, now seen corresponding path program 236 times [2020-01-16 17:53:44,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:44,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26635982] [2020-01-16 17:53:44,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:45,518 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:53:45,647 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:45,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-01-16 17:53:45,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26635982] [2020-01-16 17:53:45,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:45,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:45,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724311671] [2020-01-16 17:53:45,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:45,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:45,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:45,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:45,658 INFO L87 Difference]: Start difference. First operand 3136 states and 15600 transitions. Second operand 12 states. [2020-01-16 17:53:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:45,902 INFO L93 Difference]: Finished difference Result 6061 states and 26913 transitions. [2020-01-16 17:53:45,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:45,903 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:45,918 INFO L225 Difference]: With dead ends: 6061 [2020-01-16 17:53:45,918 INFO L226 Difference]: Without dead ends: 6036 [2020-01-16 17:53:45,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-01-16 17:53:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3129. [2020-01-16 17:53:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:53:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15580 transitions. [2020-01-16 17:53:46,146 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15580 transitions. Word has length 31 [2020-01-16 17:53:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:46,146 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15580 transitions. [2020-01-16 17:53:46,146 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15580 transitions. [2020-01-16 17:53:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:46,151 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:46,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:46,151 INFO L426 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:46,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1069595658, now seen corresponding path program 237 times [2020-01-16 17:53:46,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:46,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421087444] [2020-01-16 17:53:46,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:46,696 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:46,829 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:53:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:46,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421087444] [2020-01-16 17:53:46,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:46,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:46,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174226461] [2020-01-16 17:53:46,839 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:46,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:46,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:46,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:46,840 INFO L87 Difference]: Start difference. First operand 3129 states and 15580 transitions. Second operand 12 states. [2020-01-16 17:53:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:47,121 INFO L93 Difference]: Finished difference Result 6071 states and 26933 transitions. [2020-01-16 17:53:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:47,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:47,136 INFO L225 Difference]: With dead ends: 6071 [2020-01-16 17:53:47,136 INFO L226 Difference]: Without dead ends: 6051 [2020-01-16 17:53:47,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:47,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-01-16 17:53:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3140. [2020-01-16 17:53:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-01-16 17:53:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15600 transitions. [2020-01-16 17:53:47,359 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15600 transitions. Word has length 31 [2020-01-16 17:53:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:47,359 INFO L478 AbstractCegarLoop]: Abstraction has 3140 states and 15600 transitions. [2020-01-16 17:53:47,359 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:47,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15600 transitions. [2020-01-16 17:53:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:47,364 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:47,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:47,364 INFO L426 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1887804424, now seen corresponding path program 238 times [2020-01-16 17:53:47,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:47,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902455485] [2020-01-16 17:53:47,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:47,916 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-01-16 17:53:48,049 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:53:48,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-01-16 17:53:48,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902455485] [2020-01-16 17:53:48,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:48,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:48,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564963812] [2020-01-16 17:53:48,058 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:48,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:48,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:48,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:48,059 INFO L87 Difference]: Start difference. First operand 3140 states and 15600 transitions. Second operand 12 states. [2020-01-16 17:53:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:48,248 INFO L93 Difference]: Finished difference Result 6073 states and 26927 transitions. [2020-01-16 17:53:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:48,248 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:48,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:48,263 INFO L225 Difference]: With dead ends: 6073 [2020-01-16 17:53:48,263 INFO L226 Difference]: Without dead ends: 6040 [2020-01-16 17:53:48,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:48,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-01-16 17:53:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3129. [2020-01-16 17:53:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:53:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15571 transitions. [2020-01-16 17:53:48,489 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15571 transitions. Word has length 31 [2020-01-16 17:53:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:48,490 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15571 transitions. [2020-01-16 17:53:48,490 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15571 transitions. [2020-01-16 17:53:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:48,495 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:48,495 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:48,495 INFO L426 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:48,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:48,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1468969718, now seen corresponding path program 239 times [2020-01-16 17:53:48,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:48,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140990050] [2020-01-16 17:53:48,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:49,045 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-01-16 17:53:49,177 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:53:49,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-01-16 17:53:49,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140990050] [2020-01-16 17:53:49,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:49,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:49,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461164460] [2020-01-16 17:53:49,186 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:49,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:49,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:49,187 INFO L87 Difference]: Start difference. First operand 3129 states and 15571 transitions. Second operand 12 states. [2020-01-16 17:53:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:49,414 INFO L93 Difference]: Finished difference Result 6064 states and 26909 transitions. [2020-01-16 17:53:49,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:49,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:49,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:49,429 INFO L225 Difference]: With dead ends: 6064 [2020-01-16 17:53:49,429 INFO L226 Difference]: Without dead ends: 6046 [2020-01-16 17:53:49,429 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-01-16 17:53:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3137. [2020-01-16 17:53:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-01-16 17:53:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15586 transitions. [2020-01-16 17:53:49,650 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15586 transitions. Word has length 31 [2020-01-16 17:53:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:49,650 INFO L478 AbstractCegarLoop]: Abstraction has 3137 states and 15586 transitions. [2020-01-16 17:53:49,650 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15586 transitions. [2020-01-16 17:53:49,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:49,655 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:49,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:49,655 INFO L426 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:49,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1558540400, now seen corresponding path program 240 times [2020-01-16 17:53:49,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:49,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473838642] [2020-01-16 17:53:49,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:50,211 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-01-16 17:53:50,341 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-01-16 17:53:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:50,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473838642] [2020-01-16 17:53:50,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:50,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:50,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522497889] [2020-01-16 17:53:50,350 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:50,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:50,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:50,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:50,351 INFO L87 Difference]: Start difference. First operand 3137 states and 15586 transitions. Second operand 12 states. [2020-01-16 17:53:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:50,538 INFO L93 Difference]: Finished difference Result 6068 states and 26909 transitions. [2020-01-16 17:53:50,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:50,538 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:50,552 INFO L225 Difference]: With dead ends: 6068 [2020-01-16 17:53:50,552 INFO L226 Difference]: Without dead ends: 6013 [2020-01-16 17:53:50,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-01-16 17:53:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3104. [2020-01-16 17:53:50,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-01-16 17:53:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15518 transitions. [2020-01-16 17:53:50,773 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15518 transitions. Word has length 31 [2020-01-16 17:53:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:50,774 INFO L478 AbstractCegarLoop]: Abstraction has 3104 states and 15518 transitions. [2020-01-16 17:53:50,774 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15518 transitions. [2020-01-16 17:53:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:50,779 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:50,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:50,779 INFO L426 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:50,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash 316275074, now seen corresponding path program 241 times [2020-01-16 17:53:50,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:50,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888273215] [2020-01-16 17:53:50,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:51,314 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:53:51,443 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:53:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:51,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888273215] [2020-01-16 17:53:51,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:51,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:51,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713653169] [2020-01-16 17:53:51,454 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:51,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:51,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:51,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:51,455 INFO L87 Difference]: Start difference. First operand 3104 states and 15518 transitions. Second operand 12 states. [2020-01-16 17:53:51,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:51,688 INFO L93 Difference]: Finished difference Result 5976 states and 26732 transitions. [2020-01-16 17:53:51,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:51,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:51,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:51,702 INFO L225 Difference]: With dead ends: 5976 [2020-01-16 17:53:51,703 INFO L226 Difference]: Without dead ends: 5957 [2020-01-16 17:53:51,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-01-16 17:53:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3124. [2020-01-16 17:53:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:53:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15599 transitions. [2020-01-16 17:53:51,927 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15599 transitions. Word has length 31 [2020-01-16 17:53:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:51,928 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15599 transitions. [2020-01-16 17:53:51,928 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15599 transitions. [2020-01-16 17:53:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:51,933 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53: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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:51,933 INFO L426 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:51,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:51,933 INFO L82 PathProgramCache]: Analyzing trace with hash -106210652, now seen corresponding path program 242 times [2020-01-16 17:53:51,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:51,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528168418] [2020-01-16 17:53:51,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:52,510 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:53:52,638 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:53:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:52,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528168418] [2020-01-16 17:53:52,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:52,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:52,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217443713] [2020-01-16 17:53:52,649 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:52,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:52,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:52,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:52,649 INFO L87 Difference]: Start difference. First operand 3124 states and 15599 transitions. Second operand 12 states. [2020-01-16 17:53:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:52,877 INFO L93 Difference]: Finished difference Result 5973 states and 26721 transitions. [2020-01-16 17:53:52,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:52,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:52,892 INFO L225 Difference]: With dead ends: 5973 [2020-01-16 17:53:52,892 INFO L226 Difference]: Without dead ends: 5952 [2020-01-16 17:53:52,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:53,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-01-16 17:53:53,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3119. [2020-01-16 17:53:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:53:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15585 transitions. [2020-01-16 17:53:53,119 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15585 transitions. Word has length 31 [2020-01-16 17:53:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:53,119 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15585 transitions. [2020-01-16 17:53:53,119 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15585 transitions. [2020-01-16 17:53:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:53,124 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:53,125 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:53,125 INFO L426 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash -108036162, now seen corresponding path program 243 times [2020-01-16 17:53:53,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:53,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513005665] [2020-01-16 17:53:53,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:53,665 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:53:53,797 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:53:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:53,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513005665] [2020-01-16 17:53:53,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:53,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:53,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132445573] [2020-01-16 17:53:53,807 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:53,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:53,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:53,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:53,807 INFO L87 Difference]: Start difference. First operand 3119 states and 15585 transitions. Second operand 12 states. [2020-01-16 17:53:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:54,031 INFO L93 Difference]: Finished difference Result 5983 states and 26744 transitions. [2020-01-16 17:53:54,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:54,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:54,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:54,047 INFO L225 Difference]: With dead ends: 5983 [2020-01-16 17:53:54,047 INFO L226 Difference]: Without dead ends: 5964 [2020-01-16 17:53:54,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:54,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-01-16 17:53:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3127. [2020-01-16 17:53:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:53:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15600 transitions. [2020-01-16 17:53:54,272 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15600 transitions. Word has length 31 [2020-01-16 17:53:54,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:54,272 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15600 transitions. [2020-01-16 17:53:54,272 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15600 transitions. [2020-01-16 17:53:54,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:54,277 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:54,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:54,278 INFO L426 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:54,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1375493340, now seen corresponding path program 244 times [2020-01-16 17:53:54,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:54,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587835261] [2020-01-16 17:53:54,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:54,819 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:54,946 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:53:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:54,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587835261] [2020-01-16 17:53:54,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:54,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:54,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656259419] [2020-01-16 17:53:54,956 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:54,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:54,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:54,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:54,956 INFO L87 Difference]: Start difference. First operand 3127 states and 15600 transitions. Second operand 12 states. [2020-01-16 17:53:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:55,222 INFO L93 Difference]: Finished difference Result 5984 states and 26738 transitions. [2020-01-16 17:53:55,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:55,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:55,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:55,237 INFO L225 Difference]: With dead ends: 5984 [2020-01-16 17:53:55,237 INFO L226 Difference]: Without dead ends: 5956 [2020-01-16 17:53:55,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-01-16 17:53:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3119. [2020-01-16 17:53:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:53:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15580 transitions. [2020-01-16 17:53:55,459 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15580 transitions. Word has length 31 [2020-01-16 17:53:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:55,459 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15580 transitions. [2020-01-16 17:53:55,459 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15580 transitions. [2020-01-16 17:53:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:55,464 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:55,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:55,464 INFO L426 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:55,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash -742677506, now seen corresponding path program 245 times [2020-01-16 17:53:55,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:55,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243768276] [2020-01-16 17:53:55,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:55,985 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:53:56,115 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:53:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:56,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243768276] [2020-01-16 17:53:56,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:56,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:56,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71789097] [2020-01-16 17:53:56,125 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:56,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:56,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:56,126 INFO L87 Difference]: Start difference. First operand 3119 states and 15580 transitions. Second operand 12 states. [2020-01-16 17:53:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:56,417 INFO L93 Difference]: Finished difference Result 5974 states and 26718 transitions. [2020-01-16 17:53:56,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:56,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:56,432 INFO L225 Difference]: With dead ends: 5974 [2020-01-16 17:53:56,432 INFO L226 Difference]: Without dead ends: 5958 [2020-01-16 17:53:56,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:56,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-01-16 17:53:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3124. [2020-01-16 17:53:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:53:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-01-16 17:53:56,658 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-01-16 17:53:56,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:56,658 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-01-16 17:53:56,658 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:56,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-01-16 17:53:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:56,663 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:56,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:56,664 INFO L426 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:56,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:56,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1587648958, now seen corresponding path program 246 times [2020-01-16 17:53:56,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:56,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292797013] [2020-01-16 17:53:56,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:57,189 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:53:57,317 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:53:57,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-01-16 17:53:57,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292797013] [2020-01-16 17:53:57,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:57,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:57,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528633599] [2020-01-16 17:53:57,327 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:57,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:57,327 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-01-16 17:53:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:57,573 INFO L93 Difference]: Finished difference Result 5978 states and 26721 transitions. [2020-01-16 17:53:57,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:57,574 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:57,589 INFO L225 Difference]: With dead ends: 5978 [2020-01-16 17:53:57,589 INFO L226 Difference]: Without dead ends: 5948 [2020-01-16 17:53:57,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-01-16 17:53:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3114. [2020-01-16 17:53:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-01-16 17:53:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15566 transitions. [2020-01-16 17:53:57,810 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15566 transitions. Word has length 31 [2020-01-16 17:53:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:57,810 INFO L478 AbstractCegarLoop]: Abstraction has 3114 states and 15566 transitions. [2020-01-16 17:53:57,810 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15566 transitions. [2020-01-16 17:53:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:57,817 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:57,817 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:57,817 INFO L426 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:57,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:57,818 INFO L82 PathProgramCache]: Analyzing trace with hash 47528646, now seen corresponding path program 247 times [2020-01-16 17:53:57,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:57,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438124120] [2020-01-16 17:53:57,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:58,469 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:53:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:53:58,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438124120] [2020-01-16 17:53:58,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:58,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:58,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392449008] [2020-01-16 17:53:58,479 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:58,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:58,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:58,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:58,480 INFO L87 Difference]: Start difference. First operand 3114 states and 15566 transitions. Second operand 12 states. [2020-01-16 17:53:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:58,720 INFO L93 Difference]: Finished difference Result 5971 states and 26715 transitions. [2020-01-16 17:53:58,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:58,722 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:58,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:58,737 INFO L225 Difference]: With dead ends: 5971 [2020-01-16 17:53:58,737 INFO L226 Difference]: Without dead ends: 5952 [2020-01-16 17:53:58,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:53:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-01-16 17:53:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3124. [2020-01-16 17:53:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:53:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15594 transitions. [2020-01-16 17:53:58,964 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15594 transitions. Word has length 31 [2020-01-16 17:53:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:53:58,964 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15594 transitions. [2020-01-16 17:53:58,964 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:53:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15594 transitions. [2020-01-16 17:53:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:53:58,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:53:58,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:53:58,970 INFO L426 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:53:58,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:53:58,970 INFO L82 PathProgramCache]: Analyzing trace with hash -374957080, now seen corresponding path program 248 times [2020-01-16 17:53:58,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:53:58,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344548153] [2020-01-16 17:53:58,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:53:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:53:59,491 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:53:59,627 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:53:59,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-01-16 17:53:59,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344548153] [2020-01-16 17:53:59,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:53:59,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:53:59,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504821786] [2020-01-16 17:53:59,636 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:53:59,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:53:59,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:53:59,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:53:59,637 INFO L87 Difference]: Start difference. First operand 3124 states and 15594 transitions. Second operand 12 states. [2020-01-16 17:53:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:53:59,954 INFO L93 Difference]: Finished difference Result 5968 states and 26704 transitions. [2020-01-16 17:53:59,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:53:59,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:53:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:53:59,969 INFO L225 Difference]: With dead ends: 5968 [2020-01-16 17:53:59,969 INFO L226 Difference]: Without dead ends: 5947 [2020-01-16 17:53:59,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-01-16 17:54:00,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3119. [2020-01-16 17:54:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15580 transitions. [2020-01-16 17:54:00,246 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15580 transitions. Word has length 31 [2020-01-16 17:54:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:00,246 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15580 transitions. [2020-01-16 17:54:00,246 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15580 transitions. [2020-01-16 17:54:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:00,251 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:00,251 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:00,251 INFO L426 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:00,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:00,252 INFO L82 PathProgramCache]: Analyzing trace with hash -801093826, now seen corresponding path program 249 times [2020-01-16 17:54:00,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:00,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615769336] [2020-01-16 17:54:00,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:00,771 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:54:00,902 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:00,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615769336] [2020-01-16 17:54:00,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:00,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:00,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190725991] [2020-01-16 17:54:00,911 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:00,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:00,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:00,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:00,911 INFO L87 Difference]: Start difference. First operand 3119 states and 15580 transitions. Second operand 12 states. [2020-01-16 17:54:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:01,152 INFO L93 Difference]: Finished difference Result 5973 states and 26715 transitions. [2020-01-16 17:54:01,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:01,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:01,167 INFO L225 Difference]: With dead ends: 5973 [2020-01-16 17:54:01,168 INFO L226 Difference]: Without dead ends: 5954 [2020-01-16 17:54:01,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-01-16 17:54:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3125. [2020-01-16 17:54:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:54:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15591 transitions. [2020-01-16 17:54:01,393 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15591 transitions. Word has length 31 [2020-01-16 17:54:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:01,393 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15591 transitions. [2020-01-16 17:54:01,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15591 transitions. [2020-01-16 17:54:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:01,398 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:01,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:01,399 INFO L426 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:01,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:01,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1381444840, now seen corresponding path program 250 times [2020-01-16 17:54:01,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:01,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659737204] [2020-01-16 17:54:01,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:01,924 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:54:02,055 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:02,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659737204] [2020-01-16 17:54:02,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:02,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:02,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068061482] [2020-01-16 17:54:02,066 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:02,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:02,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:02,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:02,066 INFO L87 Difference]: Start difference. First operand 3125 states and 15591 transitions. Second operand 12 states. [2020-01-16 17:54:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:02,291 INFO L93 Difference]: Finished difference Result 5971 states and 26705 transitions. [2020-01-16 17:54:02,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:02,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:02,307 INFO L225 Difference]: With dead ends: 5971 [2020-01-16 17:54:02,307 INFO L226 Difference]: Without dead ends: 5948 [2020-01-16 17:54:02,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:02,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-01-16 17:54:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3119. [2020-01-16 17:54:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-01-16 17:54:02,533 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-01-16 17:54:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:02,533 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-01-16 17:54:02,533 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-01-16 17:54:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:02,538 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:02,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:02,539 INFO L426 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:02,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1435735170, now seen corresponding path program 251 times [2020-01-16 17:54:02,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:02,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368598917] [2020-01-16 17:54:02,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:03,083 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:54:03,217 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:03,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368598917] [2020-01-16 17:54:03,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:03,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:03,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131947384] [2020-01-16 17:54:03,226 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:03,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:03,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:03,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:03,227 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-01-16 17:54:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:03,451 INFO L93 Difference]: Finished difference Result 5966 states and 26695 transitions. [2020-01-16 17:54:03,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:03,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:03,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:03,466 INFO L225 Difference]: With dead ends: 5966 [2020-01-16 17:54:03,466 INFO L226 Difference]: Without dead ends: 5950 [2020-01-16 17:54:03,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-01-16 17:54:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3124. [2020-01-16 17:54:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:54:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-01-16 17:54:03,689 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-01-16 17:54:03,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:03,689 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-01-16 17:54:03,689 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-01-16 17:54:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:03,695 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:03,695 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:03,695 INFO L426 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:03,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:03,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1169289222, now seen corresponding path program 252 times [2020-01-16 17:54:03,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:03,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200522141] [2020-01-16 17:54:03,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:04,238 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:54:04,369 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:04,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-01-16 17:54:04,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200522141] [2020-01-16 17:54:04,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:04,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:04,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059083021] [2020-01-16 17:54:04,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:04,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:04,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:04,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:04,379 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-01-16 17:54:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:04,612 INFO L93 Difference]: Finished difference Result 5967 states and 26692 transitions. [2020-01-16 17:54:04,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:04,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:04,628 INFO L225 Difference]: With dead ends: 5967 [2020-01-16 17:54:04,628 INFO L226 Difference]: Without dead ends: 5940 [2020-01-16 17:54:04,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2020-01-16 17:54:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3114. [2020-01-16 17:54:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-01-16 17:54:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15561 transitions. [2020-01-16 17:54:04,856 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15561 transitions. Word has length 31 [2020-01-16 17:54:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:04,857 INFO L478 AbstractCegarLoop]: Abstraction has 3114 states and 15561 transitions. [2020-01-16 17:54:04,857 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15561 transitions. [2020-01-16 17:54:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:04,862 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:04,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:04,862 INFO L426 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash -645529018, now seen corresponding path program 253 times [2020-01-16 17:54:04,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:04,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303279349] [2020-01-16 17:54:04,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:05,406 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:54:05,539 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:05,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303279349] [2020-01-16 17:54:05,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:05,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:05,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634348494] [2020-01-16 17:54:05,549 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:05,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:05,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:05,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:05,549 INFO L87 Difference]: Start difference. First operand 3114 states and 15561 transitions. Second operand 12 states. [2020-01-16 17:54:05,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:05,783 INFO L93 Difference]: Finished difference Result 5987 states and 26751 transitions. [2020-01-16 17:54:05,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:05,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:05,799 INFO L225 Difference]: With dead ends: 5987 [2020-01-16 17:54:05,799 INFO L226 Difference]: Without dead ends: 5968 [2020-01-16 17:54:05,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-01-16 17:54:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3128. [2020-01-16 17:54:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:54:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15599 transitions. [2020-01-16 17:54:06,025 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15599 transitions. Word has length 31 [2020-01-16 17:54:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:06,025 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15599 transitions. [2020-01-16 17:54:06,025 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15599 transitions. [2020-01-16 17:54:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:06,030 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54: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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:06,030 INFO L426 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:06,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:06,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1912986196, now seen corresponding path program 254 times [2020-01-16 17:54:06,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:06,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044290196] [2020-01-16 17:54:06,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:06,705 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:06,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044290196] [2020-01-16 17:54:06,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:06,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:06,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228219785] [2020-01-16 17:54:06,715 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:06,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:06,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:06,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:06,716 INFO L87 Difference]: Start difference. First operand 3128 states and 15599 transitions. Second operand 12 states. [2020-01-16 17:54:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:06,952 INFO L93 Difference]: Finished difference Result 5988 states and 26745 transitions. [2020-01-16 17:54:06,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:06,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:06,967 INFO L225 Difference]: With dead ends: 5988 [2020-01-16 17:54:06,967 INFO L226 Difference]: Without dead ends: 5960 [2020-01-16 17:54:06,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-01-16 17:54:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3120. [2020-01-16 17:54:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:54:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15578 transitions. [2020-01-16 17:54:07,191 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15578 transitions. Word has length 31 [2020-01-16 17:54:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:07,191 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15578 transitions. [2020-01-16 17:54:07,191 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15578 transitions. [2020-01-16 17:54:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:07,197 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:07,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:07,197 INFO L426 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:07,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:07,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1069840254, now seen corresponding path program 255 times [2020-01-16 17:54:07,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:07,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844242789] [2020-01-16 17:54:07,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:07,719 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:54:07,846 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:07,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-01-16 17:54:07,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844242789] [2020-01-16 17:54:07,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:07,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:07,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498752356] [2020-01-16 17:54:07,856 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:07,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:07,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:07,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:07,856 INFO L87 Difference]: Start difference. First operand 3120 states and 15578 transitions. Second operand 12 states. [2020-01-16 17:54:08,134 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2020-01-16 17:54:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:08,153 INFO L93 Difference]: Finished difference Result 5982 states and 26733 transitions. [2020-01-16 17:54:08,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:08,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:08,168 INFO L225 Difference]: With dead ends: 5982 [2020-01-16 17:54:08,168 INFO L226 Difference]: Without dead ends: 5963 [2020-01-16 17:54:08,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2020-01-16 17:54:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 3126. [2020-01-16 17:54:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:54:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15589 transitions. [2020-01-16 17:54:08,389 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15589 transitions. Word has length 31 [2020-01-16 17:54:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:08,389 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15589 transitions. [2020-01-16 17:54:08,389 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15589 transitions. [2020-01-16 17:54:08,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:08,394 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:08,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:08,394 INFO L426 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:08,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:08,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1112698412, now seen corresponding path program 256 times [2020-01-16 17:54:08,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:08,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346589560] [2020-01-16 17:54:08,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:09,035 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:09,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346589560] [2020-01-16 17:54:09,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:09,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:09,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75008955] [2020-01-16 17:54:09,046 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:09,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:09,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:09,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:09,046 INFO L87 Difference]: Start difference. First operand 3126 states and 15589 transitions. Second operand 12 states. [2020-01-16 17:54:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:09,288 INFO L93 Difference]: Finished difference Result 5980 states and 26723 transitions. [2020-01-16 17:54:09,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:09,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:09,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:09,303 INFO L225 Difference]: With dead ends: 5980 [2020-01-16 17:54:09,303 INFO L226 Difference]: Without dead ends: 5957 [2020-01-16 17:54:09,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-01-16 17:54:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3120. [2020-01-16 17:54:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:54:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15572 transitions. [2020-01-16 17:54:09,529 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15572 transitions. Word has length 31 [2020-01-16 17:54:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:09,529 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15572 transitions. [2020-01-16 17:54:09,529 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15572 transitions. [2020-01-16 17:54:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:09,534 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:09,535 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:09,535 INFO L426 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:09,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:09,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1321203010, now seen corresponding path program 257 times [2020-01-16 17:54:09,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:09,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735493368] [2020-01-16 17:54:09,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:10,067 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:10,200 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:10,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735493368] [2020-01-16 17:54:10,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:10,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:10,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330369519] [2020-01-16 17:54:10,209 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:10,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:10,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:10,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:10,209 INFO L87 Difference]: Start difference. First operand 3120 states and 15572 transitions. Second operand 12 states. [2020-01-16 17:54:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:10,474 INFO L93 Difference]: Finished difference Result 5984 states and 26731 transitions. [2020-01-16 17:54:10,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:10,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:10,489 INFO L225 Difference]: With dead ends: 5984 [2020-01-16 17:54:10,489 INFO L226 Difference]: Without dead ends: 5964 [2020-01-16 17:54:10,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-01-16 17:54:10,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3126. [2020-01-16 17:54:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:54:10,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15583 transitions. [2020-01-16 17:54:10,710 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15583 transitions. Word has length 31 [2020-01-16 17:54:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:10,711 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15583 transitions. [2020-01-16 17:54:10,711 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15583 transitions. [2020-01-16 17:54:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:10,716 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:10,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:10,716 INFO L426 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:10,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:10,716 INFO L82 PathProgramCache]: Analyzing trace with hash 476231558, now seen corresponding path program 258 times [2020-01-16 17:54:10,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:10,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150655943] [2020-01-16 17:54:10,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:11,242 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:54:11,372 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:11,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150655943] [2020-01-16 17:54:11,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:11,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:11,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629602669] [2020-01-16 17:54:11,382 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:11,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:11,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:11,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:11,382 INFO L87 Difference]: Start difference. First operand 3126 states and 15583 transitions. Second operand 12 states. [2020-01-16 17:54:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:11,641 INFO L93 Difference]: Finished difference Result 5981 states and 26719 transitions. [2020-01-16 17:54:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:11,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:11,656 INFO L225 Difference]: With dead ends: 5981 [2020-01-16 17:54:11,656 INFO L226 Difference]: Without dead ends: 5952 [2020-01-16 17:54:11,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-01-16 17:54:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3114. [2020-01-16 17:54:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-01-16 17:54:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15556 transitions. [2020-01-16 17:54:11,877 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15556 transitions. Word has length 31 [2020-01-16 17:54:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:11,878 INFO L478 AbstractCegarLoop]: Abstraction has 3114 states and 15556 transitions. [2020-01-16 17:54:11,878 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15556 transitions. [2020-01-16 17:54:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:11,883 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:11,883 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:11,883 INFO L426 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:11,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:11,883 INFO L82 PathProgramCache]: Analyzing trace with hash 732940072, now seen corresponding path program 259 times [2020-01-16 17:54:11,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:11,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589239605] [2020-01-16 17:54:11,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:12,406 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:12,535 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:54:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:12,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589239605] [2020-01-16 17:54:12,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:12,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:12,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101301603] [2020-01-16 17:54:12,544 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:12,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:12,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:12,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:12,545 INFO L87 Difference]: Start difference. First operand 3114 states and 15556 transitions. Second operand 12 states. [2020-01-16 17:54:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:12,778 INFO L93 Difference]: Finished difference Result 5970 states and 26703 transitions. [2020-01-16 17:54:12,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:12,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:12,794 INFO L225 Difference]: With dead ends: 5970 [2020-01-16 17:54:12,794 INFO L226 Difference]: Without dead ends: 5954 [2020-01-16 17:54:12,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:12,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-01-16 17:54:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3124. [2020-01-16 17:54:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:54:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-01-16 17:54:13,020 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-01-16 17:54:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:13,020 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-01-16 17:54:13,020 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-01-16 17:54:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:13,025 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:13,025 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:13,025 INFO L426 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:13,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:13,026 INFO L82 PathProgramCache]: Analyzing trace with hash -112031380, now seen corresponding path program 260 times [2020-01-16 17:54:13,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:13,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7123189] [2020-01-16 17:54:13,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:13,559 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:54:13,690 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:54:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:13,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7123189] [2020-01-16 17:54:13,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:13,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:13,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20919755] [2020-01-16 17:54:13,699 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:13,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:13,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:13,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:13,699 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-01-16 17:54:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:13,994 INFO L93 Difference]: Finished difference Result 5974 states and 26706 transitions. [2020-01-16 17:54:13,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:13,995 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:13,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:14,009 INFO L225 Difference]: With dead ends: 5974 [2020-01-16 17:54:14,009 INFO L226 Difference]: Without dead ends: 5949 [2020-01-16 17:54:14,009 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-01-16 17:54:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3119. [2020-01-16 17:54:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-01-16 17:54:14,236 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-01-16 17:54:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:14,236 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-01-16 17:54:14,236 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-01-16 17:54:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:14,242 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:14,242 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:14,242 INFO L426 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:14,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:14,242 INFO L82 PathProgramCache]: Analyzing trace with hash 308628836, now seen corresponding path program 261 times [2020-01-16 17:54:14,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:14,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81045090] [2020-01-16 17:54:14,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:14,779 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:14,913 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:54:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:14,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81045090] [2020-01-16 17:54:14,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:14,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:14,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917261043] [2020-01-16 17:54:14,923 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:14,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:14,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:14,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:14,923 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-01-16 17:54:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:15,221 INFO L93 Difference]: Finished difference Result 5967 states and 26692 transitions. [2020-01-16 17:54:15,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:15,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:15,235 INFO L225 Difference]: With dead ends: 5967 [2020-01-16 17:54:15,235 INFO L226 Difference]: Without dead ends: 5951 [2020-01-16 17:54:15,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-01-16 17:54:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3124. [2020-01-16 17:54:15,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:54:15,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-01-16 17:54:15,459 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-01-16 17:54:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:15,459 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-01-16 17:54:15,459 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-01-16 17:54:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:15,464 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:15,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:15,465 INFO L426 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:15,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:15,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1381314068, now seen corresponding path program 262 times [2020-01-16 17:54:15,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:15,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767724200] [2020-01-16 17:54:15,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:15,819 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2020-01-16 17:54:16,173 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:16,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767724200] [2020-01-16 17:54:16,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:16,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:16,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628896470] [2020-01-16 17:54:16,183 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:16,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:16,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:16,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:16,184 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-01-16 17:54:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:16,415 INFO L93 Difference]: Finished difference Result 5968 states and 26689 transitions. [2020-01-16 17:54:16,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:16,416 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:16,431 INFO L225 Difference]: With dead ends: 5968 [2020-01-16 17:54:16,431 INFO L226 Difference]: Without dead ends: 5946 [2020-01-16 17:54:16,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:16,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-01-16 17:54:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3119. [2020-01-16 17:54:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-01-16 17:54:16,658 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-01-16 17:54:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:16,659 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-01-16 17:54:16,659 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-01-16 17:54:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:16,664 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:16,664 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:16,664 INFO L426 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:16,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:16,664 INFO L82 PathProgramCache]: Analyzing trace with hash -960653852, now seen corresponding path program 263 times [2020-01-16 17:54:16,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:16,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827443580] [2020-01-16 17:54:16,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:17,195 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:17,329 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:17,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827443580] [2020-01-16 17:54:17,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:17,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:17,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69508620] [2020-01-16 17:54:17,339 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:17,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:17,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:17,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:17,339 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-01-16 17:54:17,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:17,609 INFO L93 Difference]: Finished difference Result 5976 states and 26706 transitions. [2020-01-16 17:54:17,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:17,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:17,623 INFO L225 Difference]: With dead ends: 5976 [2020-01-16 17:54:17,623 INFO L226 Difference]: Without dead ends: 5956 [2020-01-16 17:54:17,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-01-16 17:54:17,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3125. [2020-01-16 17:54:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:54:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-01-16 17:54:17,849 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-01-16 17:54:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:17,849 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-01-16 17:54:17,849 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-01-16 17:54:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:17,854 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:17,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:17,854 INFO L426 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:17,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1805625304, now seen corresponding path program 264 times [2020-01-16 17:54:17,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:17,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179153996] [2020-01-16 17:54:17,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:18,382 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:54:18,514 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:18,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179153996] [2020-01-16 17:54:18,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:18,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:18,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629430150] [2020-01-16 17:54:18,523 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:18,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:18,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:18,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:18,523 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-01-16 17:54:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:18,799 INFO L93 Difference]: Finished difference Result 5973 states and 26694 transitions. [2020-01-16 17:54:18,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:18,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:18,814 INFO L225 Difference]: With dead ends: 5973 [2020-01-16 17:54:18,814 INFO L226 Difference]: Without dead ends: 5940 [2020-01-16 17:54:18,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2020-01-16 17:54:19,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3109. [2020-01-16 17:54:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-01-16 17:54:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15542 transitions. [2020-01-16 17:54:19,041 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15542 transitions. Word has length 31 [2020-01-16 17:54:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:19,041 INFO L478 AbstractCegarLoop]: Abstraction has 3109 states and 15542 transitions. [2020-01-16 17:54:19,041 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15542 transitions. [2020-01-16 17:54:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:19,046 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:19,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:19,046 INFO L426 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:19,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:19,047 INFO L82 PathProgramCache]: Analyzing trace with hash 575070398, now seen corresponding path program 265 times [2020-01-16 17:54:19,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:19,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651376549] [2020-01-16 17:54:19,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:19,581 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:19,712 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:19,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-01-16 17:54:19,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651376549] [2020-01-16 17:54:19,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:19,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:19,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116513716] [2020-01-16 17:54:19,721 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:19,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:19,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:19,721 INFO L87 Difference]: Start difference. First operand 3109 states and 15542 transitions. Second operand 12 states. [2020-01-16 17:54:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:20,023 INFO L93 Difference]: Finished difference Result 5980 states and 26739 transitions. [2020-01-16 17:54:20,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:20,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:20,039 INFO L225 Difference]: With dead ends: 5980 [2020-01-16 17:54:20,039 INFO L226 Difference]: Without dead ends: 5961 [2020-01-16 17:54:20,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2020-01-16 17:54:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 3124. [2020-01-16 17:54:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:54:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15594 transitions. [2020-01-16 17:54:20,263 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15594 transitions. Word has length 31 [2020-01-16 17:54:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:20,264 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15594 transitions. [2020-01-16 17:54:20,264 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15594 transitions. [2020-01-16 17:54:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:20,269 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:20,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:20,269 INFO L426 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:20,269 INFO L82 PathProgramCache]: Analyzing trace with hash 152584672, now seen corresponding path program 266 times [2020-01-16 17:54:20,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:20,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180241863] [2020-01-16 17:54:20,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:20,799 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-01-16 17:54:20,934 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:20,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180241863] [2020-01-16 17:54:20,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:20,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:20,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653395445] [2020-01-16 17:54:20,944 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:20,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:20,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:20,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:20,944 INFO L87 Difference]: Start difference. First operand 3124 states and 15594 transitions. Second operand 12 states. [2020-01-16 17:54:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:21,303 INFO L93 Difference]: Finished difference Result 5977 states and 26728 transitions. [2020-01-16 17:54:21,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:21,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:21,318 INFO L225 Difference]: With dead ends: 5977 [2020-01-16 17:54:21,319 INFO L226 Difference]: Without dead ends: 5956 [2020-01-16 17:54:21,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:21,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-01-16 17:54:21,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3119. [2020-01-16 17:54:21,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15580 transitions. [2020-01-16 17:54:21,540 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15580 transitions. Word has length 31 [2020-01-16 17:54:21,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:21,540 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15580 transitions. [2020-01-16 17:54:21,540 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15580 transitions. [2020-01-16 17:54:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:21,545 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:21,545 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:21,545 INFO L426 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:21,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:21,546 INFO L82 PathProgramCache]: Analyzing trace with hash 150759162, now seen corresponding path program 267 times [2020-01-16 17:54:21,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:21,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923806488] [2020-01-16 17:54:21,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:22,085 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:22,213 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:22,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-01-16 17:54:22,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923806488] [2020-01-16 17:54:22,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:22,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:22,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056119661] [2020-01-16 17:54:22,223 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:22,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:22,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:22,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:22,224 INFO L87 Difference]: Start difference. First operand 3119 states and 15580 transitions. Second operand 12 states. [2020-01-16 17:54:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:22,474 INFO L93 Difference]: Finished difference Result 5987 states and 26751 transitions. [2020-01-16 17:54:22,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:22,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:22,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:22,489 INFO L225 Difference]: With dead ends: 5987 [2020-01-16 17:54:22,489 INFO L226 Difference]: Without dead ends: 5968 [2020-01-16 17:54:22,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-01-16 17:54:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3127. [2020-01-16 17:54:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:54:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15595 transitions. [2020-01-16 17:54:22,711 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15595 transitions. Word has length 31 [2020-01-16 17:54:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:22,711 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15595 transitions. [2020-01-16 17:54:22,711 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15595 transitions. [2020-01-16 17:54:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:22,716 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:22,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:22,717 INFO L426 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:22,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:22,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1116698016, now seen corresponding path program 268 times [2020-01-16 17:54:22,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:22,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027995422] [2020-01-16 17:54:22,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:23,248 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:23,378 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:23,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027995422] [2020-01-16 17:54:23,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:23,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:23,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092057926] [2020-01-16 17:54:23,388 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:23,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:23,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:23,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:23,389 INFO L87 Difference]: Start difference. First operand 3127 states and 15595 transitions. Second operand 12 states. [2020-01-16 17:54:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:23,655 INFO L93 Difference]: Finished difference Result 5988 states and 26745 transitions. [2020-01-16 17:54:23,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:23,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:23,670 INFO L225 Difference]: With dead ends: 5988 [2020-01-16 17:54:23,670 INFO L226 Difference]: Without dead ends: 5960 [2020-01-16 17:54:23,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-01-16 17:54:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3119. [2020-01-16 17:54:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-01-16 17:54:23,940 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-01-16 17:54:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:23,940 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-01-16 17:54:23,940 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-01-16 17:54:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:23,945 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:23,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:23,945 INFO L426 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:23,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:23,946 INFO L82 PathProgramCache]: Analyzing trace with hash -483882182, now seen corresponding path program 269 times [2020-01-16 17:54:23,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:23,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463700494] [2020-01-16 17:54:23,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:24,474 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:54:24,604 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:24,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463700494] [2020-01-16 17:54:24,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:24,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:24,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164188025] [2020-01-16 17:54:24,613 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:24,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:24,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:24,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:24,614 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-01-16 17:54:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:24,870 INFO L93 Difference]: Finished difference Result 5978 states and 26725 transitions. [2020-01-16 17:54:24,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:24,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:24,886 INFO L225 Difference]: With dead ends: 5978 [2020-01-16 17:54:24,886 INFO L226 Difference]: Without dead ends: 5962 [2020-01-16 17:54:24,886 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-01-16 17:54:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3124. [2020-01-16 17:54:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:54:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-01-16 17:54:25,113 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-01-16 17:54:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:25,114 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-01-16 17:54:25,114 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-01-16 17:54:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:25,119 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:25,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:25,119 INFO L426 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:25,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:25,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1328853634, now seen corresponding path program 270 times [2020-01-16 17:54:25,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:25,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091293285] [2020-01-16 17:54:25,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:25,646 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:25,776 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:25,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091293285] [2020-01-16 17:54:25,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:25,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:25,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745582635] [2020-01-16 17:54:25,785 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:25,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:25,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:25,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:25,785 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-01-16 17:54:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:26,044 INFO L93 Difference]: Finished difference Result 5982 states and 26728 transitions. [2020-01-16 17:54:26,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:26,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:26,058 INFO L225 Difference]: With dead ends: 5982 [2020-01-16 17:54:26,058 INFO L226 Difference]: Without dead ends: 5952 [2020-01-16 17:54:26,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-01-16 17:54:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3114. [2020-01-16 17:54:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-01-16 17:54:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15561 transitions. [2020-01-16 17:54:26,284 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15561 transitions. Word has length 31 [2020-01-16 17:54:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:26,284 INFO L478 AbstractCegarLoop]: Abstraction has 3114 states and 15561 transitions. [2020-01-16 17:54:26,284 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15561 transitions. [2020-01-16 17:54:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:26,290 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:26,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:26,290 INFO L426 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:26,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:26,290 INFO L82 PathProgramCache]: Analyzing trace with hash 37577542, now seen corresponding path program 271 times [2020-01-16 17:54:26,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:26,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407376433] [2020-01-16 17:54:26,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:26,815 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:26,944 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:26,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407376433] [2020-01-16 17:54:26,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:26,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:26,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832118044] [2020-01-16 17:54:26,954 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:26,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:26,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:26,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:26,955 INFO L87 Difference]: Start difference. First operand 3114 states and 15561 transitions. Second operand 12 states. [2020-01-16 17:54:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:27,209 INFO L93 Difference]: Finished difference Result 5977 states and 26727 transitions. [2020-01-16 17:54:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:27,209 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:27,223 INFO L225 Difference]: With dead ends: 5977 [2020-01-16 17:54:27,223 INFO L226 Difference]: Without dead ends: 5958 [2020-01-16 17:54:27,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-01-16 17:54:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3124. [2020-01-16 17:54:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:54:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-01-16 17:54:27,446 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-01-16 17:54:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:27,446 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-01-16 17:54:27,446 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-01-16 17:54:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:27,451 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:27,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:27,451 INFO L426 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:27,452 INFO L82 PathProgramCache]: Analyzing trace with hash -384908184, now seen corresponding path program 272 times [2020-01-16 17:54:27,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:27,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506922653] [2020-01-16 17:54:27,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:27,988 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-01-16 17:54:28,116 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:28,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506922653] [2020-01-16 17:54:28,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:28,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:28,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282693449] [2020-01-16 17:54:28,126 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:28,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:28,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:28,126 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-01-16 17:54:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:28,380 INFO L93 Difference]: Finished difference Result 5974 states and 26716 transitions. [2020-01-16 17:54:28,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:28,381 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:28,395 INFO L225 Difference]: With dead ends: 5974 [2020-01-16 17:54:28,395 INFO L226 Difference]: Without dead ends: 5953 [2020-01-16 17:54:28,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2020-01-16 17:54:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 3119. [2020-01-16 17:54:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-01-16 17:54:28,613 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-01-16 17:54:28,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:28,613 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-01-16 17:54:28,613 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-01-16 17:54:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:28,618 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:28,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:28,618 INFO L426 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:28,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:28,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1235356166, now seen corresponding path program 273 times [2020-01-16 17:54:28,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:28,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811210869] [2020-01-16 17:54:28,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:29,160 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:29,287 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:29,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-01-16 17:54:29,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811210869] [2020-01-16 17:54:29,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:29,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:29,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548439400] [2020-01-16 17:54:29,297 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:29,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:29,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:29,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:29,297 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-01-16 17:54:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:29,533 INFO L93 Difference]: Finished difference Result 5981 states and 26732 transitions. [2020-01-16 17:54:29,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:29,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:29,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:29,547 INFO L225 Difference]: With dead ends: 5981 [2020-01-16 17:54:29,548 INFO L226 Difference]: Without dead ends: 5962 [2020-01-16 17:54:29,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-01-16 17:54:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3126. [2020-01-16 17:54:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:54:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15588 transitions. [2020-01-16 17:54:29,770 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15588 transitions. Word has length 31 [2020-01-16 17:54:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:29,771 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15588 transitions. [2020-01-16 17:54:29,771 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15588 transitions. [2020-01-16 17:54:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:29,776 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:29,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:29,776 INFO L426 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:29,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:29,776 INFO L82 PathProgramCache]: Analyzing trace with hash 102211048, now seen corresponding path program 274 times [2020-01-16 17:54:29,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:29,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214679618] [2020-01-16 17:54:29,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:30,311 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:54:30,441 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:30,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-01-16 17:54:30,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214679618] [2020-01-16 17:54:30,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:30,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:30,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001812729] [2020-01-16 17:54:30,450 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:30,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:30,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:30,450 INFO L87 Difference]: Start difference. First operand 3126 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:54:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:30,671 INFO L93 Difference]: Finished difference Result 5980 states and 26723 transitions. [2020-01-16 17:54:30,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:30,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:30,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:30,687 INFO L225 Difference]: With dead ends: 5980 [2020-01-16 17:54:30,687 INFO L226 Difference]: Without dead ends: 5955 [2020-01-16 17:54:30,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:30,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-01-16 17:54:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3119. [2020-01-16 17:54:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-01-16 17:54:30,912 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-01-16 17:54:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:30,912 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-01-16 17:54:30,912 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-01-16 17:54:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:30,918 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:30,918 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:30,918 INFO L426 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:30,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:30,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1869997510, now seen corresponding path program 275 times [2020-01-16 17:54:30,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:30,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972872331] [2020-01-16 17:54:30,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:31,454 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:54:31,582 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:31,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972872331] [2020-01-16 17:54:31,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:31,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:31,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121885345] [2020-01-16 17:54:31,592 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:31,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:31,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:31,592 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-01-16 17:54:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:31,853 INFO L93 Difference]: Finished difference Result 5973 states and 26709 transitions. [2020-01-16 17:54:31,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:31,854 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:31,867 INFO L225 Difference]: With dead ends: 5973 [2020-01-16 17:54:31,867 INFO L226 Difference]: Without dead ends: 5957 [2020-01-16 17:54:31,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-01-16 17:54:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3124. [2020-01-16 17:54:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:54:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-01-16 17:54:32,089 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-01-16 17:54:32,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:32,089 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-01-16 17:54:32,089 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:32,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-01-16 17:54:32,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:32,094 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:32,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:32,094 INFO L426 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:32,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:32,094 INFO L82 PathProgramCache]: Analyzing trace with hash -109944570, now seen corresponding path program 276 times [2020-01-16 17:54:32,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:32,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581840606] [2020-01-16 17:54:32,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:32,730 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:32,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581840606] [2020-01-16 17:54:32,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:32,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:32,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340325154] [2020-01-16 17:54:32,740 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:32,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:32,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:32,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:32,741 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-01-16 17:54:32,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:32,968 INFO L93 Difference]: Finished difference Result 5975 states and 26708 transitions. [2020-01-16 17:54:32,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:32,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:32,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:32,984 INFO L225 Difference]: With dead ends: 5975 [2020-01-16 17:54:32,984 INFO L226 Difference]: Without dead ends: 5947 [2020-01-16 17:54:32,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:33,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-01-16 17:54:33,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3114. [2020-01-16 17:54:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-01-16 17:54:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15556 transitions. [2020-01-16 17:54:33,203 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15556 transitions. Word has length 31 [2020-01-16 17:54:33,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:33,203 INFO L478 AbstractCegarLoop]: Abstraction has 3114 states and 15556 transitions. [2020-01-16 17:54:33,203 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:33,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15556 transitions. [2020-01-16 17:54:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:33,208 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:33,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:33,208 INFO L426 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:33,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:33,208 INFO L82 PathProgramCache]: Analyzing trace with hash -655480122, now seen corresponding path program 277 times [2020-01-16 17:54:33,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:33,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817879418] [2020-01-16 17:54:33,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:33,760 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:33,893 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:33,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-01-16 17:54:33,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817879418] [2020-01-16 17:54:33,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:33,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:33,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824123585] [2020-01-16 17:54:33,904 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:33,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:33,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:33,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:33,904 INFO L87 Difference]: Start difference. First operand 3114 states and 15556 transitions. Second operand 12 states. [2020-01-16 17:54:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:34,133 INFO L93 Difference]: Finished difference Result 5995 states and 26770 transitions. [2020-01-16 17:54:34,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:34,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:34,148 INFO L225 Difference]: With dead ends: 5995 [2020-01-16 17:54:34,149 INFO L226 Difference]: Without dead ends: 5976 [2020-01-16 17:54:34,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-01-16 17:54:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3129. [2020-01-16 17:54:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:54:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15598 transitions. [2020-01-16 17:54:34,370 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15598 transitions. Word has length 31 [2020-01-16 17:54:34,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:34,370 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15598 transitions. [2020-01-16 17:54:34,370 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15598 transitions. [2020-01-16 17:54:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:34,375 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:34,375 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:34,375 INFO L426 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:34,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:34,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1922937300, now seen corresponding path program 278 times [2020-01-16 17:54:34,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:34,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039050384] [2020-01-16 17:54:34,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:34,916 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:35,048 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:35,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039050384] [2020-01-16 17:54:35,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:35,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:35,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470612567] [2020-01-16 17:54:35,057 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:35,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:35,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:35,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:35,058 INFO L87 Difference]: Start difference. First operand 3129 states and 15598 transitions. Second operand 12 states. [2020-01-16 17:54:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:35,356 INFO L93 Difference]: Finished difference Result 5996 states and 26764 transitions. [2020-01-16 17:54:35,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:35,356 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:35,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:35,371 INFO L225 Difference]: With dead ends: 5996 [2020-01-16 17:54:35,371 INFO L226 Difference]: Without dead ends: 5968 [2020-01-16 17:54:35,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-01-16 17:54:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-01-16 17:54:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:54:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15576 transitions. [2020-01-16 17:54:35,594 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15576 transitions. Word has length 31 [2020-01-16 17:54:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:35,594 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15576 transitions. [2020-01-16 17:54:35,594 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15576 transitions. [2020-01-16 17:54:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:35,600 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:35,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:35,600 INFO L426 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:35,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:35,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1504102594, now seen corresponding path program 279 times [2020-01-16 17:54:35,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:35,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368772961] [2020-01-16 17:54:35,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:36,151 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:36,279 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:36,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368772961] [2020-01-16 17:54:36,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:36,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:36,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561433887] [2020-01-16 17:54:36,289 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:36,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:36,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:36,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:36,290 INFO L87 Difference]: Start difference. First operand 3121 states and 15576 transitions. Second operand 12 states. [2020-01-16 17:54:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:36,516 INFO L93 Difference]: Finished difference Result 5992 states and 26756 transitions. [2020-01-16 17:54:36,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:36,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:36,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:36,532 INFO L225 Difference]: With dead ends: 5992 [2020-01-16 17:54:36,532 INFO L226 Difference]: Without dead ends: 5973 [2020-01-16 17:54:36,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-01-16 17:54:36,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3128. [2020-01-16 17:54:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:54:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15589 transitions. [2020-01-16 17:54:36,752 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15589 transitions. Word has length 31 [2020-01-16 17:54:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:36,752 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15589 transitions. [2020-01-16 17:54:36,752 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15589 transitions. [2020-01-16 17:54:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:36,757 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:36,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:36,758 INFO L426 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:36,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:36,758 INFO L82 PathProgramCache]: Analyzing trace with hash -166535380, now seen corresponding path program 280 times [2020-01-16 17:54:36,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:36,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635546873] [2020-01-16 17:54:36,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:37,302 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:54:37,429 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:37,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635546873] [2020-01-16 17:54:37,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:37,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:37,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889189845] [2020-01-16 17:54:37,438 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:37,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:37,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:37,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:37,438 INFO L87 Difference]: Start difference. First operand 3128 states and 15589 transitions. Second operand 12 states. [2020-01-16 17:54:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:37,706 INFO L93 Difference]: Finished difference Result 5991 states and 26747 transitions. [2020-01-16 17:54:37,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:37,706 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:37,720 INFO L225 Difference]: With dead ends: 5991 [2020-01-16 17:54:37,720 INFO L226 Difference]: Without dead ends: 5966 [2020-01-16 17:54:37,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-01-16 17:54:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3121. [2020-01-16 17:54:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:54:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15569 transitions. [2020-01-16 17:54:37,941 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15569 transitions. Word has length 31 [2020-01-16 17:54:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:37,941 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15569 transitions. [2020-01-16 17:54:37,941 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15569 transitions. [2020-01-16 17:54:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:37,946 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:37,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:37,946 INFO L426 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash 886940670, now seen corresponding path program 281 times [2020-01-16 17:54:37,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:37,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132746888] [2020-01-16 17:54:37,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:38,476 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:54:38,602 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:54:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:38,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132746888] [2020-01-16 17:54:38,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:38,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:38,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165986369] [2020-01-16 17:54:38,612 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:38,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:38,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:38,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:38,613 INFO L87 Difference]: Start difference. First operand 3121 states and 15569 transitions. Second operand 12 states. [2020-01-16 17:54:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:38,834 INFO L93 Difference]: Finished difference Result 5994 states and 26753 transitions. [2020-01-16 17:54:38,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:38,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:38,849 INFO L225 Difference]: With dead ends: 5994 [2020-01-16 17:54:38,849 INFO L226 Difference]: Without dead ends: 5974 [2020-01-16 17:54:38,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-01-16 17:54:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3128. [2020-01-16 17:54:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:54:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15582 transitions. [2020-01-16 17:54:39,069 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15582 transitions. Word has length 31 [2020-01-16 17:54:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:39,070 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15582 transitions. [2020-01-16 17:54:39,070 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15582 transitions. [2020-01-16 17:54:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:39,075 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:39,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:39,075 INFO L426 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:39,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:39,075 INFO L82 PathProgramCache]: Analyzing trace with hash -803002234, now seen corresponding path program 282 times [2020-01-16 17:54:39,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:39,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880279939] [2020-01-16 17:54:39,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:39,645 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:54:39,775 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:54:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:39,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880279939] [2020-01-16 17:54:39,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:39,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:39,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495892520] [2020-01-16 17:54:39,785 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:39,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:39,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:39,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:39,785 INFO L87 Difference]: Start difference. First operand 3128 states and 15582 transitions. Second operand 12 states. [2020-01-16 17:54:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:40,076 INFO L93 Difference]: Finished difference Result 5992 states and 26742 transitions. [2020-01-16 17:54:40,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:40,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:40,091 INFO L225 Difference]: With dead ends: 5992 [2020-01-16 17:54:40,091 INFO L226 Difference]: Without dead ends: 5960 [2020-01-16 17:54:40,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-01-16 17:54:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3114. [2020-01-16 17:54:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-01-16 17:54:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15551 transitions. [2020-01-16 17:54:40,312 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15551 transitions. Word has length 31 [2020-01-16 17:54:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:40,312 INFO L478 AbstractCegarLoop]: Abstraction has 3114 states and 15551 transitions. [2020-01-16 17:54:40,312 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15551 transitions. [2020-01-16 17:54:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:40,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:40,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:40,318 INFO L426 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:40,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:40,318 INFO L82 PathProgramCache]: Analyzing trace with hash 722988968, now seen corresponding path program 283 times [2020-01-16 17:54:40,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:40,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985874306] [2020-01-16 17:54:40,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:40,837 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:40,971 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:54:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:40,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985874306] [2020-01-16 17:54:40,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:40,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:40,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544006210] [2020-01-16 17:54:40,981 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:40,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:40,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:40,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:40,981 INFO L87 Difference]: Start difference. First operand 3114 states and 15551 transitions. Second operand 12 states. [2020-01-16 17:54:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:41,196 INFO L93 Difference]: Finished difference Result 5976 states and 26715 transitions. [2020-01-16 17:54:41,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:41,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:41,211 INFO L225 Difference]: With dead ends: 5976 [2020-01-16 17:54:41,211 INFO L226 Difference]: Without dead ends: 5960 [2020-01-16 17:54:41,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-01-16 17:54:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3124. [2020-01-16 17:54:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:54:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-01-16 17:54:41,431 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-01-16 17:54:41,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:41,431 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-01-16 17:54:41,431 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-01-16 17:54:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:41,436 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:41,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:41,436 INFO L426 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash -121982484, now seen corresponding path program 284 times [2020-01-16 17:54:41,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:41,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477437788] [2020-01-16 17:54:41,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:42,069 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:54:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:42,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477437788] [2020-01-16 17:54:42,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:42,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:42,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358492851] [2020-01-16 17:54:42,078 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:42,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:42,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:42,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:42,079 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-01-16 17:54:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:42,297 INFO L93 Difference]: Finished difference Result 5980 states and 26718 transitions. [2020-01-16 17:54:42,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:42,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:42,312 INFO L225 Difference]: With dead ends: 5980 [2020-01-16 17:54:42,312 INFO L226 Difference]: Without dead ends: 5955 [2020-01-16 17:54:42,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-01-16 17:54:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3119. [2020-01-16 17:54:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-01-16 17:54:42,541 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-01-16 17:54:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:42,542 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-01-16 17:54:42,542 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-01-16 17:54:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:42,547 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:42,547 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:42,547 INFO L426 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:42,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:42,547 INFO L82 PathProgramCache]: Analyzing trace with hash -125633504, now seen corresponding path program 285 times [2020-01-16 17:54:42,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:42,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122922300] [2020-01-16 17:54:42,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:43,065 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:43,194 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:54:43,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-01-16 17:54:43,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122922300] [2020-01-16 17:54:43,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:43,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:43,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747022685] [2020-01-16 17:54:43,204 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:43,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:43,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:43,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:43,205 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-01-16 17:54:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:43,489 INFO L93 Difference]: Finished difference Result 5974 states and 26706 transitions. [2020-01-16 17:54:43,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:43,489 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:43,505 INFO L225 Difference]: With dead ends: 5974 [2020-01-16 17:54:43,505 INFO L226 Difference]: Without dead ends: 5958 [2020-01-16 17:54:43,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-01-16 17:54:43,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3124. [2020-01-16 17:54:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:54:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-01-16 17:54:43,727 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-01-16 17:54:43,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:43,727 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-01-16 17:54:43,727 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-01-16 17:54:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:43,732 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:43,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:43,732 INFO L426 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:43,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:43,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1634419436, now seen corresponding path program 286 times [2020-01-16 17:54:43,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:43,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027777594] [2020-01-16 17:54:43,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:44,251 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:54:44,396 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:54:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:44,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027777594] [2020-01-16 17:54:44,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:44,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:44,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464190057] [2020-01-16 17:54:44,406 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:44,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:44,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:44,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:44,407 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-01-16 17:54:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:44,635 INFO L93 Difference]: Finished difference Result 5976 states and 26705 transitions. [2020-01-16 17:54:44,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:44,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:44,649 INFO L225 Difference]: With dead ends: 5976 [2020-01-16 17:54:44,649 INFO L226 Difference]: Without dead ends: 5953 [2020-01-16 17:54:44,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2020-01-16 17:54:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 3119. [2020-01-16 17:54:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-01-16 17:54:44,869 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-01-16 17:54:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:44,869 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-01-16 17:54:44,869 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-01-16 17:54:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:44,875 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:44,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:44,875 INFO L426 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:44,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:44,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1394916192, now seen corresponding path program 287 times [2020-01-16 17:54:44,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:44,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502653964] [2020-01-16 17:54:44,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:45,403 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:54:45,530 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:54:45,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-01-16 17:54:45,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502653964] [2020-01-16 17:54:45,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:45,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:45,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715126474] [2020-01-16 17:54:45,540 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:45,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:45,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:45,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:45,541 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-01-16 17:54:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:45,829 INFO L93 Difference]: Finished difference Result 5984 states and 26723 transitions. [2020-01-16 17:54:45,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:45,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:45,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:45,844 INFO L225 Difference]: With dead ends: 5984 [2020-01-16 17:54:45,844 INFO L226 Difference]: Without dead ends: 5964 [2020-01-16 17:54:45,845 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:46,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-01-16 17:54:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3126. [2020-01-16 17:54:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:54:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15573 transitions. [2020-01-16 17:54:46,072 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15573 transitions. Word has length 31 [2020-01-16 17:54:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:46,072 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15573 transitions. [2020-01-16 17:54:46,072 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15573 transitions. [2020-01-16 17:54:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:46,077 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:46,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:46,078 INFO L426 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:46,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:46,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1210108200, now seen corresponding path program 288 times [2020-01-16 17:54:46,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:46,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24093107] [2020-01-16 17:54:46,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:46,617 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:54:46,752 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:54:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:46,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24093107] [2020-01-16 17:54:46,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:46,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:46,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612543549] [2020-01-16 17:54:46,761 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:46,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:46,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:46,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:46,761 INFO L87 Difference]: Start difference. First operand 3126 states and 15573 transitions. Second operand 12 states. [2020-01-16 17:54:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:47,019 INFO L93 Difference]: Finished difference Result 5982 states and 26712 transitions. [2020-01-16 17:54:47,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:47,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:47,035 INFO L225 Difference]: With dead ends: 5982 [2020-01-16 17:54:47,035 INFO L226 Difference]: Without dead ends: 5947 [2020-01-16 17:54:47,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-01-16 17:54:47,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3109. [2020-01-16 17:54:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-01-16 17:54:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15537 transitions. [2020-01-16 17:54:47,323 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15537 transitions. Word has length 31 [2020-01-16 17:54:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:47,323 INFO L478 AbstractCegarLoop]: Abstraction has 3109 states and 15537 transitions. [2020-01-16 17:54:47,323 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15537 transitions. [2020-01-16 17:54:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:47,329 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:47,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:47,329 INFO L426 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:47,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:47,329 INFO L82 PathProgramCache]: Analyzing trace with hash 565119294, now seen corresponding path program 289 times [2020-01-16 17:54:47,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:47,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968473001] [2020-01-16 17:54:47,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:47,871 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:54:48,004 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:48,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968473001] [2020-01-16 17:54:48,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:48,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:48,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886888767] [2020-01-16 17:54:48,013 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:48,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:48,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:48,013 INFO L87 Difference]: Start difference. First operand 3109 states and 15537 transitions. Second operand 12 states. [2020-01-16 17:54:48,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:48,350 INFO L93 Difference]: Finished difference Result 5968 states and 26703 transitions. [2020-01-16 17:54:48,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:48,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:48,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:48,364 INFO L225 Difference]: With dead ends: 5968 [2020-01-16 17:54:48,364 INFO L226 Difference]: Without dead ends: 5949 [2020-01-16 17:54:48,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-01-16 17:54:48,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3124. [2020-01-16 17:54:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:54:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-01-16 17:54:48,585 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-01-16 17:54:48,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:48,585 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-01-16 17:54:48,585 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-01-16 17:54:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:48,590 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:48,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:48,591 INFO L426 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:48,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:48,591 INFO L82 PathProgramCache]: Analyzing trace with hash 142633568, now seen corresponding path program 290 times [2020-01-16 17:54:48,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:48,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761232530] [2020-01-16 17:54:48,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:49,137 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:54:49,269 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:49,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761232530] [2020-01-16 17:54:49,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:49,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:49,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803790103] [2020-01-16 17:54:49,279 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:49,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:49,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:49,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:49,279 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-01-16 17:54:49,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:49,519 INFO L93 Difference]: Finished difference Result 5965 states and 26692 transitions. [2020-01-16 17:54:49,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:49,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:49,535 INFO L225 Difference]: With dead ends: 5965 [2020-01-16 17:54:49,535 INFO L226 Difference]: Without dead ends: 5944 [2020-01-16 17:54:49,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2020-01-16 17:54:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 3119. [2020-01-16 17:54:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-01-16 17:54:49,759 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-01-16 17:54:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:49,759 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-01-16 17:54:49,759 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-01-16 17:54:49,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:49,764 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:49,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:49,765 INFO L426 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:49,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:49,765 INFO L82 PathProgramCache]: Analyzing trace with hash -283503178, now seen corresponding path program 291 times [2020-01-16 17:54:49,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:49,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928243008] [2020-01-16 17:54:49,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:50,301 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:54:50,428 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:50,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928243008] [2020-01-16 17:54:50,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:50,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:50,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386010997] [2020-01-16 17:54:50,438 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:50,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:50,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:50,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:50,439 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-01-16 17:54:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:50,752 INFO L93 Difference]: Finished difference Result 5970 states and 26703 transitions. [2020-01-16 17:54:50,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:50,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:50,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:50,767 INFO L225 Difference]: With dead ends: 5970 [2020-01-16 17:54:50,767 INFO L226 Difference]: Without dead ends: 5951 [2020-01-16 17:54:50,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-01-16 17:54:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3125. [2020-01-16 17:54:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:54:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15586 transitions. [2020-01-16 17:54:51,005 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15586 transitions. Word has length 31 [2020-01-16 17:54:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:51,005 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15586 transitions. [2020-01-16 17:54:51,005 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15586 transitions. [2020-01-16 17:54:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:51,010 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:51,010 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:51,011 INFO L426 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:51,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1899035488, now seen corresponding path program 292 times [2020-01-16 17:54:51,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:51,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358469936] [2020-01-16 17:54:51,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:51,537 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:54:51,671 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:51,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358469936] [2020-01-16 17:54:51,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:51,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:51,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104737843] [2020-01-16 17:54:51,681 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:51,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:51,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:51,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:51,681 INFO L87 Difference]: Start difference. First operand 3125 states and 15586 transitions. Second operand 12 states. [2020-01-16 17:54:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:51,931 INFO L93 Difference]: Finished difference Result 5968 states and 26693 transitions. [2020-01-16 17:54:51,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:51,932 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:51,947 INFO L225 Difference]: With dead ends: 5968 [2020-01-16 17:54:51,947 INFO L226 Difference]: Without dead ends: 5945 [2020-01-16 17:54:51,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5945 states. [2020-01-16 17:54:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5945 to 3119. [2020-01-16 17:54:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-01-16 17:54:52,169 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-01-16 17:54:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:52,169 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-01-16 17:54:52,169 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-01-16 17:54:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:52,175 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:52,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:52,175 INFO L426 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:52,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:52,175 INFO L82 PathProgramCache]: Analyzing trace with hash -918144522, now seen corresponding path program 293 times [2020-01-16 17:54:52,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:52,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916941675] [2020-01-16 17:54:52,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:52,715 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:54:52,845 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:52,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916941675] [2020-01-16 17:54:52,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:52,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:52,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726880103] [2020-01-16 17:54:52,854 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:52,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:52,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:52,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:52,855 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-01-16 17:54:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:53,091 INFO L93 Difference]: Finished difference Result 5963 states and 26683 transitions. [2020-01-16 17:54:53,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:53,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:53,106 INFO L225 Difference]: With dead ends: 5963 [2020-01-16 17:54:53,106 INFO L226 Difference]: Without dead ends: 5947 [2020-01-16 17:54:53,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-01-16 17:54:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3124. [2020-01-16 17:54:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:54:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-01-16 17:54:53,328 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-01-16 17:54:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:53,328 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-01-16 17:54:53,328 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-01-16 17:54:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:53,333 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:53,333 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:53,333 INFO L426 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:53,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:53,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1686879870, now seen corresponding path program 294 times [2020-01-16 17:54:53,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:53,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915496625] [2020-01-16 17:54:53,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:54,000 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:54,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-01-16 17:54:54,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915496625] [2020-01-16 17:54:54,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:54,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:54,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597221849] [2020-01-16 17:54:54,010 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:54,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:54,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:54,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:54,011 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-01-16 17:54:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:54,239 INFO L93 Difference]: Finished difference Result 5964 states and 26680 transitions. [2020-01-16 17:54:54,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:54,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:54,254 INFO L225 Difference]: With dead ends: 5964 [2020-01-16 17:54:54,254 INFO L226 Difference]: Without dead ends: 5937 [2020-01-16 17:54:54,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:54,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5937 states. [2020-01-16 17:54:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5937 to 3114. [2020-01-16 17:54:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-01-16 17:54:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15556 transitions. [2020-01-16 17:54:54,478 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15556 transitions. Word has length 31 [2020-01-16 17:54:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:54,478 INFO L478 AbstractCegarLoop]: Abstraction has 3114 states and 15556 transitions. [2020-01-16 17:54:54,478 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15556 transitions. [2020-01-16 17:54:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:54,483 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:54,483 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:54,483 INFO L426 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:54,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:54,484 INFO L82 PathProgramCache]: Analyzing trace with hash 296372866, now seen corresponding path program 295 times [2020-01-16 17:54:54,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:54,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577803747] [2020-01-16 17:54:54,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:55,018 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:55,147 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:55,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-01-16 17:54:55,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577803747] [2020-01-16 17:54:55,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:55,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:55,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120641919] [2020-01-16 17:54:55,157 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:55,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:55,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:55,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:55,157 INFO L87 Difference]: Start difference. First operand 3114 states and 15556 transitions. Second operand 12 states. [2020-01-16 17:54:55,423 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2020-01-16 17:54:55,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:55,442 INFO L93 Difference]: Finished difference Result 5970 states and 26703 transitions. [2020-01-16 17:54:55,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:55,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:55,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:55,457 INFO L225 Difference]: With dead ends: 5970 [2020-01-16 17:54:55,458 INFO L226 Difference]: Without dead ends: 5951 [2020-01-16 17:54:55,458 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-01-16 17:54:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3124. [2020-01-16 17:54:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:54:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-01-16 17:54:55,683 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-01-16 17:54:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:55,683 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-01-16 17:54:55,683 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-01-16 17:54:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:55,688 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:55,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:55,688 INFO L426 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:55,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:55,688 INFO L82 PathProgramCache]: Analyzing trace with hash -126112860, now seen corresponding path program 296 times [2020-01-16 17:54:55,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:55,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960324313] [2020-01-16 17:54:55,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:56,220 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-01-16 17:54:56,353 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:56,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-01-16 17:54:56,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960324313] [2020-01-16 17:54:56,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:56,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:56,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285320900] [2020-01-16 17:54:56,363 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:56,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:56,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:56,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:56,363 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-01-16 17:54:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:56,596 INFO L93 Difference]: Finished difference Result 5967 states and 26692 transitions. [2020-01-16 17:54:56,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:56,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:56,611 INFO L225 Difference]: With dead ends: 5967 [2020-01-16 17:54:56,611 INFO L226 Difference]: Without dead ends: 5946 [2020-01-16 17:54:56,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-01-16 17:54:56,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3119. [2020-01-16 17:54:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-01-16 17:54:56,831 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-01-16 17:54:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:56,831 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-01-16 17:54:56,831 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-01-16 17:54:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:56,836 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:56,836 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:56,837 INFO L426 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash -976560842, now seen corresponding path program 297 times [2020-01-16 17:54:56,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:56,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413734174] [2020-01-16 17:54:56,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:57,376 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:54:57,507 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:54:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:57,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413734174] [2020-01-16 17:54:57,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:57,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:57,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738201144] [2020-01-16 17:54:57,518 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:57,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:57,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:57,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:57,518 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-01-16 17:54:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:57,745 INFO L93 Difference]: Finished difference Result 5974 states and 26708 transitions. [2020-01-16 17:54:57,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:57,745 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:57,760 INFO L225 Difference]: With dead ends: 5974 [2020-01-16 17:54:57,760 INFO L226 Difference]: Without dead ends: 5955 [2020-01-16 17:54:57,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:57,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-01-16 17:54:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3126. [2020-01-16 17:54:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:54:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15583 transitions. [2020-01-16 17:54:57,985 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15583 transitions. Word has length 31 [2020-01-16 17:54:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:57,986 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15583 transitions. [2020-01-16 17:54:57,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15583 transitions. [2020-01-16 17:54:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:57,991 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:57,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:57,991 INFO L426 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:57,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:57,991 INFO L82 PathProgramCache]: Analyzing trace with hash 361006372, now seen corresponding path program 298 times [2020-01-16 17:54:57,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:57,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435199545] [2020-01-16 17:54:57,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:58,542 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:54:58,667 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:58,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435199545] [2020-01-16 17:54:58,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:58,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:58,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181222814] [2020-01-16 17:54:58,676 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:58,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:58,677 INFO L87 Difference]: Start difference. First operand 3126 states and 15583 transitions. Second operand 12 states. [2020-01-16 17:54:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:54:58,912 INFO L93 Difference]: Finished difference Result 5973 states and 26699 transitions. [2020-01-16 17:54:58,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:54:58,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:54:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:54:58,927 INFO L225 Difference]: With dead ends: 5973 [2020-01-16 17:54:58,927 INFO L226 Difference]: Without dead ends: 5948 [2020-01-16 17:54:58,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:54:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-01-16 17:54:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3119. [2020-01-16 17:54:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:54:59,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-01-16 17:54:59,146 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-01-16 17:54:59,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:54:59,147 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-01-16 17:54:59,147 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:54:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-01-16 17:54:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:54:59,152 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:54:59,152 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:54:59,152 INFO L426 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:54:59,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:54:59,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1611202186, now seen corresponding path program 299 times [2020-01-16 17:54:59,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:54:59,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184600154] [2020-01-16 17:54:59,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:54:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:54:59,691 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:54:59,820 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:54:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:54:59,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184600154] [2020-01-16 17:54:59,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:54:59,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:54:59,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442214346] [2020-01-16 17:54:59,830 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:54:59,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:54:59,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:54:59,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:54:59,830 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-01-16 17:55:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:00,059 INFO L93 Difference]: Finished difference Result 5966 states and 26685 transitions. [2020-01-16 17:55:00,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:00,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:00,074 INFO L225 Difference]: With dead ends: 5966 [2020-01-16 17:55:00,074 INFO L226 Difference]: Without dead ends: 5950 [2020-01-16 17:55:00,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-01-16 17:55:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3124. [2020-01-16 17:55:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:55:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-01-16 17:55:00,299 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-01-16 17:55:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:00,299 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-01-16 17:55:00,299 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-01-16 17:55:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:00,304 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:00,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:00,304 INFO L426 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:00,305 INFO L82 PathProgramCache]: Analyzing trace with hash 148850754, now seen corresponding path program 300 times [2020-01-16 17:55:00,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:00,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857596775] [2020-01-16 17:55:00,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:00,844 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:00,974 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:00,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857596775] [2020-01-16 17:55:00,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:00,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:00,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975113601] [2020-01-16 17:55:00,984 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:00,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:00,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:00,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:00,984 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-01-16 17:55:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:01,247 INFO L93 Difference]: Finished difference Result 5968 states and 26684 transitions. [2020-01-16 17:55:01,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:01,248 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:01,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:01,263 INFO L225 Difference]: With dead ends: 5968 [2020-01-16 17:55:01,263 INFO L226 Difference]: Without dead ends: 5940 [2020-01-16 17:55:01,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:01,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2020-01-16 17:55:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3114. [2020-01-16 17:55:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-01-16 17:55:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15551 transitions. [2020-01-16 17:55:01,493 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15551 transitions. Word has length 31 [2020-01-16 17:55:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:01,493 INFO L478 AbstractCegarLoop]: Abstraction has 3114 states and 15551 transitions. [2020-01-16 17:55:01,493 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15551 transitions. [2020-01-16 17:55:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:01,498 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:01,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:01,499 INFO L426 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1089742462, now seen corresponding path program 301 times [2020-01-16 17:55:01,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:01,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123279907] [2020-01-16 17:55:01,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:02,166 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:55:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:02,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123279907] [2020-01-16 17:55:02,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:02,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:02,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749151071] [2020-01-16 17:55:02,176 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:02,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:02,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:02,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:02,176 INFO L87 Difference]: Start difference. First operand 3114 states and 15551 transitions. Second operand 12 states. [2020-01-16 17:55:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:02,468 INFO L93 Difference]: Finished difference Result 5976 states and 26715 transitions. [2020-01-16 17:55:02,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:02,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:02,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:02,482 INFO L225 Difference]: With dead ends: 5976 [2020-01-16 17:55:02,482 INFO L226 Difference]: Without dead ends: 5957 [2020-01-16 17:55:02,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:02,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-01-16 17:55:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3126. [2020-01-16 17:55:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:55:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15585 transitions. [2020-01-16 17:55:02,703 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15585 transitions. Word has length 31 [2020-01-16 17:55:02,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:02,704 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15585 transitions. [2020-01-16 17:55:02,704 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15585 transitions. [2020-01-16 17:55:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:02,709 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:02,709 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:02,709 INFO L426 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:02,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:02,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1092796204, now seen corresponding path program 302 times [2020-01-16 17:55:02,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:02,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722334258] [2020-01-16 17:55:02,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:03,288 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:03,421 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:55:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:03,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722334258] [2020-01-16 17:55:03,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:03,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:03,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708900637] [2020-01-16 17:55:03,431 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:03,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:03,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:03,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:03,432 INFO L87 Difference]: Start difference. First operand 3126 states and 15585 transitions. Second operand 12 states. [2020-01-16 17:55:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:03,717 INFO L93 Difference]: Finished difference Result 5974 states and 26705 transitions. [2020-01-16 17:55:03,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:03,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:03,733 INFO L225 Difference]: With dead ends: 5974 [2020-01-16 17:55:03,733 INFO L226 Difference]: Without dead ends: 5951 [2020-01-16 17:55:03,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-01-16 17:55:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3120. [2020-01-16 17:55:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:55:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15568 transitions. [2020-01-16 17:55:03,958 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15568 transitions. Word has length 31 [2020-01-16 17:55:03,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:03,958 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15568 transitions. [2020-01-16 17:55:03,958 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15568 transitions. [2020-01-16 17:55:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:03,963 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:03,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:03,964 INFO L426 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:03,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:03,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1514053698, now seen corresponding path program 303 times [2020-01-16 17:55:03,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:03,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194074585] [2020-01-16 17:55:03,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:04,506 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:04,635 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-01-16 17:55:04,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-01-16 17:55:04,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194074585] [2020-01-16 17:55:04,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:04,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:04,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320724520] [2020-01-16 17:55:04,645 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:04,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:04,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:04,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:04,646 INFO L87 Difference]: Start difference. First operand 3120 states and 15568 transitions. Second operand 12 states. [2020-01-16 17:55:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:04,935 INFO L93 Difference]: Finished difference Result 5978 states and 26714 transitions. [2020-01-16 17:55:04,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:04,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:04,950 INFO L225 Difference]: With dead ends: 5978 [2020-01-16 17:55:04,950 INFO L226 Difference]: Without dead ends: 5959 [2020-01-16 17:55:04,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:05,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2020-01-16 17:55:05,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 3127. [2020-01-16 17:55:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:55:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15581 transitions. [2020-01-16 17:55:05,176 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15581 transitions. Word has length 31 [2020-01-16 17:55:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:05,177 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15581 transitions. [2020-01-16 17:55:05,177 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15581 transitions. [2020-01-16 17:55:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:05,182 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:05,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:05,182 INFO L426 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:05,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:05,182 INFO L82 PathProgramCache]: Analyzing trace with hash -176486484, now seen corresponding path program 304 times [2020-01-16 17:55:05,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:05,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391416525] [2020-01-16 17:55:05,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:05,732 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:05,867 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:55:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:05,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391416525] [2020-01-16 17:55:05,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:05,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:05,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983687239] [2020-01-16 17:55:05,877 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:05,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:05,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:05,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:05,877 INFO L87 Difference]: Start difference. First operand 3127 states and 15581 transitions. Second operand 12 states. [2020-01-16 17:55:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:06,124 INFO L93 Difference]: Finished difference Result 5977 states and 26705 transitions. [2020-01-16 17:55:06,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:06,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:06,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:06,139 INFO L225 Difference]: With dead ends: 5977 [2020-01-16 17:55:06,139 INFO L226 Difference]: Without dead ends: 5952 [2020-01-16 17:55:06,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-01-16 17:55:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3120. [2020-01-16 17:55:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:55:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15562 transitions. [2020-01-16 17:55:06,364 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15562 transitions. Word has length 31 [2020-01-16 17:55:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:06,365 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15562 transitions. [2020-01-16 17:55:06,365 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15562 transitions. [2020-01-16 17:55:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:06,370 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:06,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:06,370 INFO L426 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:06,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:06,370 INFO L82 PathProgramCache]: Analyzing trace with hash -392293122, now seen corresponding path program 305 times [2020-01-16 17:55:06,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:06,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951476337] [2020-01-16 17:55:06,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:06,920 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:07,048 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:55: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-01-16 17:55:07,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951476337] [2020-01-16 17:55:07,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:07,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:07,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080599843] [2020-01-16 17:55:07,058 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:07,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:07,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:07,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:07,059 INFO L87 Difference]: Start difference. First operand 3120 states and 15562 transitions. Second operand 12 states. [2020-01-16 17:55:07,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:07,335 INFO L93 Difference]: Finished difference Result 5973 states and 26697 transitions. [2020-01-16 17:55:07,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:07,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:07,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:07,350 INFO L225 Difference]: With dead ends: 5973 [2020-01-16 17:55:07,351 INFO L226 Difference]: Without dead ends: 5956 [2020-01-16 17:55:07,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:07,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-01-16 17:55:07,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3126. [2020-01-16 17:55:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:55:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15573 transitions. [2020-01-16 17:55:07,572 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15573 transitions. Word has length 31 [2020-01-16 17:55:07,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:07,572 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15573 transitions. [2020-01-16 17:55:07,572 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15573 transitions. [2020-01-16 17:55:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:07,577 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:07,577 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:07,577 INFO L426 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1237264574, now seen corresponding path program 306 times [2020-01-16 17:55:07,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:07,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450682691] [2020-01-16 17:55:07,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:08,112 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:08,242 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:55:08,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-01-16 17:55:08,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450682691] [2020-01-16 17:55:08,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:08,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:08,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154152943] [2020-01-16 17:55:08,252 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:08,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:08,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:08,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:08,252 INFO L87 Difference]: Start difference. First operand 3126 states and 15573 transitions. Second operand 12 states. [2020-01-16 17:55:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:08,561 INFO L93 Difference]: Finished difference Result 5974 states and 26693 transitions. [2020-01-16 17:55:08,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:08,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:08,576 INFO L225 Difference]: With dead ends: 5974 [2020-01-16 17:55:08,576 INFO L226 Difference]: Without dead ends: 5944 [2020-01-16 17:55:08,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2020-01-16 17:55:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 3114. [2020-01-16 17:55:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-01-16 17:55:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15546 transitions. [2020-01-16 17:55:08,801 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15546 transitions. Word has length 31 [2020-01-16 17:55:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:08,801 INFO L478 AbstractCegarLoop]: Abstraction has 3114 states and 15546 transitions. [2020-01-16 17:55:08,801 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15546 transitions. [2020-01-16 17:55:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:08,807 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:08,807 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:08,807 INFO L426 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:08,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:08,807 INFO L82 PathProgramCache]: Analyzing trace with hash 288726628, now seen corresponding path program 307 times [2020-01-16 17:55:08,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:08,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95257076] [2020-01-16 17:55:08,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:09,349 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:09,478 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2020-01-16 17:55:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:09,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95257076] [2020-01-16 17:55:09,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:09,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:09,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728215217] [2020-01-16 17:55:09,487 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:09,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:09,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:09,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:09,488 INFO L87 Difference]: Start difference. First operand 3114 states and 15546 transitions. Second operand 12 states. [2020-01-16 17:55:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:09,718 INFO L93 Difference]: Finished difference Result 5962 states and 26676 transitions. [2020-01-16 17:55:09,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:09,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:09,733 INFO L225 Difference]: With dead ends: 5962 [2020-01-16 17:55:09,733 INFO L226 Difference]: Without dead ends: 5946 [2020-01-16 17:55:09,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-01-16 17:55:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3124. [2020-01-16 17:55:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:55:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-01-16 17:55:09,958 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-01-16 17:55:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:09,958 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-01-16 17:55:09,958 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-01-16 17:55:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:09,964 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:09,964 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:09,964 INFO L426 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:09,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1401216276, now seen corresponding path program 308 times [2020-01-16 17:55:09,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:09,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183322571] [2020-01-16 17:55:09,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:10,515 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:10,646 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:55:10,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:10,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183322571] [2020-01-16 17:55:10,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:10,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:10,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832190257] [2020-01-16 17:55:10,656 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:10,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:10,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:10,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:10,656 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-01-16 17:55:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:10,893 INFO L93 Difference]: Finished difference Result 5963 states and 26673 transitions. [2020-01-16 17:55:10,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:10,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:10,908 INFO L225 Difference]: With dead ends: 5963 [2020-01-16 17:55:10,909 INFO L226 Difference]: Without dead ends: 5941 [2020-01-16 17:55:10,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5941 states. [2020-01-16 17:55:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5941 to 3119. [2020-01-16 17:55:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:55:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-01-16 17:55:11,131 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-01-16 17:55:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:11,131 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-01-16 17:55:11,131 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-01-16 17:55:11,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:11,136 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:11,136 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:11,137 INFO L426 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:11,137 INFO L82 PathProgramCache]: Analyzing trace with hash -135584608, now seen corresponding path program 309 times [2020-01-16 17:55:11,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:11,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327093454] [2020-01-16 17:55:11,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:11,726 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:11,851 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:11,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327093454] [2020-01-16 17:55:11,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:11,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:11,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714822513] [2020-01-16 17:55:11,861 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:11,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:11,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:11,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:11,861 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-01-16 17:55:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:12,215 INFO L93 Difference]: Finished difference Result 5963 states and 26673 transitions. [2020-01-16 17:55:12,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:12,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:12,230 INFO L225 Difference]: With dead ends: 5963 [2020-01-16 17:55:12,230 INFO L226 Difference]: Without dead ends: 5947 [2020-01-16 17:55:12,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-01-16 17:55:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3124. [2020-01-16 17:55:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:55:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-01-16 17:55:12,451 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-01-16 17:55:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:12,451 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-01-16 17:55:12,451 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-01-16 17:55:12,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:12,456 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:12,457 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:12,457 INFO L426 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:12,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:12,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1624468332, now seen corresponding path program 310 times [2020-01-16 17:55:12,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:12,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043806597] [2020-01-16 17:55:12,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:13,000 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:13,129 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:13,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043806597] [2020-01-16 17:55:13,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:13,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:13,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295275424] [2020-01-16 17:55:13,138 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:13,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:13,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:13,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:13,138 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-01-16 17:55:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:13,499 INFO L93 Difference]: Finished difference Result 5965 states and 26672 transitions. [2020-01-16 17:55:13,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:13,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:13,515 INFO L225 Difference]: With dead ends: 5965 [2020-01-16 17:55:13,515 INFO L226 Difference]: Without dead ends: 5942 [2020-01-16 17:55:13,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:13,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2020-01-16 17:55:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 3119. [2020-01-16 17:55:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:55:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15555 transitions. [2020-01-16 17:55:13,741 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15555 transitions. Word has length 31 [2020-01-16 17:55:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:13,741 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15555 transitions. [2020-01-16 17:55:13,741 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15555 transitions. [2020-01-16 17:55:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:13,746 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:13,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:13,746 INFO L426 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1620817312, now seen corresponding path program 311 times [2020-01-16 17:55:13,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:13,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285474269] [2020-01-16 17:55:13,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:14,293 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:14,421 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:55:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:14,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285474269] [2020-01-16 17:55:14,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:14,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:14,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017198923] [2020-01-16 17:55:14,431 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:14,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:14,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:14,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:14,432 INFO L87 Difference]: Start difference. First operand 3119 states and 15555 transitions. Second operand 12 states. [2020-01-16 17:55:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:14,684 INFO L93 Difference]: Finished difference Result 5966 states and 26675 transitions. [2020-01-16 17:55:14,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:14,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:14,700 INFO L225 Difference]: With dead ends: 5966 [2020-01-16 17:55:14,700 INFO L226 Difference]: Without dead ends: 5949 [2020-01-16 17:55:14,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-01-16 17:55:14,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3125. [2020-01-16 17:55:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:55:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15566 transitions. [2020-01-16 17:55:14,921 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15566 transitions. Word has length 31 [2020-01-16 17:55:14,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:14,922 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15566 transitions. [2020-01-16 17:55:14,922 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:14,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15566 transitions. [2020-01-16 17:55:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:14,927 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:14,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:14,927 INFO L426 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:14,927 INFO L82 PathProgramCache]: Analyzing trace with hash 775845860, now seen corresponding path program 312 times [2020-01-16 17:55:14,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:14,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435815248] [2020-01-16 17:55:14,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:15,587 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:55: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-01-16 17:55:15,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435815248] [2020-01-16 17:55:15,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:15,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:15,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787207551] [2020-01-16 17:55:15,596 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:15,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:15,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:15,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:15,596 INFO L87 Difference]: Start difference. First operand 3125 states and 15566 transitions. Second operand 12 states. [2020-01-16 17:55:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:15,954 INFO L93 Difference]: Finished difference Result 5967 states and 26671 transitions. [2020-01-16 17:55:15,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:15,954 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:15,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:15,969 INFO L225 Difference]: With dead ends: 5967 [2020-01-16 17:55:15,969 INFO L226 Difference]: Without dead ends: 5933 [2020-01-16 17:55:15,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:16,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5933 states. [2020-01-16 17:55:16,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5933 to 3109. [2020-01-16 17:55:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-01-16 17:55:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15532 transitions. [2020-01-16 17:55:16,188 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15532 transitions. Word has length 31 [2020-01-16 17:55:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:16,188 INFO L478 AbstractCegarLoop]: Abstraction has 3109 states and 15532 transitions. [2020-01-16 17:55:16,188 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15532 transitions. [2020-01-16 17:55:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:16,193 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:16,194 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:16,194 INFO L426 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:16,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:16,194 INFO L82 PathProgramCache]: Analyzing trace with hash 130856954, now seen corresponding path program 313 times [2020-01-16 17:55:16,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:16,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438234579] [2020-01-16 17:55:16,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:16,739 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:16,866 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:55:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:16,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438234579] [2020-01-16 17:55:16,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:16,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:16,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403353176] [2020-01-16 17:55:16,877 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:16,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:16,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:16,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:16,877 INFO L87 Difference]: Start difference. First operand 3109 states and 15532 transitions. Second operand 12 states. [2020-01-16 17:55:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:17,199 INFO L93 Difference]: Finished difference Result 5999 states and 26786 transitions. [2020-01-16 17:55:17,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:17,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:17,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:17,214 INFO L225 Difference]: With dead ends: 5999 [2020-01-16 17:55:17,214 INFO L226 Difference]: Without dead ends: 5980 [2020-01-16 17:55:17,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-01-16 17:55:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3129. [2020-01-16 17:55:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:55:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15599 transitions. [2020-01-16 17:55:17,440 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15599 transitions. Word has length 31 [2020-01-16 17:55:17,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:17,440 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15599 transitions. [2020-01-16 17:55:17,440 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15599 transitions. [2020-01-16 17:55:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:17,446 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:17,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:17,446 INFO L426 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:17,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1136600224, now seen corresponding path program 314 times [2020-01-16 17:55:17,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:17,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399204201] [2020-01-16 17:55:17,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:17,991 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:55:18,123 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:18,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399204201] [2020-01-16 17:55:18,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:18,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:18,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268029076] [2020-01-16 17:55:18,132 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:18,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:18,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:18,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:18,132 INFO L87 Difference]: Start difference. First operand 3129 states and 15599 transitions. Second operand 12 states. [2020-01-16 17:55:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:18,485 INFO L93 Difference]: Finished difference Result 6000 states and 26780 transitions. [2020-01-16 17:55:18,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:18,486 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:18,501 INFO L225 Difference]: With dead ends: 6000 [2020-01-16 17:55:18,501 INFO L226 Difference]: Without dead ends: 5972 [2020-01-16 17:55:18,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-01-16 17:55:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3121. [2020-01-16 17:55:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:55:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15578 transitions. [2020-01-16 17:55:18,727 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15578 transitions. Word has length 31 [2020-01-16 17:55:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:18,727 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15578 transitions. [2020-01-16 17:55:18,727 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15578 transitions. [2020-01-16 17:55:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:18,732 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:18,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:18,733 INFO L426 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:18,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:18,733 INFO L82 PathProgramCache]: Analyzing trace with hash -293454282, now seen corresponding path program 315 times [2020-01-16 17:55:18,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:18,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311736223] [2020-01-16 17:55:18,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:19,442 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:55:19,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-01-16 17:55:19,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311736223] [2020-01-16 17:55:19,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:19,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:19,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863812956] [2020-01-16 17:55:19,453 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:19,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:19,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:19,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:19,454 INFO L87 Difference]: Start difference. First operand 3121 states and 15578 transitions. Second operand 12 states. [2020-01-16 17:55:19,690 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2020-01-16 17:55:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:19,710 INFO L93 Difference]: Finished difference Result 5994 states and 26768 transitions. [2020-01-16 17:55:19,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:19,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:19,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:19,727 INFO L225 Difference]: With dead ends: 5994 [2020-01-16 17:55:19,727 INFO L226 Difference]: Without dead ends: 5975 [2020-01-16 17:55:19,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-01-16 17:55:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3127. [2020-01-16 17:55:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:55:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15589 transitions. [2020-01-16 17:55:19,950 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15589 transitions. Word has length 31 [2020-01-16 17:55:19,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:19,950 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15589 transitions. [2020-01-16 17:55:19,950 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15589 transitions. [2020-01-16 17:55:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:19,956 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:19,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:19,956 INFO L426 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1889084384, now seen corresponding path program 316 times [2020-01-16 17:55:19,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:19,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419441378] [2020-01-16 17:55:19,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:20,493 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:20,624 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:55:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:20,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419441378] [2020-01-16 17:55:20,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:20,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:20,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404024797] [2020-01-16 17:55:20,635 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:20,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:20,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:20,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:20,636 INFO L87 Difference]: Start difference. First operand 3127 states and 15589 transitions. Second operand 12 states. [2020-01-16 17:55:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:20,862 INFO L93 Difference]: Finished difference Result 5992 states and 26758 transitions. [2020-01-16 17:55:20,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:20,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:20,877 INFO L225 Difference]: With dead ends: 5992 [2020-01-16 17:55:20,877 INFO L226 Difference]: Without dead ends: 5969 [2020-01-16 17:55:20,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-01-16 17:55:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-01-16 17:55:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:55:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15572 transitions. [2020-01-16 17:55:21,098 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15572 transitions. Word has length 31 [2020-01-16 17:55:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:21,098 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15572 transitions. [2020-01-16 17:55:21,098 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15572 transitions. [2020-01-16 17:55:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:21,103 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:21,103 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:21,104 INFO L426 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:21,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:21,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2097588982, now seen corresponding path program 317 times [2020-01-16 17:55:21,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:21,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981392067] [2020-01-16 17:55:21,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:21,768 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:21,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-01-16 17:55:21,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981392067] [2020-01-16 17:55:21,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:21,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:21,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190430188] [2020-01-16 17:55:21,778 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:21,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:21,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:21,779 INFO L87 Difference]: Start difference. First operand 3121 states and 15572 transitions. Second operand 12 states. [2020-01-16 17:55:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:21,999 INFO L93 Difference]: Finished difference Result 5996 states and 26766 transitions. [2020-01-16 17:55:22,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:22,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:22,015 INFO L225 Difference]: With dead ends: 5996 [2020-01-16 17:55:22,015 INFO L226 Difference]: Without dead ends: 5976 [2020-01-16 17:55:22,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-01-16 17:55:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3127. [2020-01-16 17:55:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:55:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15583 transitions. [2020-01-16 17:55:22,237 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15583 transitions. Word has length 31 [2020-01-16 17:55:22,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:22,237 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15583 transitions. [2020-01-16 17:55:22,237 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15583 transitions. [2020-01-16 17:55:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:22,242 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:22,242 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:22,242 INFO L426 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1252617530, now seen corresponding path program 318 times [2020-01-16 17:55:22,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:22,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716836641] [2020-01-16 17:55:22,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:22,906 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:22,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-01-16 17:55:22,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716836641] [2020-01-16 17:55:22,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:22,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:22,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474770114] [2020-01-16 17:55:22,916 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:22,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:22,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:22,916 INFO L87 Difference]: Start difference. First operand 3127 states and 15583 transitions. Second operand 12 states. [2020-01-16 17:55:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:23,145 INFO L93 Difference]: Finished difference Result 5993 states and 26754 transitions. [2020-01-16 17:55:23,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:23,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:23,160 INFO L225 Difference]: With dead ends: 5993 [2020-01-16 17:55:23,160 INFO L226 Difference]: Without dead ends: 5964 [2020-01-16 17:55:23,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:23,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-01-16 17:55:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3115. [2020-01-16 17:55:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-01-16 17:55:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15555 transitions. [2020-01-16 17:55:23,381 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15555 transitions. Word has length 31 [2020-01-16 17:55:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:23,381 INFO L478 AbstractCegarLoop]: Abstraction has 3115 states and 15555 transitions. [2020-01-16 17:55:23,381 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15555 transitions. [2020-01-16 17:55:23,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:23,386 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:23,386 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:23,387 INFO L426 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:23,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:23,387 INFO L82 PathProgramCache]: Analyzing trace with hash -137889474, now seen corresponding path program 319 times [2020-01-16 17:55:23,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:23,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422283475] [2020-01-16 17:55:23,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:23,939 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:24,067 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-01-16 17:55:24,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-01-16 17:55:24,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422283475] [2020-01-16 17:55:24,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:24,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:24,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088124670] [2020-01-16 17:55:24,077 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:24,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:24,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:24,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:24,077 INFO L87 Difference]: Start difference. First operand 3115 states and 15555 transitions. Second operand 12 states. [2020-01-16 17:55:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:24,323 INFO L93 Difference]: Finished difference Result 6003 states and 26792 transitions. [2020-01-16 17:55:24,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:24,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:24,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:24,338 INFO L225 Difference]: With dead ends: 6003 [2020-01-16 17:55:24,338 INFO L226 Difference]: Without dead ends: 5984 [2020-01-16 17:55:24,338 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-01-16 17:55:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3130. [2020-01-16 17:55:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:55:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15597 transitions. [2020-01-16 17:55:24,557 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15597 transitions. Word has length 31 [2020-01-16 17:55:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:24,558 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15597 transitions. [2020-01-16 17:55:24,558 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15597 transitions. [2020-01-16 17:55:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:24,563 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:24,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:24,563 INFO L426 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:24,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1405346652, now seen corresponding path program 320 times [2020-01-16 17:55:24,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:24,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060391363] [2020-01-16 17:55:24,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:25,118 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:25,249 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:55:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:25,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060391363] [2020-01-16 17:55:25,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:25,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:25,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325777114] [2020-01-16 17:55:25,259 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:25,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:25,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:25,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:25,259 INFO L87 Difference]: Start difference. First operand 3130 states and 15597 transitions. Second operand 12 states. [2020-01-16 17:55:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:25,484 INFO L93 Difference]: Finished difference Result 6004 states and 26786 transitions. [2020-01-16 17:55:25,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:25,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:25,498 INFO L225 Difference]: With dead ends: 6004 [2020-01-16 17:55:25,499 INFO L226 Difference]: Without dead ends: 5976 [2020-01-16 17:55:25,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-01-16 17:55:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3122. [2020-01-16 17:55:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:55:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15575 transitions. [2020-01-16 17:55:25,723 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15575 transitions. Word has length 31 [2020-01-16 17:55:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:25,723 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15575 transitions. [2020-01-16 17:55:25,723 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15575 transitions. [2020-01-16 17:55:25,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:25,728 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:25,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:25,728 INFO L426 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:25,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:25,729 INFO L82 PathProgramCache]: Analyzing trace with hash -986511946, now seen corresponding path program 321 times [2020-01-16 17:55:25,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:25,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497519780] [2020-01-16 17:55:25,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:26,282 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:26,413 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-01-16 17:55:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:26,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497519780] [2020-01-16 17:55:26,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:26,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:26,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829060746] [2020-01-16 17:55:26,422 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:26,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:26,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:26,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:26,422 INFO L87 Difference]: Start difference. First operand 3122 states and 15575 transitions. Second operand 12 states. [2020-01-16 17:55:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:26,646 INFO L93 Difference]: Finished difference Result 6000 states and 26778 transitions. [2020-01-16 17:55:26,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:26,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:26,666 INFO L225 Difference]: With dead ends: 6000 [2020-01-16 17:55:26,666 INFO L226 Difference]: Without dead ends: 5981 [2020-01-16 17:55:26,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-01-16 17:55:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3129. [2020-01-16 17:55:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:55:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15588 transitions. [2020-01-16 17:55:26,890 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15588 transitions. Word has length 31 [2020-01-16 17:55:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:26,890 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15588 transitions. [2020-01-16 17:55:26,890 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15588 transitions. [2020-01-16 17:55:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:26,895 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:26,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:26,895 INFO L426 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:26,896 INFO L82 PathProgramCache]: Analyzing trace with hash 351055268, now seen corresponding path program 322 times [2020-01-16 17:55:26,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:26,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576846250] [2020-01-16 17:55:26,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:27,444 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:27,572 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:55:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:27,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576846250] [2020-01-16 17:55:27,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:27,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:27,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176460028] [2020-01-16 17:55:27,582 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:27,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:27,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:27,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:27,582 INFO L87 Difference]: Start difference. First operand 3129 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:55:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:27,837 INFO L93 Difference]: Finished difference Result 5999 states and 26769 transitions. [2020-01-16 17:55:27,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:27,837 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:27,852 INFO L225 Difference]: With dead ends: 5999 [2020-01-16 17:55:27,852 INFO L226 Difference]: Without dead ends: 5974 [2020-01-16 17:55:27,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-01-16 17:55:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3122. [2020-01-16 17:55:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:55:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15568 transitions. [2020-01-16 17:55:28,074 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15568 transitions. Word has length 31 [2020-01-16 17:55:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:28,074 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15568 transitions. [2020-01-16 17:55:28,074 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15568 transitions. [2020-01-16 17:55:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:28,079 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:28,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:28,079 INFO L426 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:28,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1404531318, now seen corresponding path program 323 times [2020-01-16 17:55:28,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:28,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357414118] [2020-01-16 17:55:28,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:28,615 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:28,741 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:28,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357414118] [2020-01-16 17:55:28,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:28,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:28,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848430641] [2020-01-16 17:55:28,751 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:28,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:28,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:28,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:28,752 INFO L87 Difference]: Start difference. First operand 3122 states and 15568 transitions. Second operand 12 states. [2020-01-16 17:55:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:28,975 INFO L93 Difference]: Finished difference Result 6002 states and 26775 transitions. [2020-01-16 17:55:28,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:28,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:28,990 INFO L225 Difference]: With dead ends: 6002 [2020-01-16 17:55:28,991 INFO L226 Difference]: Without dead ends: 5982 [2020-01-16 17:55:28,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-01-16 17:55:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3129. [2020-01-16 17:55:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:55:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15581 transitions. [2020-01-16 17:55:29,216 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15581 transitions. Word has length 31 [2020-01-16 17:55:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:29,216 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15581 transitions. [2020-01-16 17:55:29,216 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15581 transitions. [2020-01-16 17:55:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:29,221 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:29,221 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:29,221 INFO L426 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:29,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash -285411586, now seen corresponding path program 324 times [2020-01-16 17:55:29,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:29,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740902853] [2020-01-16 17:55:29,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:29,765 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:29,895 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:29,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740902853] [2020-01-16 17:55:29,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:29,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:29,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427275676] [2020-01-16 17:55:29,905 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:29,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:29,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:29,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:29,905 INFO L87 Difference]: Start difference. First operand 3129 states and 15581 transitions. Second operand 12 states. [2020-01-16 17:55:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:30,179 INFO L93 Difference]: Finished difference Result 6000 states and 26764 transitions. [2020-01-16 17:55:30,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:30,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:30,193 INFO L225 Difference]: With dead ends: 6000 [2020-01-16 17:55:30,193 INFO L226 Difference]: Without dead ends: 5968 [2020-01-16 17:55:30,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-01-16 17:55:30,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3115. [2020-01-16 17:55:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-01-16 17:55:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15549 transitions. [2020-01-16 17:55:30,414 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15549 transitions. Word has length 31 [2020-01-16 17:55:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:30,414 INFO L478 AbstractCegarLoop]: Abstraction has 3115 states and 15549 transitions. [2020-01-16 17:55:30,414 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15549 transitions. [2020-01-16 17:55:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:30,419 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:30,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:30,419 INFO L426 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:30,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:30,420 INFO L82 PathProgramCache]: Analyzing trace with hash -830947138, now seen corresponding path program 325 times [2020-01-16 17:55:30,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:30,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440605525] [2020-01-16 17:55:30,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:30,946 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:31,077 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:55:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:31,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440605525] [2020-01-16 17:55:31,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:31,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:31,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051828207] [2020-01-16 17:55:31,088 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:31,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:31,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:31,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:31,088 INFO L87 Difference]: Start difference. First operand 3115 states and 15549 transitions. Second operand 12 states. [2020-01-16 17:55:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:31,345 INFO L93 Difference]: Finished difference Result 5991 states and 26755 transitions. [2020-01-16 17:55:31,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:31,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:31,361 INFO L225 Difference]: With dead ends: 5991 [2020-01-16 17:55:31,361 INFO L226 Difference]: Without dead ends: 5972 [2020-01-16 17:55:31,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-01-16 17:55:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3127. [2020-01-16 17:55:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:55:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15583 transitions. [2020-01-16 17:55:31,585 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15583 transitions. Word has length 31 [2020-01-16 17:55:31,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:31,586 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15583 transitions. [2020-01-16 17:55:31,586 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:31,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15583 transitions. [2020-01-16 17:55:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:31,591 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:31,591 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:31,591 INFO L426 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:31,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:31,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1351591528, now seen corresponding path program 326 times [2020-01-16 17:55:31,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:31,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988549135] [2020-01-16 17:55:31,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:32,141 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:32,274 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:55:32,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-01-16 17:55:32,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988549135] [2020-01-16 17:55:32,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:32,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:32,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967956856] [2020-01-16 17:55:32,284 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:32,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:32,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:32,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:32,285 INFO L87 Difference]: Start difference. First operand 3127 states and 15583 transitions. Second operand 12 states. [2020-01-16 17:55:32,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:32,521 INFO L93 Difference]: Finished difference Result 5989 states and 26745 transitions. [2020-01-16 17:55:32,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:32,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:32,536 INFO L225 Difference]: With dead ends: 5989 [2020-01-16 17:55:32,537 INFO L226 Difference]: Without dead ends: 5966 [2020-01-16 17:55:32,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-01-16 17:55:32,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3121. [2020-01-16 17:55:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:55:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15566 transitions. [2020-01-16 17:55:32,757 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15566 transitions. Word has length 31 [2020-01-16 17:55:32,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:32,757 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15566 transitions. [2020-01-16 17:55:32,757 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15566 transitions. [2020-01-16 17:55:32,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:32,762 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:32,762 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:32,762 INFO L426 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:32,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:32,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1255258374, now seen corresponding path program 327 times [2020-01-16 17:55:32,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:32,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218413681] [2020-01-16 17:55:32,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:33,313 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:33,440 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-01-16 17:55:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:33,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218413681] [2020-01-16 17:55:33,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:33,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:33,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752119490] [2020-01-16 17:55:33,449 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:33,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:33,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:33,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:33,449 INFO L87 Difference]: Start difference. First operand 3121 states and 15566 transitions. Second operand 12 states. [2020-01-16 17:55:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:33,673 INFO L93 Difference]: Finished difference Result 5993 states and 26754 transitions. [2020-01-16 17:55:33,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:33,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:33,687 INFO L225 Difference]: With dead ends: 5993 [2020-01-16 17:55:33,687 INFO L226 Difference]: Without dead ends: 5974 [2020-01-16 17:55:33,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-01-16 17:55:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3128. [2020-01-16 17:55:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:55:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15579 transitions. [2020-01-16 17:55:33,908 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15579 transitions. Word has length 31 [2020-01-16 17:55:33,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:33,909 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15579 transitions. [2020-01-16 17:55:33,909 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15579 transitions. [2020-01-16 17:55:33,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:33,914 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:33,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:33,914 INFO L426 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:33,914 INFO L82 PathProgramCache]: Analyzing trace with hash 82308840, now seen corresponding path program 328 times [2020-01-16 17:55:33,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:33,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575923921] [2020-01-16 17:55:33,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:34,454 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:34,584 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:55:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:34,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575923921] [2020-01-16 17:55:34,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:34,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:34,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101767515] [2020-01-16 17:55:34,594 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:34,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:34,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:34,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:34,595 INFO L87 Difference]: Start difference. First operand 3128 states and 15579 transitions. Second operand 12 states. [2020-01-16 17:55:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:34,876 INFO L93 Difference]: Finished difference Result 5992 states and 26745 transitions. [2020-01-16 17:55:34,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:34,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:34,891 INFO L225 Difference]: With dead ends: 5992 [2020-01-16 17:55:34,891 INFO L226 Difference]: Without dead ends: 5967 [2020-01-16 17:55:34,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2020-01-16 17:55:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 3121. [2020-01-16 17:55:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:55:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15560 transitions. [2020-01-16 17:55:35,117 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15560 transitions. Word has length 31 [2020-01-16 17:55:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:35,117 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15560 transitions. [2020-01-16 17:55:35,117 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15560 transitions. [2020-01-16 17:55:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:35,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:35,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:35,122 INFO L426 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:35,123 INFO L82 PathProgramCache]: Analyzing trace with hash -133497798, now seen corresponding path program 329 times [2020-01-16 17:55:35,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:35,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053706897] [2020-01-16 17:55:35,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:35,727 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:35,857 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:55:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:35,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053706897] [2020-01-16 17:55:35,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:35,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:35,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858169255] [2020-01-16 17:55:35,868 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:35,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:35,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:35,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:35,868 INFO L87 Difference]: Start difference. First operand 3121 states and 15560 transitions. Second operand 12 states. [2020-01-16 17:55:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:36,091 INFO L93 Difference]: Finished difference Result 5988 states and 26737 transitions. [2020-01-16 17:55:36,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:36,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:36,106 INFO L225 Difference]: With dead ends: 5988 [2020-01-16 17:55:36,106 INFO L226 Difference]: Without dead ends: 5971 [2020-01-16 17:55:36,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5971 states. [2020-01-16 17:55:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5971 to 3127. [2020-01-16 17:55:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:55:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15571 transitions. [2020-01-16 17:55:36,342 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15571 transitions. Word has length 31 [2020-01-16 17:55:36,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:36,342 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15571 transitions. [2020-01-16 17:55:36,342 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15571 transitions. [2020-01-16 17:55:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:36,348 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:36,348 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:36,348 INFO L426 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:36,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash -978469250, now seen corresponding path program 330 times [2020-01-16 17:55:36,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:36,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328049393] [2020-01-16 17:55:36,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:36,884 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:55:37,015 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-01-16 17:55:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:37,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328049393] [2020-01-16 17:55:37,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:37,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:37,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90884695] [2020-01-16 17:55:37,025 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:37,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:37,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:37,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:37,025 INFO L87 Difference]: Start difference. First operand 3127 states and 15571 transitions. Second operand 12 states. [2020-01-16 17:55:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:37,259 INFO L93 Difference]: Finished difference Result 5989 states and 26733 transitions. [2020-01-16 17:55:37,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:37,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:37,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:37,274 INFO L225 Difference]: With dead ends: 5989 [2020-01-16 17:55:37,274 INFO L226 Difference]: Without dead ends: 5959 [2020-01-16 17:55:37,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2020-01-16 17:55:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 3115. [2020-01-16 17:55:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-01-16 17:55:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15543 transitions. [2020-01-16 17:55:37,494 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15543 transitions. Word has length 31 [2020-01-16 17:55:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:37,494 INFO L478 AbstractCegarLoop]: Abstraction has 3115 states and 15543 transitions. [2020-01-16 17:55:37,494 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15543 transitions. [2020-01-16 17:55:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:37,500 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:37,500 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:37,500 INFO L426 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:37,500 INFO L82 PathProgramCache]: Analyzing trace with hash -990507164, now seen corresponding path program 331 times [2020-01-16 17:55:37,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:37,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850844095] [2020-01-16 17:55:37,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:38,024 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:38,155 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:38,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-01-16 17:55:38,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850844095] [2020-01-16 17:55:38,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:38,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:38,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897006418] [2020-01-16 17:55:38,165 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:38,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:38,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:38,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:38,165 INFO L87 Difference]: Start difference. First operand 3115 states and 15543 transitions. Second operand 12 states. [2020-01-16 17:55:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:38,472 INFO L93 Difference]: Finished difference Result 5994 states and 26755 transitions. [2020-01-16 17:55:38,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:38,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:38,487 INFO L225 Difference]: With dead ends: 5994 [2020-01-16 17:55:38,488 INFO L226 Difference]: Without dead ends: 5974 [2020-01-16 17:55:38,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-01-16 17:55:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3127. [2020-01-16 17:55:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:55:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15577 transitions. [2020-01-16 17:55:38,713 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15577 transitions. Word has length 31 [2020-01-16 17:55:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:38,714 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15577 transitions. [2020-01-16 17:55:38,714 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15577 transitions. [2020-01-16 17:55:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:38,719 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:38,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:38,719 INFO L426 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1835478616, now seen corresponding path program 332 times [2020-01-16 17:55:38,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:38,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107189349] [2020-01-16 17:55:38,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:39,246 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:55:39,377 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:39,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107189349] [2020-01-16 17:55:39,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:39,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:39,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445688026] [2020-01-16 17:55:39,387 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:39,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:39,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:39,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:39,388 INFO L87 Difference]: Start difference. First operand 3127 states and 15577 transitions. Second operand 12 states. [2020-01-16 17:55:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:39,623 INFO L93 Difference]: Finished difference Result 5991 states and 26743 transitions. [2020-01-16 17:55:39,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:39,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:39,638 INFO L225 Difference]: With dead ends: 5991 [2020-01-16 17:55:39,638 INFO L226 Difference]: Without dead ends: 5968 [2020-01-16 17:55:39,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-01-16 17:55:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-01-16 17:55:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:55:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15560 transitions. [2020-01-16 17:55:39,863 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15560 transitions. Word has length 31 [2020-01-16 17:55:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:39,864 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15560 transitions. [2020-01-16 17:55:39,864 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15560 transitions. [2020-01-16 17:55:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:39,869 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:39,870 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:39,870 INFO L426 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:39,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1414818400, now seen corresponding path program 333 times [2020-01-16 17:55:39,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:39,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915454002] [2020-01-16 17:55:39,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:40,402 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:40,529 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:40,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915454002] [2020-01-16 17:55:40,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:40,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:40,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904160964] [2020-01-16 17:55:40,539 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:40,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:40,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:40,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:40,540 INFO L87 Difference]: Start difference. First operand 3121 states and 15560 transitions. Second operand 12 states. [2020-01-16 17:55:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:40,846 INFO L93 Difference]: Finished difference Result 5996 states and 26754 transitions. [2020-01-16 17:55:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:40,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:40,861 INFO L225 Difference]: With dead ends: 5996 [2020-01-16 17:55:40,861 INFO L226 Difference]: Without dead ends: 5976 [2020-01-16 17:55:40,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-01-16 17:55:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3128. [2020-01-16 17:55:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:55:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15573 transitions. [2020-01-16 17:55:41,087 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15573 transitions. Word has length 31 [2020-01-16 17:55:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:41,088 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15573 transitions. [2020-01-16 17:55:41,088 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15573 transitions. [2020-01-16 17:55:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:41,093 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:41,093 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:41,093 INFO L426 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:41,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1190205992, now seen corresponding path program 334 times [2020-01-16 17:55:41,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:41,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846361023] [2020-01-16 17:55:41,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:41,636 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:41,766 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:41,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846361023] [2020-01-16 17:55:41,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:41,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:41,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996988069] [2020-01-16 17:55:41,775 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:41,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:41,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:41,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:41,776 INFO L87 Difference]: Start difference. First operand 3128 states and 15573 transitions. Second operand 12 states. [2020-01-16 17:55:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:42,024 INFO L93 Difference]: Finished difference Result 5994 states and 26743 transitions. [2020-01-16 17:55:42,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:42,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:42,039 INFO L225 Difference]: With dead ends: 5994 [2020-01-16 17:55:42,040 INFO L226 Difference]: Without dead ends: 5969 [2020-01-16 17:55:42,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-01-16 17:55:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-01-16 17:55:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:55:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15554 transitions. [2020-01-16 17:55:42,261 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15554 transitions. Word has length 31 [2020-01-16 17:55:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:42,261 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15554 transitions. [2020-01-16 17:55:42,261 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15554 transitions. [2020-01-16 17:55:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:42,266 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:42,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:42,266 INFO L426 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:42,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:42,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1610866208, now seen corresponding path program 335 times [2020-01-16 17:55:42,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:42,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767814820] [2020-01-16 17:55:42,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:42,808 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:55:42,938 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:42,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767814820] [2020-01-16 17:55:42,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:42,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:42,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118173180] [2020-01-16 17:55:42,947 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:42,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:42,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:42,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:42,947 INFO L87 Difference]: Start difference. First operand 3121 states and 15554 transitions. Second operand 12 states. [2020-01-16 17:55:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:43,225 INFO L93 Difference]: Finished difference Result 5989 states and 26733 transitions. [2020-01-16 17:55:43,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:43,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:43,240 INFO L225 Difference]: With dead ends: 5989 [2020-01-16 17:55:43,240 INFO L226 Difference]: Without dead ends: 5972 [2020-01-16 17:55:43,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-01-16 17:55:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3127. [2020-01-16 17:55:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:55:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15565 transitions. [2020-01-16 17:55:43,466 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15565 transitions. Word has length 31 [2020-01-16 17:55:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:43,466 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15565 transitions. [2020-01-16 17:55:43,467 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15565 transitions. [2020-01-16 17:55:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:43,472 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:43,472 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:43,472 INFO L426 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:43,473 INFO L82 PathProgramCache]: Analyzing trace with hash 765894756, now seen corresponding path program 336 times [2020-01-16 17:55:43,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:43,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392786580] [2020-01-16 17:55:43,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:43,753 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-01-16 17:55:44,055 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:44,185 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:44,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392786580] [2020-01-16 17:55:44,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:44,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:44,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344766791] [2020-01-16 17:55:44,195 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:44,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:44,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:44,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:44,195 INFO L87 Difference]: Start difference. First operand 3127 states and 15565 transitions. Second operand 12 states. [2020-01-16 17:55:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:44,441 INFO L93 Difference]: Finished difference Result 5990 states and 26729 transitions. [2020-01-16 17:55:44,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:44,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:44,456 INFO L225 Difference]: With dead ends: 5990 [2020-01-16 17:55:44,456 INFO L226 Difference]: Without dead ends: 5954 [2020-01-16 17:55:44,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-01-16 17:55:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3109. [2020-01-16 17:55:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-01-16 17:55:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15527 transitions. [2020-01-16 17:55:44,681 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15527 transitions. Word has length 31 [2020-01-16 17:55:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:44,681 INFO L478 AbstractCegarLoop]: Abstraction has 3109 states and 15527 transitions. [2020-01-16 17:55:44,681 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15527 transitions. [2020-01-16 17:55:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:44,686 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:44,686 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:44,686 INFO L426 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash -508759942, now seen corresponding path program 337 times [2020-01-16 17:55:44,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:44,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181727202] [2020-01-16 17:55:44,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:45,213 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:55:45,343 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:55:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:45,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181727202] [2020-01-16 17:55:45,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:45,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:45,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081339317] [2020-01-16 17:55:45,352 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:45,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:45,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:45,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:45,353 INFO L87 Difference]: Start difference. First operand 3109 states and 15527 transitions. Second operand 12 states. [2020-01-16 17:55:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:45,615 INFO L93 Difference]: Finished difference Result 5968 states and 26693 transitions. [2020-01-16 17:55:45,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:45,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:45,629 INFO L225 Difference]: With dead ends: 5968 [2020-01-16 17:55:45,629 INFO L226 Difference]: Without dead ends: 5952 [2020-01-16 17:55:45,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-01-16 17:55:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3124. [2020-01-16 17:55:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:55:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-01-16 17:55:45,855 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-01-16 17:55:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:45,855 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-01-16 17:55:45,855 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-01-16 17:55:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:45,860 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:45,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:45,861 INFO L426 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:45,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:45,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1353731394, now seen corresponding path program 338 times [2020-01-16 17:55:45,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:45,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584651206] [2020-01-16 17:55:45,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:46,392 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:55:46,516 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:55:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:46,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584651206] [2020-01-16 17:55:46,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:46,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:46,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972673712] [2020-01-16 17:55:46,526 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:46,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:46,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:46,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:46,526 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-01-16 17:55:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:46,745 INFO L93 Difference]: Finished difference Result 5972 states and 26696 transitions. [2020-01-16 17:55:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:46,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:46,761 INFO L225 Difference]: With dead ends: 5972 [2020-01-16 17:55:46,762 INFO L226 Difference]: Without dead ends: 5947 [2020-01-16 17:55:46,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-01-16 17:55:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3119. [2020-01-16 17:55:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:55:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-01-16 17:55:46,985 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-01-16 17:55:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:46,986 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-01-16 17:55:46,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-01-16 17:55:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:46,991 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:46,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:46,991 INFO L426 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:46,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash -933071178, now seen corresponding path program 339 times [2020-01-16 17:55:46,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:46,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052950667] [2020-01-16 17:55:46,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:47,532 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:55:47,662 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:55:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:47,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052950667] [2020-01-16 17:55:47,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:47,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:47,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656782239] [2020-01-16 17:55:47,671 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:47,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:47,672 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-01-16 17:55:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:47,884 INFO L93 Difference]: Finished difference Result 5965 states and 26682 transitions. [2020-01-16 17:55:47,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:47,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:47,899 INFO L225 Difference]: With dead ends: 5965 [2020-01-16 17:55:47,899 INFO L226 Difference]: Without dead ends: 5949 [2020-01-16 17:55:47,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-01-16 17:55:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3124. [2020-01-16 17:55:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:55:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-01-16 17:55:48,121 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-01-16 17:55:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:48,121 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-01-16 17:55:48,121 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-01-16 17:55:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:48,126 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:48,126 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:48,126 INFO L426 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:48,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1671953214, now seen corresponding path program 340 times [2020-01-16 17:55:48,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:48,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512671207] [2020-01-16 17:55:48,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:48,803 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:48,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-01-16 17:55:48,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512671207] [2020-01-16 17:55:48,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:48,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:48,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48124969] [2020-01-16 17:55:48,813 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:48,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:48,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:48,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:48,814 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-01-16 17:55:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:49,037 INFO L93 Difference]: Finished difference Result 5966 states and 26679 transitions. [2020-01-16 17:55:49,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:49,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:49,052 INFO L225 Difference]: With dead ends: 5966 [2020-01-16 17:55:49,053 INFO L226 Difference]: Without dead ends: 5944 [2020-01-16 17:55:49,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2020-01-16 17:55:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 3119. [2020-01-16 17:55:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:55:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-01-16 17:55:49,272 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-01-16 17:55:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:49,272 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-01-16 17:55:49,272 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-01-16 17:55:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:49,277 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:49,277 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:49,277 INFO L426 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:49,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2092613430, now seen corresponding path program 341 times [2020-01-16 17:55:49,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:49,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238227769] [2020-01-16 17:55:49,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:49,795 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:55:49,924 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:49,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238227769] [2020-01-16 17:55:49,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:49,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:49,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559291090] [2020-01-16 17:55:49,933 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:49,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:49,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:49,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:49,934 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-01-16 17:55:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:50,193 INFO L93 Difference]: Finished difference Result 5974 states and 26696 transitions. [2020-01-16 17:55:50,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:50,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:50,208 INFO L225 Difference]: With dead ends: 5974 [2020-01-16 17:55:50,208 INFO L226 Difference]: Without dead ends: 5954 [2020-01-16 17:55:50,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-01-16 17:55:50,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3125. [2020-01-16 17:55:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:55:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15571 transitions. [2020-01-16 17:55:50,434 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15571 transitions. Word has length 31 [2020-01-16 17:55:50,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:50,434 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15571 transitions. [2020-01-16 17:55:50,434 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15571 transitions. [2020-01-16 17:55:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:50,440 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:50,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:50,440 INFO L426 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:50,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:50,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1247641978, now seen corresponding path program 342 times [2020-01-16 17:55:50,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:50,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709554983] [2020-01-16 17:55:50,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:51,101 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:55:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:51,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709554983] [2020-01-16 17:55:51,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:51,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:51,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078640958] [2020-01-16 17:55:51,111 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:51,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:51,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:51,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:51,111 INFO L87 Difference]: Start difference. First operand 3125 states and 15571 transitions. Second operand 12 states. [2020-01-16 17:55:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:51,418 INFO L93 Difference]: Finished difference Result 5971 states and 26684 transitions. [2020-01-16 17:55:51,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:51,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:51,433 INFO L225 Difference]: With dead ends: 5971 [2020-01-16 17:55:51,433 INFO L226 Difference]: Without dead ends: 5943 [2020-01-16 17:55:51,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2020-01-16 17:55:51,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 3114. [2020-01-16 17:55:51,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-01-16 17:55:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15546 transitions. [2020-01-16 17:55:51,658 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15546 transitions. Word has length 31 [2020-01-16 17:55:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:51,658 INFO L478 AbstractCegarLoop]: Abstraction has 3114 states and 15546 transitions. [2020-01-16 17:55:51,659 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15546 transitions. [2020-01-16 17:55:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:51,664 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:51,664 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:51,664 INFO L426 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:51,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:51,664 INFO L82 PathProgramCache]: Analyzing trace with hash -777506370, now seen corresponding path program 343 times [2020-01-16 17:55:51,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:51,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818939862] [2020-01-16 17:55:51,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:52,226 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:55:52,355 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:55:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:52,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818939862] [2020-01-16 17:55:52,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:52,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:52,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379884672] [2020-01-16 17:55:52,365 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:52,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:52,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:52,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:52,365 INFO L87 Difference]: Start difference. First operand 3114 states and 15546 transitions. Second operand 12 states. [2020-01-16 17:55:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:52,595 INFO L93 Difference]: Finished difference Result 5970 states and 26693 transitions. [2020-01-16 17:55:52,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:52,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:52,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:52,610 INFO L225 Difference]: With dead ends: 5970 [2020-01-16 17:55:52,611 INFO L226 Difference]: Without dead ends: 5954 [2020-01-16 17:55:52,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-01-16 17:55:52,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3124. [2020-01-16 17:55:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:55:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-01-16 17:55:52,832 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-01-16 17:55:52,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:52,832 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-01-16 17:55:52,832 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-01-16 17:55:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:52,837 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:52,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:52,838 INFO L426 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:52,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:52,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1622477822, now seen corresponding path program 344 times [2020-01-16 17:55:52,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:52,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121194133] [2020-01-16 17:55:52,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:53,359 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:55:53,491 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:55:53,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-01-16 17:55:53,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121194133] [2020-01-16 17:55:53,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:53,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:53,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971596608] [2020-01-16 17:55:53,501 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:53,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:53,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:53,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:53,501 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-01-16 17:55:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:53,782 INFO L93 Difference]: Finished difference Result 5974 states and 26696 transitions. [2020-01-16 17:55:53,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:53,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:53,797 INFO L225 Difference]: With dead ends: 5974 [2020-01-16 17:55:53,797 INFO L226 Difference]: Without dead ends: 5949 [2020-01-16 17:55:53,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-01-16 17:55:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3119. [2020-01-16 17:55:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:55:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-01-16 17:55:54,019 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-01-16 17:55:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:54,019 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-01-16 17:55:54,019 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-01-16 17:55:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:54,024 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:54,024 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:54,024 INFO L426 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:54,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:54,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1626128842, now seen corresponding path program 345 times [2020-01-16 17:55:54,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:54,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342229622] [2020-01-16 17:55:54,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:54,545 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:55:54,672 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:55:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:54,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342229622] [2020-01-16 17:55:54,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:54,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:54,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145480694] [2020-01-16 17:55:54,682 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:54,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:54,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:54,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:54,682 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-01-16 17:55:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:54,967 INFO L93 Difference]: Finished difference Result 5968 states and 26684 transitions. [2020-01-16 17:55:54,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:54,968 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:54,983 INFO L225 Difference]: With dead ends: 5968 [2020-01-16 17:55:54,983 INFO L226 Difference]: Without dead ends: 5952 [2020-01-16 17:55:54,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-01-16 17:55:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3124. [2020-01-16 17:55:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:55:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-01-16 17:55:55,210 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-01-16 17:55:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:55,210 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-01-16 17:55:55,210 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-01-16 17:55:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:55,215 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:55,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:55,215 INFO L426 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:55,216 INFO L82 PathProgramCache]: Analyzing trace with hash 133924098, now seen corresponding path program 346 times [2020-01-16 17:55:55,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:55,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316629550] [2020-01-16 17:55:55,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:55,741 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:55:55,872 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:55:55,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-01-16 17:55:55,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316629550] [2020-01-16 17:55:55,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:55,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:55,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643219118] [2020-01-16 17:55:55,883 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:55,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:55,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:55,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:55,883 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-01-16 17:55:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:56,114 INFO L93 Difference]: Finished difference Result 5970 states and 26683 transitions. [2020-01-16 17:55:56,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:56,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:56,129 INFO L225 Difference]: With dead ends: 5970 [2020-01-16 17:55:56,129 INFO L226 Difference]: Without dead ends: 5947 [2020-01-16 17:55:56,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-01-16 17:55:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3119. [2020-01-16 17:55:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:55:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15555 transitions. [2020-01-16 17:55:56,352 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15555 transitions. Word has length 31 [2020-01-16 17:55:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:56,352 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15555 transitions. [2020-01-16 17:55:56,352 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15555 transitions. [2020-01-16 17:55:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:56,357 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:56,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:56,357 INFO L426 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1399555766, now seen corresponding path program 347 times [2020-01-16 17:55:56,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:56,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833800993] [2020-01-16 17:55:56,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:56,890 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:55:57,017 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:55:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:57,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833800993] [2020-01-16 17:55:57,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:57,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:57,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645832720] [2020-01-16 17:55:57,026 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:57,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:57,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:57,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:57,026 INFO L87 Difference]: Start difference. First operand 3119 states and 15555 transitions. Second operand 12 states. [2020-01-16 17:55:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:57,273 INFO L93 Difference]: Finished difference Result 5978 states and 26701 transitions. [2020-01-16 17:55:57,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:57,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:57,287 INFO L225 Difference]: With dead ends: 5978 [2020-01-16 17:55:57,288 INFO L226 Difference]: Without dead ends: 5958 [2020-01-16 17:55:57,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-01-16 17:55:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3126. [2020-01-16 17:55:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:55:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15568 transitions. [2020-01-16 17:55:57,518 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15568 transitions. Word has length 31 [2020-01-16 17:55:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:57,518 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15568 transitions. [2020-01-16 17:55:57,518 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15568 transitions. [2020-01-16 17:55:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:57,523 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:57,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:57,523 INFO L426 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash -290387138, now seen corresponding path program 348 times [2020-01-16 17:55:57,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:57,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988855225] [2020-01-16 17:55:57,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:58,169 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:55:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:55:58,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988855225] [2020-01-16 17:55:58,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:58,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:58,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643750133] [2020-01-16 17:55:58,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:58,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:58,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:58,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:58,179 INFO L87 Difference]: Start difference. First operand 3126 states and 15568 transitions. Second operand 12 states. [2020-01-16 17:55:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:58,413 INFO L93 Difference]: Finished difference Result 5976 states and 26690 transitions. [2020-01-16 17:55:58,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:58,413 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:58,427 INFO L225 Difference]: With dead ends: 5976 [2020-01-16 17:55:58,427 INFO L226 Difference]: Without dead ends: 5946 [2020-01-16 17:55:58,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-01-16 17:55:58,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3114. [2020-01-16 17:55:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-01-16 17:55:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15541 transitions. [2020-01-16 17:55:58,653 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15541 transitions. Word has length 31 [2020-01-16 17:55:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:58,653 INFO L478 AbstractCegarLoop]: Abstraction has 3114 states and 15541 transitions. [2020-01-16 17:55:58,653 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15541 transitions. [2020-01-16 17:55:58,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:58,658 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:58,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:58,659 INFO L426 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:58,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:58,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1470564034, now seen corresponding path program 349 times [2020-01-16 17:55:58,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:58,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976488953] [2020-01-16 17:55:58,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:55:59,211 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:55:59,337 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:55:59,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-01-16 17:55:59,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976488953] [2020-01-16 17:55:59,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:55:59,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:55:59,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989916114] [2020-01-16 17:55:59,347 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:55:59,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:55:59,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:55:59,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:55:59,347 INFO L87 Difference]: Start difference. First operand 3114 states and 15541 transitions. Second operand 12 states. [2020-01-16 17:55:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:55:59,639 INFO L93 Difference]: Finished difference Result 5963 states and 26673 transitions. [2020-01-16 17:55:59,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:55:59,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:55:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:55:59,654 INFO L225 Difference]: With dead ends: 5963 [2020-01-16 17:55:59,654 INFO L226 Difference]: Without dead ends: 5947 [2020-01-16 17:55:59,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:55:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-01-16 17:55:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3124. [2020-01-16 17:55:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:55:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-01-16 17:55:59,880 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-01-16 17:55:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:55:59,880 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-01-16 17:55:59,880 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:55:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-01-16 17:55:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:55:59,886 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:55:59,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:55:59,886 INFO L426 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:55:59,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:55:59,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1134460358, now seen corresponding path program 350 times [2020-01-16 17:55:59,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:55:59,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701303834] [2020-01-16 17:55:59,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:55:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:00,468 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:56:00,597 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:00,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701303834] [2020-01-16 17:56:00,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:00,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:00,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204596948] [2020-01-16 17:56:00,607 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:00,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:00,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:00,607 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-01-16 17:56:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:00,880 INFO L93 Difference]: Finished difference Result 5964 states and 26670 transitions. [2020-01-16 17:56:00,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:00,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:00,894 INFO L225 Difference]: With dead ends: 5964 [2020-01-16 17:56:00,894 INFO L226 Difference]: Without dead ends: 5942 [2020-01-16 17:56:00,895 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2020-01-16 17:56:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 3119. [2020-01-16 17:56:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:56:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15555 transitions. [2020-01-16 17:56:01,120 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15555 transitions. Word has length 31 [2020-01-16 17:56:01,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:01,120 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15555 transitions. [2020-01-16 17:56:01,120 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15555 transitions. [2020-01-16 17:56:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:01,125 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:01,125 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:01,126 INFO L426 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:01,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:01,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1894875270, now seen corresponding path program 351 times [2020-01-16 17:56:01,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:01,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180867564] [2020-01-16 17:56:01,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:01,664 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:56:01,799 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:56:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:01,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180867564] [2020-01-16 17:56:01,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:01,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:01,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342360962] [2020-01-16 17:56:01,809 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:01,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:01,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:01,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:01,809 INFO L87 Difference]: Start difference. First operand 3119 states and 15555 transitions. Second operand 12 states. [2020-01-16 17:56:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:02,063 INFO L93 Difference]: Finished difference Result 5964 states and 26670 transitions. [2020-01-16 17:56:02,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:02,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:02,078 INFO L225 Difference]: With dead ends: 5964 [2020-01-16 17:56:02,079 INFO L226 Difference]: Without dead ends: 5948 [2020-01-16 17:56:02,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-01-16 17:56:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3124. [2020-01-16 17:56:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:56:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15564 transitions. [2020-01-16 17:56:02,305 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15564 transitions. Word has length 31 [2020-01-16 17:56:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:02,305 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15564 transitions. [2020-01-16 17:56:02,305 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15564 transitions. [2020-01-16 17:56:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:02,311 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:02,311 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:02,311 INFO L426 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:02,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:02,311 INFO L82 PathProgramCache]: Analyzing trace with hash -134822330, now seen corresponding path program 352 times [2020-01-16 17:56:02,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:02,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831444390] [2020-01-16 17:56:02,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:02,845 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:56:02,976 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:56:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:02,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831444390] [2020-01-16 17:56:02,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:02,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:02,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288837933] [2020-01-16 17:56:02,985 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:02,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:02,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:02,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:02,985 INFO L87 Difference]: Start difference. First operand 3124 states and 15564 transitions. Second operand 12 states. [2020-01-16 17:56:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:03,341 INFO L93 Difference]: Finished difference Result 5966 states and 26669 transitions. [2020-01-16 17:56:03,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:03,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:03,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:03,356 INFO L225 Difference]: With dead ends: 5966 [2020-01-16 17:56:03,356 INFO L226 Difference]: Without dead ends: 5943 [2020-01-16 17:56:03,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2020-01-16 17:56:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 3119. [2020-01-16 17:56:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:56:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15550 transitions. [2020-01-16 17:56:03,578 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15550 transitions. Word has length 31 [2020-01-16 17:56:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:03,578 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15550 transitions. [2020-01-16 17:56:03,578 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15550 transitions. [2020-01-16 17:56:03,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:03,583 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:03,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:03,584 INFO L426 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:03,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:03,584 INFO L82 PathProgramCache]: Analyzing trace with hash -138473350, now seen corresponding path program 353 times [2020-01-16 17:56:03,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:03,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026925896] [2020-01-16 17:56:03,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:04,242 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:04,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-01-16 17:56:04,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026925896] [2020-01-16 17:56:04,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:04,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:04,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409557077] [2020-01-16 17:56:04,252 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:04,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:04,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:04,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:04,252 INFO L87 Difference]: Start difference. First operand 3119 states and 15550 transitions. Second operand 12 states. [2020-01-16 17:56:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:04,504 INFO L93 Difference]: Finished difference Result 5967 states and 26672 transitions. [2020-01-16 17:56:04,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:04,505 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:04,519 INFO L225 Difference]: With dead ends: 5967 [2020-01-16 17:56:04,520 INFO L226 Difference]: Without dead ends: 5950 [2020-01-16 17:56:04,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-01-16 17:56:04,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3125. [2020-01-16 17:56:04,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:56:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15561 transitions. [2020-01-16 17:56:04,740 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15561 transitions. Word has length 31 [2020-01-16 17:56:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:04,741 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15561 transitions. [2020-01-16 17:56:04,741 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15561 transitions. [2020-01-16 17:56:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:04,746 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:04,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:04,746 INFO L426 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash -983444802, now seen corresponding path program 354 times [2020-01-16 17:56:04,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:04,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943279542] [2020-01-16 17:56:04,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:05,280 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:56:05,411 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:05,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943279542] [2020-01-16 17:56:05,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:05,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:05,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938055299] [2020-01-16 17:56:05,421 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:05,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:05,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:05,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:05,421 INFO L87 Difference]: Start difference. First operand 3125 states and 15561 transitions. Second operand 12 states. [2020-01-16 17:56:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:05,778 INFO L93 Difference]: Finished difference Result 5968 states and 26668 transitions. [2020-01-16 17:56:05,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:05,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:05,793 INFO L225 Difference]: With dead ends: 5968 [2020-01-16 17:56:05,793 INFO L226 Difference]: Without dead ends: 5939 [2020-01-16 17:56:05,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:05,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5939 states. [2020-01-16 17:56:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5939 to 3114. [2020-01-16 17:56:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-01-16 17:56:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15536 transitions. [2020-01-16 17:56:06,014 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15536 transitions. Word has length 31 [2020-01-16 17:56:06,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:06,015 INFO L478 AbstractCegarLoop]: Abstraction has 3114 states and 15536 transitions. [2020-01-16 17:56:06,015 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15536 transitions. [2020-01-16 17:56:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:06,020 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:06,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:06,020 INFO L426 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:06,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:06,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1286374146, now seen corresponding path program 355 times [2020-01-16 17:56:06,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:06,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951290300] [2020-01-16 17:56:06,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:06,545 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:56:06,674 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:06,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-01-16 17:56:06,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951290300] [2020-01-16 17:56:06,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:06,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:06,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190418103] [2020-01-16 17:56:06,684 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:06,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:06,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:06,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:06,684 INFO L87 Difference]: Start difference. First operand 3114 states and 15536 transitions. Second operand 12 states. [2020-01-16 17:56:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:07,039 INFO L93 Difference]: Finished difference Result 5980 states and 26708 transitions. [2020-01-16 17:56:07,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:07,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:07,054 INFO L225 Difference]: With dead ends: 5980 [2020-01-16 17:56:07,054 INFO L226 Difference]: Without dead ends: 5960 [2020-01-16 17:56:07,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-01-16 17:56:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3126. [2020-01-16 17:56:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:56:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15570 transitions. [2020-01-16 17:56:07,274 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15570 transitions. Word has length 31 [2020-01-16 17:56:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:07,275 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15570 transitions. [2020-01-16 17:56:07,275 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15570 transitions. [2020-01-16 17:56:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:07,280 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:07,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:07,280 INFO L426 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash 441402694, now seen corresponding path program 356 times [2020-01-16 17:56:07,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:07,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791667649] [2020-01-16 17:56:07,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:07,803 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:56:07,935 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:07,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791667649] [2020-01-16 17:56:07,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:07,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:07,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562224941] [2020-01-16 17:56:07,945 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:07,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:07,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:07,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:07,946 INFO L87 Difference]: Start difference. First operand 3126 states and 15570 transitions. Second operand 12 states. [2020-01-16 17:56:08,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:08,200 INFO L93 Difference]: Finished difference Result 5977 states and 26696 transitions. [2020-01-16 17:56:08,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:08,200 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:08,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:08,214 INFO L225 Difference]: With dead ends: 5977 [2020-01-16 17:56:08,214 INFO L226 Difference]: Without dead ends: 5954 [2020-01-16 17:56:08,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-01-16 17:56:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3120. [2020-01-16 17:56:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:56:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15553 transitions. [2020-01-16 17:56:08,481 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15553 transitions. Word has length 31 [2020-01-16 17:56:08,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:08,481 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15553 transitions. [2020-01-16 17:56:08,481 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15553 transitions. [2020-01-16 17:56:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:08,486 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:08,486 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:08,486 INFO L426 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:08,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:08,487 INFO L82 PathProgramCache]: Analyzing trace with hash 862062910, now seen corresponding path program 357 times [2020-01-16 17:56:08,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:08,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633312917] [2020-01-16 17:56:08,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:09,008 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:56:09,136 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:09,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633312917] [2020-01-16 17:56:09,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:09,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:09,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504751322] [2020-01-16 17:56:09,146 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:09,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:09,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:09,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:09,146 INFO L87 Difference]: Start difference. First operand 3120 states and 15553 transitions. Second operand 12 states. [2020-01-16 17:56:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:09,375 INFO L93 Difference]: Finished difference Result 5982 states and 26707 transitions. [2020-01-16 17:56:09,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:09,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:09,389 INFO L225 Difference]: With dead ends: 5982 [2020-01-16 17:56:09,389 INFO L226 Difference]: Without dead ends: 5962 [2020-01-16 17:56:09,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-01-16 17:56:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3127. [2020-01-16 17:56:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:56:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15566 transitions. [2020-01-16 17:56:09,609 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15566 transitions. Word has length 31 [2020-01-16 17:56:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:09,609 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15566 transitions. [2020-01-16 17:56:09,610 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15566 transitions. [2020-01-16 17:56:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:09,615 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:09,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:09,615 INFO L426 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:09,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash -827879994, now seen corresponding path program 358 times [2020-01-16 17:56:09,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:09,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778584822] [2020-01-16 17:56:09,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:10,135 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:56:10,264 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:10,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-01-16 17:56:10,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778584822] [2020-01-16 17:56:10,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:10,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:10,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372534539] [2020-01-16 17:56:10,274 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:10,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:10,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:10,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:10,274 INFO L87 Difference]: Start difference. First operand 3127 states and 15566 transitions. Second operand 12 states. [2020-01-16 17:56:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:10,508 INFO L93 Difference]: Finished difference Result 5980 states and 26696 transitions. [2020-01-16 17:56:10,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:10,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:10,523 INFO L225 Difference]: With dead ends: 5980 [2020-01-16 17:56:10,523 INFO L226 Difference]: Without dead ends: 5955 [2020-01-16 17:56:10,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:10,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-01-16 17:56:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3120. [2020-01-16 17:56:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:56:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15547 transitions. [2020-01-16 17:56:10,744 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15547 transitions. Word has length 31 [2020-01-16 17:56:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:10,744 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15547 transitions. [2020-01-16 17:56:10,744 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15547 transitions. [2020-01-16 17:56:10,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:10,749 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:10,749 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:10,749 INFO L426 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:10,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash -407219778, now seen corresponding path program 359 times [2020-01-16 17:56:10,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:10,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044687452] [2020-01-16 17:56:10,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:11,314 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:56:11,440 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:11,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044687452] [2020-01-16 17:56:11,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:11,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:11,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142909814] [2020-01-16 17:56:11,450 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:11,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:11,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:11,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:11,451 INFO L87 Difference]: Start difference. First operand 3120 states and 15547 transitions. Second operand 12 states. [2020-01-16 17:56:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:11,664 INFO L93 Difference]: Finished difference Result 5975 states and 26686 transitions. [2020-01-16 17:56:11,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:11,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:11,679 INFO L225 Difference]: With dead ends: 5975 [2020-01-16 17:56:11,679 INFO L226 Difference]: Without dead ends: 5958 [2020-01-16 17:56:11,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:11,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-01-16 17:56:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3126. [2020-01-16 17:56:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:56:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15558 transitions. [2020-01-16 17:56:11,902 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15558 transitions. Word has length 31 [2020-01-16 17:56:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:11,902 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15558 transitions. [2020-01-16 17:56:11,902 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15558 transitions. [2020-01-16 17:56:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:11,907 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:11,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:11,907 INFO L426 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:11,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:11,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1252191230, now seen corresponding path program 360 times [2020-01-16 17:56:11,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:11,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548557899] [2020-01-16 17:56:11,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:12,431 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:56:12,566 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:12,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548557899] [2020-01-16 17:56:12,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:12,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:12,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979172714] [2020-01-16 17:56:12,576 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:12,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:12,576 INFO L87 Difference]: Start difference. First operand 3126 states and 15558 transitions. Second operand 12 states. [2020-01-16 17:56:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:12,795 INFO L93 Difference]: Finished difference Result 5976 states and 26682 transitions. [2020-01-16 17:56:12,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:12,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:12,809 INFO L225 Difference]: With dead ends: 5976 [2020-01-16 17:56:12,809 INFO L226 Difference]: Without dead ends: 5936 [2020-01-16 17:56:12,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5936 states. [2020-01-16 17:56:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5936 to 3104. [2020-01-16 17:56:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-01-16 17:56:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15513 transitions. [2020-01-16 17:56:13,036 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15513 transitions. Word has length 31 [2020-01-16 17:56:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:13,036 INFO L478 AbstractCegarLoop]: Abstraction has 3104 states and 15513 transitions. [2020-01-16 17:56:13,036 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:13,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15513 transitions. [2020-01-16 17:56:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:13,041 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:13,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:13,041 INFO L426 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:13,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1612839400, now seen corresponding path program 361 times [2020-01-16 17:56:13,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:13,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254730048] [2020-01-16 17:56:13,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:13,680 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:13,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254730048] [2020-01-16 17:56:13,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:13,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:13,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503586641] [2020-01-16 17:56:13,691 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:13,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:13,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:13,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:13,691 INFO L87 Difference]: Start difference. First operand 3104 states and 15513 transitions. Second operand 12 states. [2020-01-16 17:56:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:13,926 INFO L93 Difference]: Finished difference Result 6011 states and 26822 transitions. [2020-01-16 17:56:13,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:13,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:13,940 INFO L225 Difference]: With dead ends: 6011 [2020-01-16 17:56:13,940 INFO L226 Difference]: Without dead ends: 5992 [2020-01-16 17:56:13,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-01-16 17:56:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3127. [2020-01-16 17:56:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:56:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15606 transitions. [2020-01-16 17:56:14,161 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15606 transitions. Word has length 31 [2020-01-16 17:56:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:14,161 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15606 transitions. [2020-01-16 17:56:14,161 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15606 transitions. [2020-01-16 17:56:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:14,166 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:14,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:14,166 INFO L426 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:14,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1190353674, now seen corresponding path program 362 times [2020-01-16 17:56:14,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:14,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992478272] [2020-01-16 17:56:14,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:14,706 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:56:14,836 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:14,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992478272] [2020-01-16 17:56:14,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:14,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:14,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228024828] [2020-01-16 17:56:14,845 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:14,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:14,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:14,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:14,845 INFO L87 Difference]: Start difference. First operand 3127 states and 15606 transitions. Second operand 12 states. [2020-01-16 17:56:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:15,074 INFO L93 Difference]: Finished difference Result 6008 states and 26811 transitions. [2020-01-16 17:56:15,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:15,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:15,089 INFO L225 Difference]: With dead ends: 6008 [2020-01-16 17:56:15,089 INFO L226 Difference]: Without dead ends: 5987 [2020-01-16 17:56:15,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:15,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-01-16 17:56:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3122. [2020-01-16 17:56:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:56:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15592 transitions. [2020-01-16 17:56:15,310 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15592 transitions. Word has length 31 [2020-01-16 17:56:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:15,311 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15592 transitions. [2020-01-16 17:56:15,311 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15592 transitions. [2020-01-16 17:56:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:15,316 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:15,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:15,316 INFO L426 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1188528164, now seen corresponding path program 363 times [2020-01-16 17:56:15,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:15,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526322146] [2020-01-16 17:56:15,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:15,977 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:15,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526322146] [2020-01-16 17:56:15,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:15,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:15,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459044519] [2020-01-16 17:56:15,987 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:15,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:15,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:15,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:15,988 INFO L87 Difference]: Start difference. First operand 3122 states and 15592 transitions. Second operand 12 states. [2020-01-16 17:56:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:16,236 INFO L93 Difference]: Finished difference Result 6018 states and 26834 transitions. [2020-01-16 17:56:16,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:16,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:16,251 INFO L225 Difference]: With dead ends: 6018 [2020-01-16 17:56:16,251 INFO L226 Difference]: Without dead ends: 5999 [2020-01-16 17:56:16,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2020-01-16 17:56:16,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3130. [2020-01-16 17:56:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:56:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15607 transitions. [2020-01-16 17:56:16,516 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15607 transitions. Word has length 31 [2020-01-16 17:56:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:16,516 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15607 transitions. [2020-01-16 17:56:16,516 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15607 transitions. [2020-01-16 17:56:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:16,521 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:16,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:16,521 INFO L426 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:16,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:16,522 INFO L82 PathProgramCache]: Analyzing trace with hash -78929014, now seen corresponding path program 364 times [2020-01-16 17:56:16,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:16,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416591463] [2020-01-16 17:56:16,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:17,057 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:56:17,188 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:56:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:17,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416591463] [2020-01-16 17:56:17,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:17,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:17,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195439488] [2020-01-16 17:56:17,197 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:17,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:17,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:17,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:17,198 INFO L87 Difference]: Start difference. First operand 3130 states and 15607 transitions. Second operand 12 states. [2020-01-16 17:56:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:17,431 INFO L93 Difference]: Finished difference Result 6019 states and 26828 transitions. [2020-01-16 17:56:17,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:17,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:17,446 INFO L225 Difference]: With dead ends: 6019 [2020-01-16 17:56:17,447 INFO L226 Difference]: Without dead ends: 5991 [2020-01-16 17:56:17,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2020-01-16 17:56:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3122. [2020-01-16 17:56:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:56:17,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15587 transitions. [2020-01-16 17:56:17,671 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15587 transitions. Word has length 31 [2020-01-16 17:56:17,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:17,671 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15587 transitions. [2020-01-16 17:56:17,671 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15587 transitions. [2020-01-16 17:56:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:17,677 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:17,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:17,677 INFO L426 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:17,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:17,677 INFO L82 PathProgramCache]: Analyzing trace with hash 553886820, now seen corresponding path program 365 times [2020-01-16 17:56:17,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:17,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765989529] [2020-01-16 17:56:17,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:18,207 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:56:18,339 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:56:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:18,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765989529] [2020-01-16 17:56:18,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:18,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:18,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204105428] [2020-01-16 17:56:18,349 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:18,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:18,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:18,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:18,349 INFO L87 Difference]: Start difference. First operand 3122 states and 15587 transitions. Second operand 12 states. [2020-01-16 17:56:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:18,576 INFO L93 Difference]: Finished difference Result 6009 states and 26808 transitions. [2020-01-16 17:56:18,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:18,577 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:18,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:18,592 INFO L225 Difference]: With dead ends: 6009 [2020-01-16 17:56:18,592 INFO L226 Difference]: Without dead ends: 5993 [2020-01-16 17:56:18,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-01-16 17:56:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3127. [2020-01-16 17:56:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:56:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15596 transitions. [2020-01-16 17:56:18,818 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15596 transitions. Word has length 31 [2020-01-16 17:56:18,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:18,818 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15596 transitions. [2020-01-16 17:56:18,818 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:18,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15596 transitions. [2020-01-16 17:56:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:18,823 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:18,823 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:18,823 INFO L426 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:18,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:18,823 INFO L82 PathProgramCache]: Analyzing trace with hash -291084632, now seen corresponding path program 366 times [2020-01-16 17:56:18,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:18,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928361524] [2020-01-16 17:56:18,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:19,463 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:56:19,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-01-16 17:56:19,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928361524] [2020-01-16 17:56:19,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:19,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:19,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479554015] [2020-01-16 17:56:19,472 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:19,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:19,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:19,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:19,473 INFO L87 Difference]: Start difference. First operand 3127 states and 15596 transitions. Second operand 12 states. [2020-01-16 17:56:19,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:19,744 INFO L93 Difference]: Finished difference Result 6013 states and 26811 transitions. [2020-01-16 17:56:19,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:19,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:19,760 INFO L225 Difference]: With dead ends: 6013 [2020-01-16 17:56:19,760 INFO L226 Difference]: Without dead ends: 5983 [2020-01-16 17:56:19,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-01-16 17:56:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3117. [2020-01-16 17:56:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-01-16 17:56:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15573 transitions. [2020-01-16 17:56:19,985 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15573 transitions. Word has length 31 [2020-01-16 17:56:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:19,985 INFO L478 AbstractCegarLoop]: Abstraction has 3117 states and 15573 transitions. [2020-01-16 17:56:19,985 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15573 transitions. [2020-01-16 17:56:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:19,991 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:19,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:19,991 INFO L426 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:19,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:19,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1344092972, now seen corresponding path program 367 times [2020-01-16 17:56:19,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:19,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665479076] [2020-01-16 17:56:19,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:20,519 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:56:20,648 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:20,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665479076] [2020-01-16 17:56:20,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:20,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:20,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212712445] [2020-01-16 17:56:20,658 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:20,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:20,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:20,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:20,659 INFO L87 Difference]: Start difference. First operand 3117 states and 15573 transitions. Second operand 12 states. [2020-01-16 17:56:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:20,891 INFO L93 Difference]: Finished difference Result 6006 states and 26805 transitions. [2020-01-16 17:56:20,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:20,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:20,907 INFO L225 Difference]: With dead ends: 6006 [2020-01-16 17:56:20,907 INFO L226 Difference]: Without dead ends: 5987 [2020-01-16 17:56:20,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-01-16 17:56:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3127. [2020-01-16 17:56:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:56:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15601 transitions. [2020-01-16 17:56:21,133 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15601 transitions. Word has length 31 [2020-01-16 17:56:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:21,133 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15601 transitions. [2020-01-16 17:56:21,133 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15601 transitions. [2020-01-16 17:56:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:21,138 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:21,138 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:21,138 INFO L426 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:21,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:21,138 INFO L82 PathProgramCache]: Analyzing trace with hash 921607246, now seen corresponding path program 368 times [2020-01-16 17:56:21,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:21,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066428581] [2020-01-16 17:56:21,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:21,680 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:56:21,815 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:21,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066428581] [2020-01-16 17:56:21,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:21,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:21,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049882834] [2020-01-16 17:56:21,825 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:21,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:21,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:21,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:21,826 INFO L87 Difference]: Start difference. First operand 3127 states and 15601 transitions. Second operand 12 states. [2020-01-16 17:56:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:22,050 INFO L93 Difference]: Finished difference Result 6003 states and 26794 transitions. [2020-01-16 17:56:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:22,050 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:22,065 INFO L225 Difference]: With dead ends: 6003 [2020-01-16 17:56:22,065 INFO L226 Difference]: Without dead ends: 5982 [2020-01-16 17:56:22,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-01-16 17:56:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3122. [2020-01-16 17:56:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:56:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15587 transitions. [2020-01-16 17:56:22,286 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15587 transitions. Word has length 31 [2020-01-16 17:56:22,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:22,286 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15587 transitions. [2020-01-16 17:56:22,286 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15587 transitions. [2020-01-16 17:56:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:22,291 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:22,291 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:22,292 INFO L426 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:22,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:22,292 INFO L82 PathProgramCache]: Analyzing trace with hash 495470500, now seen corresponding path program 369 times [2020-01-16 17:56:22,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:22,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119161679] [2020-01-16 17:56:22,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:22,823 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:56:22,954 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:56:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:22,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119161679] [2020-01-16 17:56:22,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:22,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:22,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030873075] [2020-01-16 17:56:22,964 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:22,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:22,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:22,964 INFO L87 Difference]: Start difference. First operand 3122 states and 15587 transitions. Second operand 12 states. [2020-01-16 17:56:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:23,188 INFO L93 Difference]: Finished difference Result 6008 states and 26805 transitions. [2020-01-16 17:56:23,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:23,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:23,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:23,202 INFO L225 Difference]: With dead ends: 6008 [2020-01-16 17:56:23,203 INFO L226 Difference]: Without dead ends: 5989 [2020-01-16 17:56:23,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:23,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-01-16 17:56:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3128. [2020-01-16 17:56:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:56:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15598 transitions. [2020-01-16 17:56:23,429 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15598 transitions. Word has length 31 [2020-01-16 17:56:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:23,429 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15598 transitions. [2020-01-16 17:56:23,429 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15598 transitions. [2020-01-16 17:56:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:23,434 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:23,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:23,434 INFO L426 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:23,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1616958130, now seen corresponding path program 370 times [2020-01-16 17:56:23,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:23,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664211426] [2020-01-16 17:56:23,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:23,965 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:56:24,094 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:56:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:24,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664211426] [2020-01-16 17:56:24,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:24,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:24,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302903493] [2020-01-16 17:56:24,105 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:24,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:24,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:24,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:24,105 INFO L87 Difference]: Start difference. First operand 3128 states and 15598 transitions. Second operand 12 states. [2020-01-16 17:56:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:24,351 INFO L93 Difference]: Finished difference Result 6006 states and 26795 transitions. [2020-01-16 17:56:24,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:24,351 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:24,366 INFO L225 Difference]: With dead ends: 6006 [2020-01-16 17:56:24,366 INFO L226 Difference]: Without dead ends: 5983 [2020-01-16 17:56:24,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-01-16 17:56:24,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3122. [2020-01-16 17:56:24,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:56:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15582 transitions. [2020-01-16 17:56:24,632 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15582 transitions. Word has length 31 [2020-01-16 17:56:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:24,633 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15582 transitions. [2020-01-16 17:56:24,633 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15582 transitions. [2020-01-16 17:56:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:24,638 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:24,638 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:24,638 INFO L426 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:24,638 INFO L82 PathProgramCache]: Analyzing trace with hash -139170844, now seen corresponding path program 371 times [2020-01-16 17:56:24,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:24,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868668822] [2020-01-16 17:56:24,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:25,168 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:56:25,302 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:25,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868668822] [2020-01-16 17:56:25,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:25,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:25,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555932825] [2020-01-16 17:56:25,311 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:25,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:25,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:25,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:25,311 INFO L87 Difference]: Start difference. First operand 3122 states and 15582 transitions. Second operand 12 states. [2020-01-16 17:56:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:25,532 INFO L93 Difference]: Finished difference Result 6001 states and 26785 transitions. [2020-01-16 17:56:25,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:25,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:25,547 INFO L225 Difference]: With dead ends: 6001 [2020-01-16 17:56:25,547 INFO L226 Difference]: Without dead ends: 5985 [2020-01-16 17:56:25,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:25,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2020-01-16 17:56:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 3127. [2020-01-16 17:56:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:56:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15591 transitions. [2020-01-16 17:56:25,773 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15591 transitions. Word has length 31 [2020-01-16 17:56:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:25,773 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15591 transitions. [2020-01-16 17:56:25,773 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15591 transitions. [2020-01-16 17:56:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:25,778 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:25,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:25,779 INFO L426 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:25,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1829113748, now seen corresponding path program 372 times [2020-01-16 17:56:25,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:25,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761070947] [2020-01-16 17:56:25,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:26,305 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:56:26,434 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:56:26,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:26,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761070947] [2020-01-16 17:56:26,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:26,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:26,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317100521] [2020-01-16 17:56:26,444 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:26,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:26,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:26,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:26,445 INFO L87 Difference]: Start difference. First operand 3127 states and 15591 transitions. Second operand 12 states. [2020-01-16 17:56:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:26,675 INFO L93 Difference]: Finished difference Result 6002 states and 26782 transitions. [2020-01-16 17:56:26,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:26,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:26,690 INFO L225 Difference]: With dead ends: 6002 [2020-01-16 17:56:26,690 INFO L226 Difference]: Without dead ends: 5975 [2020-01-16 17:56:26,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:26,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-01-16 17:56:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3117. [2020-01-16 17:56:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-01-16 17:56:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15568 transitions. [2020-01-16 17:56:26,912 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15568 transitions. Word has length 31 [2020-01-16 17:56:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:26,912 INFO L478 AbstractCegarLoop]: Abstraction has 3117 states and 15568 transitions. [2020-01-16 17:56:26,912 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15568 transitions. [2020-01-16 17:56:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:26,917 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:26,917 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:26,917 INFO L426 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:26,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:26,918 INFO L82 PathProgramCache]: Analyzing trace with hash 651035308, now seen corresponding path program 373 times [2020-01-16 17:56:26,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:26,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689002394] [2020-01-16 17:56:26,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:27,449 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:56:27,581 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:56:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:27,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689002394] [2020-01-16 17:56:27,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:27,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:27,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146219639] [2020-01-16 17:56:27,590 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:27,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:27,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:27,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:27,591 INFO L87 Difference]: Start difference. First operand 3117 states and 15568 transitions. Second operand 12 states. [2020-01-16 17:56:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:27,904 INFO L93 Difference]: Finished difference Result 6022 states and 26841 transitions. [2020-01-16 17:56:27,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:27,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:27,919 INFO L225 Difference]: With dead ends: 6022 [2020-01-16 17:56:27,919 INFO L226 Difference]: Without dead ends: 6003 [2020-01-16 17:56:27,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:28,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-01-16 17:56:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3131. [2020-01-16 17:56:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:56:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15606 transitions. [2020-01-16 17:56:28,151 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15606 transitions. Word has length 31 [2020-01-16 17:56:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:28,151 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15606 transitions. [2020-01-16 17:56:28,151 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15606 transitions. [2020-01-16 17:56:28,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:28,157 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:28,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:28,157 INFO L426 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:28,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:28,157 INFO L82 PathProgramCache]: Analyzing trace with hash -616421870, now seen corresponding path program 374 times [2020-01-16 17:56:28,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:28,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718985196] [2020-01-16 17:56:28,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:28,698 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:56:28,830 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:28,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718985196] [2020-01-16 17:56:28,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:28,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:28,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973252639] [2020-01-16 17:56:28,839 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:28,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:28,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:28,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:28,839 INFO L87 Difference]: Start difference. First operand 3131 states and 15606 transitions. Second operand 12 states. [2020-01-16 17:56:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:29,082 INFO L93 Difference]: Finished difference Result 6023 states and 26835 transitions. [2020-01-16 17:56:29,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:29,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:29,097 INFO L225 Difference]: With dead ends: 6023 [2020-01-16 17:56:29,097 INFO L226 Difference]: Without dead ends: 5995 [2020-01-16 17:56:29,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-01-16 17:56:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 3123. [2020-01-16 17:56:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:56:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15585 transitions. [2020-01-16 17:56:29,319 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15585 transitions. Word has length 31 [2020-01-16 17:56:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:29,320 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15585 transitions. [2020-01-16 17:56:29,320 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15585 transitions. [2020-01-16 17:56:29,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:29,326 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:29,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:29,326 INFO L426 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:29,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash 226724072, now seen corresponding path program 375 times [2020-01-16 17:56:29,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:29,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322403862] [2020-01-16 17:56:29,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:29,981 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:56:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:29,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322403862] [2020-01-16 17:56:29,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:29,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:29,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518009300] [2020-01-16 17:56:29,992 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:29,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:29,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:29,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:29,992 INFO L87 Difference]: Start difference. First operand 3123 states and 15585 transitions. Second operand 12 states. [2020-01-16 17:56:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:30,229 INFO L93 Difference]: Finished difference Result 6017 states and 26823 transitions. [2020-01-16 17:56:30,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:30,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:30,245 INFO L225 Difference]: With dead ends: 6017 [2020-01-16 17:56:30,245 INFO L226 Difference]: Without dead ends: 5998 [2020-01-16 17:56:30,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-01-16 17:56:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3129. [2020-01-16 17:56:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:56:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15596 transitions. [2020-01-16 17:56:30,469 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15596 transitions. Word has length 31 [2020-01-16 17:56:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:30,469 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15596 transitions. [2020-01-16 17:56:30,469 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:30,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15596 transitions. [2020-01-16 17:56:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:30,475 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:30,475 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:30,475 INFO L426 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:30,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:30,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1885704558, now seen corresponding path program 376 times [2020-01-16 17:56:30,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:30,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172670314] [2020-01-16 17:56:30,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:30,999 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:56:31,135 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:56:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:31,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172670314] [2020-01-16 17:56:31,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:31,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:31,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983365048] [2020-01-16 17:56:31,145 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:31,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:31,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:31,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:31,146 INFO L87 Difference]: Start difference. First operand 3129 states and 15596 transitions. Second operand 12 states. [2020-01-16 17:56:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:31,392 INFO L93 Difference]: Finished difference Result 6015 states and 26813 transitions. [2020-01-16 17:56:31,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:31,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:31,407 INFO L225 Difference]: With dead ends: 6015 [2020-01-16 17:56:31,408 INFO L226 Difference]: Without dead ends: 5992 [2020-01-16 17:56:31,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-01-16 17:56:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3123. [2020-01-16 17:56:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:56:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15579 transitions. [2020-01-16 17:56:31,630 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15579 transitions. Word has length 31 [2020-01-16 17:56:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:31,631 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15579 transitions. [2020-01-16 17:56:31,631 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15579 transitions. [2020-01-16 17:56:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:31,636 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:31,636 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:31,636 INFO L426 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:31,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:31,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1677199960, now seen corresponding path program 377 times [2020-01-16 17:56:31,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:31,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514782771] [2020-01-16 17:56:31,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:32,174 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:56:32,300 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:32,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514782771] [2020-01-16 17:56:32,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:32,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:32,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490178365] [2020-01-16 17:56:32,309 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:32,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:32,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:32,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:32,309 INFO L87 Difference]: Start difference. First operand 3123 states and 15579 transitions. Second operand 12 states. [2020-01-16 17:56:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:32,554 INFO L93 Difference]: Finished difference Result 6019 states and 26821 transitions. [2020-01-16 17:56:32,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:32,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:32,568 INFO L225 Difference]: With dead ends: 6019 [2020-01-16 17:56:32,568 INFO L226 Difference]: Without dead ends: 5999 [2020-01-16 17:56:32,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2020-01-16 17:56:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3129. [2020-01-16 17:56:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:56:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15590 transitions. [2020-01-16 17:56:32,834 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15590 transitions. Word has length 31 [2020-01-16 17:56:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:32,834 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15590 transitions. [2020-01-16 17:56:32,834 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15590 transitions. [2020-01-16 17:56:32,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:32,840 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:32,840 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:32,840 INFO L426 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:32,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:32,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1772795884, now seen corresponding path program 378 times [2020-01-16 17:56:32,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:32,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96237376] [2020-01-16 17:56:32,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:33,366 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:56:33,493 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:33,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96237376] [2020-01-16 17:56:33,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:33,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:33,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877191411] [2020-01-16 17:56:33,503 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:33,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:33,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:33,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:33,504 INFO L87 Difference]: Start difference. First operand 3129 states and 15590 transitions. Second operand 12 states. [2020-01-16 17:56:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:33,796 INFO L93 Difference]: Finished difference Result 6016 states and 26809 transitions. [2020-01-16 17:56:33,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:33,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:33,812 INFO L225 Difference]: With dead ends: 6016 [2020-01-16 17:56:33,812 INFO L226 Difference]: Without dead ends: 5987 [2020-01-16 17:56:33,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-01-16 17:56:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3117. [2020-01-16 17:56:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-01-16 17:56:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15563 transitions. [2020-01-16 17:56:34,039 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15563 transitions. Word has length 31 [2020-01-16 17:56:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:34,039 INFO L478 AbstractCegarLoop]: Abstraction has 3117 states and 15563 transitions. [2020-01-16 17:56:34,039 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15563 transitions. [2020-01-16 17:56:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:34,045 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:34,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:34,045 INFO L426 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:34,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:34,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2029504398, now seen corresponding path program 379 times [2020-01-16 17:56:34,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:34,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11078049] [2020-01-16 17:56:34,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:34,569 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:56:34,697 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:56:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:34,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11078049] [2020-01-16 17:56:34,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:34,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:34,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106249152] [2020-01-16 17:56:34,707 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:34,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:34,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:34,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:34,708 INFO L87 Difference]: Start difference. First operand 3117 states and 15563 transitions. Second operand 12 states. [2020-01-16 17:56:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:34,931 INFO L93 Difference]: Finished difference Result 6005 states and 26793 transitions. [2020-01-16 17:56:34,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:34,931 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:34,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:34,946 INFO L225 Difference]: With dead ends: 6005 [2020-01-16 17:56:34,946 INFO L226 Difference]: Without dead ends: 5989 [2020-01-16 17:56:34,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-01-16 17:56:35,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3127. [2020-01-16 17:56:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:56:35,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15591 transitions. [2020-01-16 17:56:35,172 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15591 transitions. Word has length 31 [2020-01-16 17:56:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:35,172 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15591 transitions. [2020-01-16 17:56:35,173 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15591 transitions. [2020-01-16 17:56:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:35,178 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:35,178 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:35,178 INFO L426 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:35,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1184532946, now seen corresponding path program 380 times [2020-01-16 17:56:35,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:35,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252658627] [2020-01-16 17:56:35,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:35,708 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:56:35,835 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:56:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:35,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252658627] [2020-01-16 17:56:35,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:35,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:35,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169086866] [2020-01-16 17:56:35,845 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:35,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:35,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:35,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:35,845 INFO L87 Difference]: Start difference. First operand 3127 states and 15591 transitions. Second operand 12 states. [2020-01-16 17:56:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:36,069 INFO L93 Difference]: Finished difference Result 6009 states and 26796 transitions. [2020-01-16 17:56:36,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:36,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:36,084 INFO L225 Difference]: With dead ends: 6009 [2020-01-16 17:56:36,084 INFO L226 Difference]: Without dead ends: 5984 [2020-01-16 17:56:36,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-01-16 17:56:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3122. [2020-01-16 17:56:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:56:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15577 transitions. [2020-01-16 17:56:36,311 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15577 transitions. Word has length 31 [2020-01-16 17:56:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:36,311 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15577 transitions. [2020-01-16 17:56:36,311 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15577 transitions. [2020-01-16 17:56:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:36,316 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:36,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:36,317 INFO L426 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:36,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:36,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1605193162, now seen corresponding path program 381 times [2020-01-16 17:56:36,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:36,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560785446] [2020-01-16 17:56:36,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:36,977 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:56:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:36,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560785446] [2020-01-16 17:56:36,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:36,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:36,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400412605] [2020-01-16 17:56:36,987 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:36,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:36,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:36,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:36,987 INFO L87 Difference]: Start difference. First operand 3122 states and 15577 transitions. Second operand 12 states. [2020-01-16 17:56:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:37,258 INFO L93 Difference]: Finished difference Result 6002 states and 26782 transitions. [2020-01-16 17:56:37,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:37,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:37,273 INFO L225 Difference]: With dead ends: 6002 [2020-01-16 17:56:37,273 INFO L226 Difference]: Without dead ends: 5986 [2020-01-16 17:56:37,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2020-01-16 17:56:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 3127. [2020-01-16 17:56:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:56:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15586 transitions. [2020-01-16 17:56:37,497 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15586 transitions. Word has length 31 [2020-01-16 17:56:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:37,497 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15586 transitions. [2020-01-16 17:56:37,497 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15586 transitions. [2020-01-16 17:56:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:37,503 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:37,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:37,503 INFO L426 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:37,503 INFO L82 PathProgramCache]: Analyzing trace with hash -84749742, now seen corresponding path program 382 times [2020-01-16 17:56:37,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:37,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789406785] [2020-01-16 17:56:37,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:38,041 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:56:38,169 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:38,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789406785] [2020-01-16 17:56:38,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:38,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:38,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072264837] [2020-01-16 17:56:38,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:38,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:38,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:38,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:38,178 INFO L87 Difference]: Start difference. First operand 3127 states and 15586 transitions. Second operand 12 states. [2020-01-16 17:56:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:38,419 INFO L93 Difference]: Finished difference Result 6003 states and 26779 transitions. [2020-01-16 17:56:38,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:38,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:38,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:38,433 INFO L225 Difference]: With dead ends: 6003 [2020-01-16 17:56:38,433 INFO L226 Difference]: Without dead ends: 5981 [2020-01-16 17:56:38,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-01-16 17:56:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3122. [2020-01-16 17:56:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:56:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15572 transitions. [2020-01-16 17:56:38,656 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15572 transitions. Word has length 31 [2020-01-16 17:56:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:38,656 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15572 transitions. [2020-01-16 17:56:38,656 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15572 transitions. [2020-01-16 17:56:38,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:38,661 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:38,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:38,661 INFO L426 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:38,661 INFO L82 PathProgramCache]: Analyzing trace with hash 335910474, now seen corresponding path program 383 times [2020-01-16 17:56:38,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:38,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501814961] [2020-01-16 17:56:38,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:39,194 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:56:39,329 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:39,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501814961] [2020-01-16 17:56:39,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:39,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:39,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904253210] [2020-01-16 17:56:39,338 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:39,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:39,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:39,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:39,338 INFO L87 Difference]: Start difference. First operand 3122 states and 15572 transitions. Second operand 12 states. [2020-01-16 17:56:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:39,574 INFO L93 Difference]: Finished difference Result 6011 states and 26796 transitions. [2020-01-16 17:56:39,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:39,575 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:39,589 INFO L225 Difference]: With dead ends: 6011 [2020-01-16 17:56:39,589 INFO L226 Difference]: Without dead ends: 5991 [2020-01-16 17:56:39,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2020-01-16 17:56:39,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3128. [2020-01-16 17:56:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:56:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-01-16 17:56:39,811 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-01-16 17:56:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:39,811 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-01-16 17:56:39,811 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-01-16 17:56:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:39,816 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:39,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:39,816 INFO L426 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:39,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash -509060978, now seen corresponding path program 384 times [2020-01-16 17:56:39,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:39,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122312936] [2020-01-16 17:56:39,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:40,352 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:56:40,481 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:40,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122312936] [2020-01-16 17:56:40,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:40,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:40,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363833103] [2020-01-16 17:56:40,491 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:40,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:40,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:40,492 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-01-16 17:56:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:40,793 INFO L93 Difference]: Finished difference Result 6008 states and 26784 transitions. [2020-01-16 17:56:40,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:40,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:40,809 INFO L225 Difference]: With dead ends: 6008 [2020-01-16 17:56:40,809 INFO L226 Difference]: Without dead ends: 5975 [2020-01-16 17:56:40,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-01-16 17:56:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3112. [2020-01-16 17:56:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-01-16 17:56:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15549 transitions. [2020-01-16 17:56:41,081 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15549 transitions. Word has length 31 [2020-01-16 17:56:41,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:41,081 INFO L478 AbstractCegarLoop]: Abstraction has 3112 states and 15549 transitions. [2020-01-16 17:56:41,081 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15549 transitions. [2020-01-16 17:56:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:41,086 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:41,086 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:41,086 INFO L426 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:41,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:41,087 INFO L82 PathProgramCache]: Analyzing trace with hash 112344062, now seen corresponding path program 385 times [2020-01-16 17:56:41,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:41,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123853114] [2020-01-16 17:56:41,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:41,734 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:41,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-01-16 17:56:41,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123853114] [2020-01-16 17:56:41,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:41,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:41,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048706281] [2020-01-16 17:56:41,744 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:41,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:41,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:41,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:41,744 INFO L87 Difference]: Start difference. First operand 3112 states and 15549 transitions. Second operand 12 states. [2020-01-16 17:56:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:42,028 INFO L93 Difference]: Finished difference Result 6036 states and 26879 transitions. [2020-01-16 17:56:42,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:42,029 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:42,043 INFO L225 Difference]: With dead ends: 6036 [2020-01-16 17:56:42,043 INFO L226 Difference]: Without dead ends: 6017 [2020-01-16 17:56:42,044 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-01-16 17:56:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3130. [2020-01-16 17:56:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:56:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15610 transitions. [2020-01-16 17:56:42,264 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15610 transitions. Word has length 31 [2020-01-16 17:56:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:42,264 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15610 transitions. [2020-01-16 17:56:42,264 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15610 transitions. [2020-01-16 17:56:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:42,269 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:42,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:42,269 INFO L426 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:42,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:42,270 INFO L82 PathProgramCache]: Analyzing trace with hash -310141664, now seen corresponding path program 386 times [2020-01-16 17:56:42,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:42,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854785826] [2020-01-16 17:56:42,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:42,797 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:56:42,927 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:42,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854785826] [2020-01-16 17:56:42,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:42,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:42,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722769760] [2020-01-16 17:56:42,937 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:42,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:42,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:42,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:42,937 INFO L87 Difference]: Start difference. First operand 3130 states and 15610 transitions. Second operand 12 states. [2020-01-16 17:56:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:43,180 INFO L93 Difference]: Finished difference Result 6033 states and 26868 transitions. [2020-01-16 17:56:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:43,180 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:43,195 INFO L225 Difference]: With dead ends: 6033 [2020-01-16 17:56:43,195 INFO L226 Difference]: Without dead ends: 6012 [2020-01-16 17:56:43,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-01-16 17:56:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3125. [2020-01-16 17:56:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:56:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15596 transitions. [2020-01-16 17:56:43,417 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15596 transitions. Word has length 31 [2020-01-16 17:56:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:43,418 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15596 transitions. [2020-01-16 17:56:43,418 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15596 transitions. [2020-01-16 17:56:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:43,423 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:43,423 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:43,423 INFO L426 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:43,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:43,423 INFO L82 PathProgramCache]: Analyzing trace with hash -311967174, now seen corresponding path program 387 times [2020-01-16 17:56:43,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:43,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803049883] [2020-01-16 17:56:43,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:43,960 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:56:44,087 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:44,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803049883] [2020-01-16 17:56:44,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:44,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:44,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446350329] [2020-01-16 17:56:44,097 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:44,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:44,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:44,097 INFO L87 Difference]: Start difference. First operand 3125 states and 15596 transitions. Second operand 12 states. [2020-01-16 17:56:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:44,411 INFO L93 Difference]: Finished difference Result 6043 states and 26891 transitions. [2020-01-16 17:56:44,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:44,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:44,426 INFO L225 Difference]: With dead ends: 6043 [2020-01-16 17:56:44,427 INFO L226 Difference]: Without dead ends: 6024 [2020-01-16 17:56:44,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-01-16 17:56:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3133. [2020-01-16 17:56:44,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:56:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15611 transitions. [2020-01-16 17:56:44,648 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15611 transitions. Word has length 31 [2020-01-16 17:56:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:44,649 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15611 transitions. [2020-01-16 17:56:44,649 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15611 transitions. [2020-01-16 17:56:44,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:44,654 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:44,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:44,654 INFO L426 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:44,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:44,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1579424352, now seen corresponding path program 388 times [2020-01-16 17:56:44,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:44,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618839612] [2020-01-16 17:56:44,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:45,194 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:56:45,323 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:56:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:45,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618839612] [2020-01-16 17:56:45,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:45,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:45,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311245833] [2020-01-16 17:56:45,333 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:45,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:45,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:45,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:45,333 INFO L87 Difference]: Start difference. First operand 3133 states and 15611 transitions. Second operand 12 states. [2020-01-16 17:56:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:45,591 INFO L93 Difference]: Finished difference Result 6044 states and 26885 transitions. [2020-01-16 17:56:45,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:45,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:45,607 INFO L225 Difference]: With dead ends: 6044 [2020-01-16 17:56:45,607 INFO L226 Difference]: Without dead ends: 6016 [2020-01-16 17:56:45,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:45,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-01-16 17:56:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3125. [2020-01-16 17:56:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:56:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15591 transitions. [2020-01-16 17:56:45,826 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15591 transitions. Word has length 31 [2020-01-16 17:56:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:45,827 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15591 transitions. [2020-01-16 17:56:45,827 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15591 transitions. [2020-01-16 17:56:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:45,832 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56: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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:45,832 INFO L426 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:45,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:45,832 INFO L82 PathProgramCache]: Analyzing trace with hash -946608518, now seen corresponding path program 389 times [2020-01-16 17:56:45,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:45,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744984212] [2020-01-16 17:56:45,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:46,382 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:56:46,511 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:56: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-01-16 17:56:46,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744984212] [2020-01-16 17:56:46,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:46,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:46,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108026141] [2020-01-16 17:56:46,521 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:46,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:46,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:46,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:46,521 INFO L87 Difference]: Start difference. First operand 3125 states and 15591 transitions. Second operand 12 states. [2020-01-16 17:56:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:46,755 INFO L93 Difference]: Finished difference Result 6034 states and 26865 transitions. [2020-01-16 17:56:46,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:46,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:46,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:46,770 INFO L225 Difference]: With dead ends: 6034 [2020-01-16 17:56:46,770 INFO L226 Difference]: Without dead ends: 6018 [2020-01-16 17:56:46,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-01-16 17:56:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3130. [2020-01-16 17:56:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:56:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15600 transitions. [2020-01-16 17:56:46,994 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15600 transitions. Word has length 31 [2020-01-16 17:56:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:46,994 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15600 transitions. [2020-01-16 17:56:46,994 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15600 transitions. [2020-01-16 17:56:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:46,999 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:46,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:46,999 INFO L426 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:47,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:47,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1791579970, now seen corresponding path program 390 times [2020-01-16 17:56:47,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:47,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748759026] [2020-01-16 17:56:47,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:47,645 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:56:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:47,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748759026] [2020-01-16 17:56:47,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:47,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:47,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288658716] [2020-01-16 17:56:47,655 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:47,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:47,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:47,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:47,655 INFO L87 Difference]: Start difference. First operand 3130 states and 15600 transitions. Second operand 12 states. [2020-01-16 17:56:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:47,959 INFO L93 Difference]: Finished difference Result 6038 states and 26868 transitions. [2020-01-16 17:56:47,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:47,959 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:47,973 INFO L225 Difference]: With dead ends: 6038 [2020-01-16 17:56:47,974 INFO L226 Difference]: Without dead ends: 6008 [2020-01-16 17:56:47,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-01-16 17:56:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3120. [2020-01-16 17:56:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:56:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15577 transitions. [2020-01-16 17:56:48,196 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15577 transitions. Word has length 31 [2020-01-16 17:56:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:48,196 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15577 transitions. [2020-01-16 17:56:48,196 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15577 transitions. [2020-01-16 17:56:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:48,201 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:48,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:48,201 INFO L426 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:48,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:48,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1319215212, now seen corresponding path program 391 times [2020-01-16 17:56:48,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:48,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380414052] [2020-01-16 17:56:48,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:48,731 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:56:48,865 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:56:48,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-01-16 17:56:48,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380414052] [2020-01-16 17:56:48,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:48,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:48,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932859724] [2020-01-16 17:56:48,875 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:48,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:48,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:48,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:48,876 INFO L87 Difference]: Start difference. First operand 3120 states and 15577 transitions. Second operand 12 states. [2020-01-16 17:56:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:49,181 INFO L93 Difference]: Finished difference Result 6041 states and 26884 transitions. [2020-01-16 17:56:49,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:49,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:49,197 INFO L225 Difference]: With dead ends: 6041 [2020-01-16 17:56:49,197 INFO L226 Difference]: Without dead ends: 6022 [2020-01-16 17:56:49,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-01-16 17:56:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3131. [2020-01-16 17:56:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:56:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15608 transitions. [2020-01-16 17:56:49,458 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15608 transitions. Word has length 31 [2020-01-16 17:56:49,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:49,459 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15608 transitions. [2020-01-16 17:56:49,459 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15608 transitions. [2020-01-16 17:56:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:49,464 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:49,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:49,464 INFO L426 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash 896729486, now seen corresponding path program 392 times [2020-01-16 17:56:49,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:49,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480063477] [2020-01-16 17:56:49,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:49,988 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:56:50,119 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:56:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:50,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480063477] [2020-01-16 17:56:50,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:50,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:50,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621422366] [2020-01-16 17:56:50,130 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:50,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:50,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:50,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:50,130 INFO L87 Difference]: Start difference. First operand 3131 states and 15608 transitions. Second operand 12 states. [2020-01-16 17:56:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:50,409 INFO L93 Difference]: Finished difference Result 6038 states and 26873 transitions. [2020-01-16 17:56:50,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:50,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:50,425 INFO L225 Difference]: With dead ends: 6038 [2020-01-16 17:56:50,425 INFO L226 Difference]: Without dead ends: 6017 [2020-01-16 17:56:50,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:50,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-01-16 17:56:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3126. [2020-01-16 17:56:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:56:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15594 transitions. [2020-01-16 17:56:50,652 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15594 transitions. Word has length 31 [2020-01-16 17:56:50,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:50,652 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15594 transitions. [2020-01-16 17:56:50,652 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15594 transitions. [2020-01-16 17:56:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:50,658 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:50,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:50,658 INFO L426 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:50,658 INFO L82 PathProgramCache]: Analyzing trace with hash -590185350, now seen corresponding path program 393 times [2020-01-16 17:56:50,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:50,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51641114] [2020-01-16 17:56:50,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:51,191 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:56:51,324 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:56:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:51,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51641114] [2020-01-16 17:56:51,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:51,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:51,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664114935] [2020-01-16 17:56:51,334 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:51,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:51,335 INFO L87 Difference]: Start difference. First operand 3126 states and 15594 transitions. Second operand 12 states. [2020-01-16 17:56:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:51,613 INFO L93 Difference]: Finished difference Result 6051 states and 26901 transitions. [2020-01-16 17:56:51,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:51,614 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:51,628 INFO L225 Difference]: With dead ends: 6051 [2020-01-16 17:56:51,628 INFO L226 Difference]: Without dead ends: 6032 [2020-01-16 17:56:51,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-01-16 17:56:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3135. [2020-01-16 17:56:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:56:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15611 transitions. [2020-01-16 17:56:51,851 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15611 transitions. Word has length 31 [2020-01-16 17:56:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:51,851 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15611 transitions. [2020-01-16 17:56:51,851 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15611 transitions. [2020-01-16 17:56:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:51,856 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:51,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:51,856 INFO L426 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:51,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash -520075314, now seen corresponding path program 394 times [2020-01-16 17:56:51,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:51,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497765358] [2020-01-16 17:56:51,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:52,399 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:56:52,533 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:56:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:52,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497765358] [2020-01-16 17:56:52,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:52,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:52,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991661594] [2020-01-16 17:56:52,543 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:52,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:52,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:52,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:52,543 INFO L87 Difference]: Start difference. First operand 3135 states and 15611 transitions. Second operand 12 states. [2020-01-16 17:56:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:52,811 INFO L93 Difference]: Finished difference Result 6054 states and 26898 transitions. [2020-01-16 17:56:52,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:52,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:52,825 INFO L225 Difference]: With dead ends: 6054 [2020-01-16 17:56:52,826 INFO L226 Difference]: Without dead ends: 6023 [2020-01-16 17:56:52,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-01-16 17:56:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3126. [2020-01-16 17:56:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:56:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15588 transitions. [2020-01-16 17:56:53,045 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15588 transitions. Word has length 31 [2020-01-16 17:56:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:53,046 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15588 transitions. [2020-01-16 17:56:53,046 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15588 transitions. [2020-01-16 17:56:53,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:53,051 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:53,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:53,051 INFO L426 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:53,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:53,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1224826694, now seen corresponding path program 395 times [2020-01-16 17:56:53,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:53,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145852712] [2020-01-16 17:56:53,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:53,703 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:56:53,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-01-16 17:56:53,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145852712] [2020-01-16 17:56:53,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:53,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:53,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832194243] [2020-01-16 17:56:53,713 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:53,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:53,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:53,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:53,713 INFO L87 Difference]: Start difference. First operand 3126 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:56:54,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:54,074 INFO L93 Difference]: Finished difference Result 6042 states and 26874 transitions. [2020-01-16 17:56:54,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:54,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:54,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:54,089 INFO L225 Difference]: With dead ends: 6042 [2020-01-16 17:56:54,089 INFO L226 Difference]: Without dead ends: 6026 [2020-01-16 17:56:54,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-01-16 17:56:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3132. [2020-01-16 17:56:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:56:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15599 transitions. [2020-01-16 17:56:54,313 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15599 transitions. Word has length 31 [2020-01-16 17:56:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:54,313 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15599 transitions. [2020-01-16 17:56:54,313 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:54,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15599 transitions. [2020-01-16 17:56:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:54,318 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:54,318 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:54,318 INFO L426 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:54,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:54,319 INFO L82 PathProgramCache]: Analyzing trace with hash -732230932, now seen corresponding path program 396 times [2020-01-16 17:56:54,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:54,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615647249] [2020-01-16 17:56:54,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:54,855 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:56:54,981 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:56:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:54,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615647249] [2020-01-16 17:56:54,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:54,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:54,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477129178] [2020-01-16 17:56:54,991 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:54,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:54,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:54,991 INFO L87 Difference]: Start difference. First operand 3132 states and 15599 transitions. Second operand 12 states. [2020-01-16 17:56:55,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:55,316 INFO L93 Difference]: Finished difference Result 6048 states and 26880 transitions. [2020-01-16 17:56:55,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:55,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:55,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:55,331 INFO L225 Difference]: With dead ends: 6048 [2020-01-16 17:56:55,331 INFO L226 Difference]: Without dead ends: 6014 [2020-01-16 17:56:55,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-01-16 17:56:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3120. [2020-01-16 17:56:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:56:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15571 transitions. [2020-01-16 17:56:55,553 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15571 transitions. Word has length 31 [2020-01-16 17:56:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:55,553 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15571 transitions. [2020-01-16 17:56:55,553 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15571 transitions. [2020-01-16 17:56:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:55,558 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:55,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:55,559 INFO L426 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:55,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:55,559 INFO L82 PathProgramCache]: Analyzing trace with hash 626157548, now seen corresponding path program 397 times [2020-01-16 17:56:55,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:55,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409949820] [2020-01-16 17:56:55,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:56,228 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:56:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:56,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409949820] [2020-01-16 17:56:56,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:56,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:56,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504144367] [2020-01-16 17:56:56,238 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:56,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:56,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:56,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:56,239 INFO L87 Difference]: Start difference. First operand 3120 states and 15571 transitions. Second operand 12 states. [2020-01-16 17:56:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:56,529 INFO L93 Difference]: Finished difference Result 6065 states and 26940 transitions. [2020-01-16 17:56:56,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:56,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:56,543 INFO L225 Difference]: With dead ends: 6065 [2020-01-16 17:56:56,543 INFO L226 Difference]: Without dead ends: 6046 [2020-01-16 17:56:56,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-01-16 17:56:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3139. [2020-01-16 17:56:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-01-16 17:56:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15623 transitions. [2020-01-16 17:56:56,770 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15623 transitions. Word has length 31 [2020-01-16 17:56:56,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:56,770 INFO L478 AbstractCegarLoop]: Abstraction has 3139 states and 15623 transitions. [2020-01-16 17:56:56,770 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15623 transitions. [2020-01-16 17:56:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:56,775 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:56,775 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:56,775 INFO L426 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:56,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:56,776 INFO L82 PathProgramCache]: Analyzing trace with hash -641299630, now seen corresponding path program 398 times [2020-01-16 17:56:56,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:56,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288458204] [2020-01-16 17:56:56,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:57,324 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:56:57,458 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:56:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:57,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288458204] [2020-01-16 17:56:57,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:57,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:57,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538274015] [2020-01-16 17:56:57,466 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:57,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:57,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:57,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:57,467 INFO L87 Difference]: Start difference. First operand 3139 states and 15623 transitions. Second operand 12 states. [2020-01-16 17:56:57,839 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-01-16 17:56:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:57,858 INFO L93 Difference]: Finished difference Result 6066 states and 26934 transitions. [2020-01-16 17:56:57,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:57,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:57,874 INFO L225 Difference]: With dead ends: 6066 [2020-01-16 17:56:57,874 INFO L226 Difference]: Without dead ends: 6038 [2020-01-16 17:56:57,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-01-16 17:56:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3131. [2020-01-16 17:56:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:56:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15600 transitions. [2020-01-16 17:56:58,098 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15600 transitions. Word has length 31 [2020-01-16 17:56:58,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:58,098 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15600 transitions. [2020-01-16 17:56:58,098 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15600 transitions. [2020-01-16 17:56:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:58,103 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:58,104 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:58,104 INFO L426 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:58,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:58,104 INFO L82 PathProgramCache]: Analyzing trace with hash -858931778, now seen corresponding path program 399 times [2020-01-16 17:56:58,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:58,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337884653] [2020-01-16 17:56:58,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:58,647 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:56:58,776 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:56:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:56:58,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337884653] [2020-01-16 17:56:58,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:56:58,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:56:58,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900349388] [2020-01-16 17:56:58,786 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:56:58,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:56:58,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:56:58,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:56:58,786 INFO L87 Difference]: Start difference. First operand 3131 states and 15600 transitions. Second operand 12 states. [2020-01-16 17:56:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:56:59,062 INFO L93 Difference]: Finished difference Result 6068 states and 26937 transitions. [2020-01-16 17:56:59,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:56:59,062 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:56:59,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:56:59,077 INFO L225 Difference]: With dead ends: 6068 [2020-01-16 17:56:59,077 INFO L226 Difference]: Without dead ends: 6049 [2020-01-16 17:56:59,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:56:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-01-16 17:56:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3140. [2020-01-16 17:56:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-01-16 17:56:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15617 transitions. [2020-01-16 17:56:59,310 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15617 transitions. Word has length 31 [2020-01-16 17:56:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:56:59,311 INFO L478 AbstractCegarLoop]: Abstraction has 3140 states and 15617 transitions. [2020-01-16 17:56:59,311 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:56:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15617 transitions. [2020-01-16 17:56:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:56:59,317 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:56:59,317 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:56:59,317 INFO L426 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:56:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:56:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash -788821742, now seen corresponding path program 400 times [2020-01-16 17:56:59,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:56:59,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309469860] [2020-01-16 17:56:59,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:56:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:56:59,885 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:57:00,017 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:00,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309469860] [2020-01-16 17:57:00,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:00,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:00,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679044686] [2020-01-16 17:57:00,027 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:00,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:00,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:00,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:00,028 INFO L87 Difference]: Start difference. First operand 3140 states and 15617 transitions. Second operand 12 states. [2020-01-16 17:57:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:00,213 INFO L93 Difference]: Finished difference Result 6071 states and 26934 transitions. [2020-01-16 17:57:00,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:00,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:00,228 INFO L225 Difference]: With dead ends: 6071 [2020-01-16 17:57:00,228 INFO L226 Difference]: Without dead ends: 6040 [2020-01-16 17:57:00,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-01-16 17:57:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3131. [2020-01-16 17:57:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:57:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15591 transitions. [2020-01-16 17:57:00,450 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15591 transitions. Word has length 31 [2020-01-16 17:57:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:00,450 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15591 transitions. [2020-01-16 17:57:00,450 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15591 transitions. [2020-01-16 17:57:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:00,456 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:00,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:00,456 INFO L426 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:00,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:00,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1532111486, now seen corresponding path program 401 times [2020-01-16 17:57:00,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:00,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052481594] [2020-01-16 17:57:00,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:01,006 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:57:01,129 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:57:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:01,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052481594] [2020-01-16 17:57:01,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:01,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:01,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761488796] [2020-01-16 17:57:01,138 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:01,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:01,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:01,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:01,139 INFO L87 Difference]: Start difference. First operand 3131 states and 15591 transitions. Second operand 12 states. [2020-01-16 17:57:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:01,366 INFO L93 Difference]: Finished difference Result 6072 states and 26936 transitions. [2020-01-16 17:57:01,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:01,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:01,382 INFO L225 Difference]: With dead ends: 6072 [2020-01-16 17:57:01,382 INFO L226 Difference]: Without dead ends: 6052 [2020-01-16 17:57:01,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2020-01-16 17:57:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3142. [2020-01-16 17:57:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-01-16 17:57:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15611 transitions. [2020-01-16 17:57:01,609 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15611 transitions. Word has length 31 [2020-01-16 17:57:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:01,609 INFO L478 AbstractCegarLoop]: Abstraction has 3142 states and 15611 transitions. [2020-01-16 17:57:01,609 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15611 transitions. [2020-01-16 17:57:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:01,614 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:01,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:01,615 INFO L426 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:01,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:01,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1425288596, now seen corresponding path program 402 times [2020-01-16 17:57:01,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:01,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841334908] [2020-01-16 17:57:01,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:02,213 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-01-16 17:57:02,345 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-01-16 17:57:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:02,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841334908] [2020-01-16 17:57:02,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:02,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:02,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834142999] [2020-01-16 17:57:02,354 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:02,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:02,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:02,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:02,355 INFO L87 Difference]: Start difference. First operand 3142 states and 15611 transitions. Second operand 12 states. [2020-01-16 17:57:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:02,535 INFO L93 Difference]: Finished difference Result 6074 states and 26930 transitions. [2020-01-16 17:57:02,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:02,536 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:02,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:02,551 INFO L225 Difference]: With dead ends: 6074 [2020-01-16 17:57:02,551 INFO L226 Difference]: Without dead ends: 6030 [2020-01-16 17:57:02,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-01-16 17:57:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3120. [2020-01-16 17:57:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:57:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15563 transitions. [2020-01-16 17:57:02,774 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15563 transitions. Word has length 31 [2020-01-16 17:57:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:02,774 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15563 transitions. [2020-01-16 17:57:02,774 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15563 transitions. [2020-01-16 17:57:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:02,780 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:02,780 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:02,780 INFO L426 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:02,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:02,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2004626638, now seen corresponding path program 403 times [2020-01-16 17:57:02,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:02,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318201872] [2020-01-16 17:57:02,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:03,437 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:57:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:03,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318201872] [2020-01-16 17:57:03,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:03,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:03,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230613500] [2020-01-16 17:57:03,446 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:03,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:03,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:03,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:03,446 INFO L87 Difference]: Start difference. First operand 3120 states and 15563 transitions. Second operand 12 states. [2020-01-16 17:57:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:03,709 INFO L93 Difference]: Finished difference Result 6043 states and 26874 transitions. [2020-01-16 17:57:03,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:03,709 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:03,723 INFO L225 Difference]: With dead ends: 6043 [2020-01-16 17:57:03,723 INFO L226 Difference]: Without dead ends: 6027 [2020-01-16 17:57:03,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-01-16 17:57:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3132. [2020-01-16 17:57:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:57:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15596 transitions. [2020-01-16 17:57:03,954 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15596 transitions. Word has length 31 [2020-01-16 17:57:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:03,954 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15596 transitions. [2020-01-16 17:57:03,954 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15596 transitions. [2020-01-16 17:57:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:03,959 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:03,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:03,959 INFO L426 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:03,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:03,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1159655186, now seen corresponding path program 404 times [2020-01-16 17:57:03,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:03,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756161917] [2020-01-16 17:57:03,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:04,491 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:57:04,622 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:57:04,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-01-16 17:57:04,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756161917] [2020-01-16 17:57:04,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:04,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:04,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475684325] [2020-01-16 17:57:04,632 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:04,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:04,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:04,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:04,632 INFO L87 Difference]: Start difference. First operand 3132 states and 15596 transitions. Second operand 12 states. [2020-01-16 17:57:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:04,876 INFO L93 Difference]: Finished difference Result 6047 states and 26877 transitions. [2020-01-16 17:57:04,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:04,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:04,891 INFO L225 Difference]: With dead ends: 6047 [2020-01-16 17:57:04,891 INFO L226 Difference]: Without dead ends: 6022 [2020-01-16 17:57:04,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-01-16 17:57:05,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3127. [2020-01-16 17:57:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:57:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15582 transitions. [2020-01-16 17:57:05,114 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15582 transitions. Word has length 31 [2020-01-16 17:57:05,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:05,114 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15582 transitions. [2020-01-16 17:57:05,114 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15582 transitions. [2020-01-16 17:57:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:05,119 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:05,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:05,119 INFO L426 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:05,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:05,119 INFO L82 PathProgramCache]: Analyzing trace with hash 519537312, now seen corresponding path program 405 times [2020-01-16 17:57:05,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:05,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027957349] [2020-01-16 17:57:05,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:05,651 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:57:05,779 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-01-16 17:57:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:05,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027957349] [2020-01-16 17:57:05,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:05,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:05,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365661193] [2020-01-16 17:57:05,788 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:05,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:05,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:05,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:05,789 INFO L87 Difference]: Start difference. First operand 3127 states and 15582 transitions. Second operand 12 states. [2020-01-16 17:57:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:06,010 INFO L93 Difference]: Finished difference Result 6046 states and 26874 transitions. [2020-01-16 17:57:06,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:06,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:06,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:06,025 INFO L225 Difference]: With dead ends: 6046 [2020-01-16 17:57:06,025 INFO L226 Difference]: Without dead ends: 6030 [2020-01-16 17:57:06,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-01-16 17:57:06,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3133. [2020-01-16 17:57:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:57:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15593 transitions. [2020-01-16 17:57:06,288 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15593 transitions. Word has length 31 [2020-01-16 17:57:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:06,288 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15593 transitions. [2020-01-16 17:57:06,288 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15593 transitions. [2020-01-16 17:57:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:06,293 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:06,293 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:06,293 INFO L426 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:06,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1012133074, now seen corresponding path program 406 times [2020-01-16 17:57:06,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:06,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492839384] [2020-01-16 17:57:06,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:06,833 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-01-16 17:57:06,963 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-01-16 17:57:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:06,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492839384] [2020-01-16 17:57:06,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:06,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:06,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800749922] [2020-01-16 17:57:06,971 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:06,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:06,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:06,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:06,972 INFO L87 Difference]: Start difference. First operand 3133 states and 15593 transitions. Second operand 12 states. [2020-01-16 17:57:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:07,203 INFO L93 Difference]: Finished difference Result 6052 states and 26880 transitions. [2020-01-16 17:57:07,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:07,204 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:07,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:07,218 INFO L225 Difference]: With dead ends: 6052 [2020-01-16 17:57:07,218 INFO L226 Difference]: Without dead ends: 6024 [2020-01-16 17:57:07,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-01-16 17:57:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3127. [2020-01-16 17:57:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:57:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15576 transitions. [2020-01-16 17:57:07,446 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15576 transitions. Word has length 31 [2020-01-16 17:57:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:07,446 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15576 transitions. [2020-01-16 17:57:07,446 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15576 transitions. [2020-01-16 17:57:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:07,452 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:07,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:07,452 INFO L426 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:07,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:07,452 INFO L82 PathProgramCache]: Analyzing trace with hash -749745376, now seen corresponding path program 407 times [2020-01-16 17:57:07,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:07,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153152850] [2020-01-16 17:57:07,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:08,135 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:57:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:08,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153152850] [2020-01-16 17:57:08,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:08,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:08,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630568119] [2020-01-16 17:57:08,146 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:08,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:08,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:08,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:08,146 INFO L87 Difference]: Start difference. First operand 3127 states and 15576 transitions. Second operand 12 states. [2020-01-16 17:57:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:08,429 INFO L93 Difference]: Finished difference Result 6059 states and 26897 transitions. [2020-01-16 17:57:08,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:08,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:08,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:08,444 INFO L225 Difference]: With dead ends: 6059 [2020-01-16 17:57:08,445 INFO L226 Difference]: Without dead ends: 6039 [2020-01-16 17:57:08,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2020-01-16 17:57:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 3138. [2020-01-16 17:57:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-01-16 17:57:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15596 transitions. [2020-01-16 17:57:08,667 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15596 transitions. Word has length 31 [2020-01-16 17:57:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:08,667 INFO L478 AbstractCegarLoop]: Abstraction has 3138 states and 15596 transitions. [2020-01-16 17:57:08,667 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15596 transitions. [2020-01-16 17:57:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:08,672 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:08,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:08,672 INFO L426 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:08,672 INFO L82 PathProgramCache]: Analyzing trace with hash 587821838, now seen corresponding path program 408 times [2020-01-16 17:57:08,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:08,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428833640] [2020-01-16 17:57:08,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:09,220 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-01-16 17:57:09,346 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-01-16 17:57:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:09,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428833640] [2020-01-16 17:57:09,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:09,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:09,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576814869] [2020-01-16 17:57:09,354 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:09,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:09,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:09,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:09,355 INFO L87 Difference]: Start difference. First operand 3138 states and 15596 transitions. Second operand 12 states. [2020-01-16 17:57:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:09,549 INFO L93 Difference]: Finished difference Result 6061 states and 26891 transitions. [2020-01-16 17:57:09,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:09,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:09,563 INFO L225 Difference]: With dead ends: 6061 [2020-01-16 17:57:09,563 INFO L226 Difference]: Without dead ends: 6013 [2020-01-16 17:57:09,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:09,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-01-16 17:57:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3112. [2020-01-16 17:57:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-01-16 17:57:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15541 transitions. [2020-01-16 17:57:09,786 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15541 transitions. Word has length 31 [2020-01-16 17:57:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:09,786 INFO L478 AbstractCegarLoop]: Abstraction has 3112 states and 15541 transitions. [2020-01-16 17:57:09,786 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15541 transitions. [2020-01-16 17:57:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:09,791 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:09,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:09,791 INFO L426 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:09,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:09,791 INFO L82 PathProgramCache]: Analyzing trace with hash 102392958, now seen corresponding path program 409 times [2020-01-16 17:57:09,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:09,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257776322] [2020-01-16 17:57:09,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:10,328 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:57:10,455 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:10,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257776322] [2020-01-16 17:57:10,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:10,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:10,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654980723] [2020-01-16 17:57:10,464 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:10,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:10,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:10,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:10,464 INFO L87 Difference]: Start difference. First operand 3112 states and 15541 transitions. Second operand 12 states. [2020-01-16 17:57:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:10,695 INFO L93 Difference]: Finished difference Result 6015 states and 26819 transitions. [2020-01-16 17:57:10,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:10,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:10,709 INFO L225 Difference]: With dead ends: 6015 [2020-01-16 17:57:10,709 INFO L226 Difference]: Without dead ends: 5996 [2020-01-16 17:57:10,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-01-16 17:57:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3128. [2020-01-16 17:57:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:57:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15597 transitions. [2020-01-16 17:57:10,927 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15597 transitions. Word has length 31 [2020-01-16 17:57:10,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:10,927 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15597 transitions. [2020-01-16 17:57:10,927 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:10,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15597 transitions. [2020-01-16 17:57:10,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:10,933 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:10,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:10,933 INFO L426 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:10,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:10,933 INFO L82 PathProgramCache]: Analyzing trace with hash -320092768, now seen corresponding path program 410 times [2020-01-16 17:57:10,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:10,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418374914] [2020-01-16 17:57:10,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:11,466 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:57:11,597 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:11,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418374914] [2020-01-16 17:57:11,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:11,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:11,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443226500] [2020-01-16 17:57:11,607 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:11,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:11,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:11,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:11,608 INFO L87 Difference]: Start difference. First operand 3128 states and 15597 transitions. Second operand 12 states. [2020-01-16 17:57:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:11,845 INFO L93 Difference]: Finished difference Result 6012 states and 26808 transitions. [2020-01-16 17:57:11,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:11,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:11,860 INFO L225 Difference]: With dead ends: 6012 [2020-01-16 17:57:11,861 INFO L226 Difference]: Without dead ends: 5991 [2020-01-16 17:57:11,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2020-01-16 17:57:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3123. [2020-01-16 17:57:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:57:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15583 transitions. [2020-01-16 17:57:12,087 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15583 transitions. Word has length 31 [2020-01-16 17:57:12,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:12,088 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15583 transitions. [2020-01-16 17:57:12,088 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15583 transitions. [2020-01-16 17:57:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:12,093 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:12,093 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:12,093 INFO L426 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:12,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash -746229514, now seen corresponding path program 411 times [2020-01-16 17:57:12,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:12,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193942417] [2020-01-16 17:57:12,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:12,752 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:12,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193942417] [2020-01-16 17:57:12,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:12,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:12,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821241068] [2020-01-16 17:57:12,761 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:12,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:12,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:12,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:12,761 INFO L87 Difference]: Start difference. First operand 3123 states and 15583 transitions. Second operand 12 states. [2020-01-16 17:57:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:12,989 INFO L93 Difference]: Finished difference Result 6017 states and 26819 transitions. [2020-01-16 17:57:12,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:12,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:13,004 INFO L225 Difference]: With dead ends: 6017 [2020-01-16 17:57:13,004 INFO L226 Difference]: Without dead ends: 5998 [2020-01-16 17:57:13,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-01-16 17:57:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3129. [2020-01-16 17:57:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:57:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15594 transitions. [2020-01-16 17:57:13,224 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15594 transitions. Word has length 31 [2020-01-16 17:57:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:13,224 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15594 transitions. [2020-01-16 17:57:13,224 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:13,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15594 transitions. [2020-01-16 17:57:13,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:13,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:13,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:13,229 INFO L426 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:13,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1436309152, now seen corresponding path program 412 times [2020-01-16 17:57:13,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:13,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98964864] [2020-01-16 17:57:13,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:13,768 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:57:13,900 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:13,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98964864] [2020-01-16 17:57:13,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:13,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:13,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447520399] [2020-01-16 17:57:13,910 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:13,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:13,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:13,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:13,910 INFO L87 Difference]: Start difference. First operand 3129 states and 15594 transitions. Second operand 12 states. [2020-01-16 17:57:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:14,144 INFO L93 Difference]: Finished difference Result 6015 states and 26809 transitions. [2020-01-16 17:57:14,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:14,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:14,159 INFO L225 Difference]: With dead ends: 6015 [2020-01-16 17:57:14,159 INFO L226 Difference]: Without dead ends: 5992 [2020-01-16 17:57:14,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-01-16 17:57:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3123. [2020-01-16 17:57:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:57:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15578 transitions. [2020-01-16 17:57:14,437 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15578 transitions. Word has length 31 [2020-01-16 17:57:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:14,438 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15578 transitions. [2020-01-16 17:57:14,438 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15578 transitions. [2020-01-16 17:57:14,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:14,443 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:14,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:14,443 INFO L426 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:14,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:14,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1380870858, now seen corresponding path program 413 times [2020-01-16 17:57:14,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:14,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400704968] [2020-01-16 17:57:14,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:14,981 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:57:15,110 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:15,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-01-16 17:57:15,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400704968] [2020-01-16 17:57:15,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:15,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:15,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676058199] [2020-01-16 17:57:15,119 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:15,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:15,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:15,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:15,120 INFO L87 Difference]: Start difference. First operand 3123 states and 15578 transitions. Second operand 12 states. [2020-01-16 17:57:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:15,348 INFO L93 Difference]: Finished difference Result 6010 states and 26799 transitions. [2020-01-16 17:57:15,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:15,349 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:15,363 INFO L225 Difference]: With dead ends: 6010 [2020-01-16 17:57:15,364 INFO L226 Difference]: Without dead ends: 5994 [2020-01-16 17:57:15,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-01-16 17:57:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3128. [2020-01-16 17:57:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:57:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15587 transitions. [2020-01-16 17:57:15,586 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15587 transitions. Word has length 31 [2020-01-16 17:57:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:15,586 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15587 transitions. [2020-01-16 17:57:15,586 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15587 transitions. [2020-01-16 17:57:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:15,591 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:15,591 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:15,591 INFO L426 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:15,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:15,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1224153534, now seen corresponding path program 414 times [2020-01-16 17:57:15,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:15,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246764340] [2020-01-16 17:57:15,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:16,128 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:57:16,259 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:16,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246764340] [2020-01-16 17:57:16,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:16,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:16,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782020848] [2020-01-16 17:57:16,269 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:16,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:16,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:16,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:16,269 INFO L87 Difference]: Start difference. First operand 3128 states and 15587 transitions. Second operand 12 states. [2020-01-16 17:57:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:16,545 INFO L93 Difference]: Finished difference Result 6011 states and 26796 transitions. [2020-01-16 17:57:16,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:16,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:16,560 INFO L225 Difference]: With dead ends: 6011 [2020-01-16 17:57:16,560 INFO L226 Difference]: Without dead ends: 5984 [2020-01-16 17:57:16,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-01-16 17:57:16,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3118. [2020-01-16 17:57:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-01-16 17:57:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15564 transitions. [2020-01-16 17:57:16,788 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15564 transitions. Word has length 31 [2020-01-16 17:57:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:16,789 INFO L478 AbstractCegarLoop]: Abstraction has 3118 states and 15564 transitions. [2020-01-16 17:57:16,789 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15564 transitions. [2020-01-16 17:57:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:16,794 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:16,794 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:16,794 INFO L426 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:16,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1578010536, now seen corresponding path program 415 times [2020-01-16 17:57:16,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:16,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042713814] [2020-01-16 17:57:16,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:17,445 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:17,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:17,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042713814] [2020-01-16 17:57:17,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:17,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:17,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973276103] [2020-01-16 17:57:17,455 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:17,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:17,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:17,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:17,455 INFO L87 Difference]: Start difference. First operand 3118 states and 15564 transitions. Second operand 12 states. [2020-01-16 17:57:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:17,679 INFO L93 Difference]: Finished difference Result 6025 states and 26836 transitions. [2020-01-16 17:57:17,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:17,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:17,693 INFO L225 Difference]: With dead ends: 6025 [2020-01-16 17:57:17,694 INFO L226 Difference]: Without dead ends: 6006 [2020-01-16 17:57:17,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:17,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-01-16 17:57:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3129. [2020-01-16 17:57:17,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:57:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15595 transitions. [2020-01-16 17:57:17,921 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15595 transitions. Word has length 31 [2020-01-16 17:57:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:17,921 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15595 transitions. [2020-01-16 17:57:17,921 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15595 transitions. [2020-01-16 17:57:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:17,926 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:17,926 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:17,926 INFO L426 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:17,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:17,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1155524810, now seen corresponding path program 416 times [2020-01-16 17:57:17,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:17,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994186002] [2020-01-16 17:57:17,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:18,445 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:57:18,572 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:18,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994186002] [2020-01-16 17:57:18,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:18,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:18,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217770667] [2020-01-16 17:57:18,581 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:18,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:18,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:18,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:18,582 INFO L87 Difference]: Start difference. First operand 3129 states and 15595 transitions. Second operand 12 states. [2020-01-16 17:57:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:18,897 INFO L93 Difference]: Finished difference Result 6022 states and 26825 transitions. [2020-01-16 17:57:18,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:18,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:18,912 INFO L225 Difference]: With dead ends: 6022 [2020-01-16 17:57:18,912 INFO L226 Difference]: Without dead ends: 6001 [2020-01-16 17:57:18,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-01-16 17:57:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3124. [2020-01-16 17:57:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:57:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15581 transitions. [2020-01-16 17:57:19,137 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15581 transitions. Word has length 31 [2020-01-16 17:57:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:19,137 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15581 transitions. [2020-01-16 17:57:19,137 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15581 transitions. [2020-01-16 17:57:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:19,143 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:19,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:19,143 INFO L426 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:19,143 INFO L82 PathProgramCache]: Analyzing trace with hash -331390026, now seen corresponding path program 417 times [2020-01-16 17:57:19,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:19,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729286044] [2020-01-16 17:57:19,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:19,799 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:19,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729286044] [2020-01-16 17:57:19,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:19,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:19,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659863898] [2020-01-16 17:57:19,809 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:19,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:19,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:19,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:19,810 INFO L87 Difference]: Start difference. First operand 3124 states and 15581 transitions. Second operand 12 states. [2020-01-16 17:57:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:20,053 INFO L93 Difference]: Finished difference Result 6035 states and 26853 transitions. [2020-01-16 17:57:20,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:20,053 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:20,067 INFO L225 Difference]: With dead ends: 6035 [2020-01-16 17:57:20,068 INFO L226 Difference]: Without dead ends: 6016 [2020-01-16 17:57:20,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-01-16 17:57:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3133. [2020-01-16 17:57:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:57:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15598 transitions. [2020-01-16 17:57:20,293 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15598 transitions. Word has length 31 [2020-01-16 17:57:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:20,294 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15598 transitions. [2020-01-16 17:57:20,294 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15598 transitions. [2020-01-16 17:57:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:20,299 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:20,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:20,299 INFO L426 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:20,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:20,299 INFO L82 PathProgramCache]: Analyzing trace with hash -261279990, now seen corresponding path program 418 times [2020-01-16 17:57:20,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:20,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195484419] [2020-01-16 17:57:20,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:20,832 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:57:20,960 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:20,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-01-16 17:57:20,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195484419] [2020-01-16 17:57:20,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:20,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:20,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741193307] [2020-01-16 17:57:20,970 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:20,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:20,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:20,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:20,970 INFO L87 Difference]: Start difference. First operand 3133 states and 15598 transitions. Second operand 12 states. [2020-01-16 17:57:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:21,173 INFO L93 Difference]: Finished difference Result 6038 states and 26850 transitions. [2020-01-16 17:57:21,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:21,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:21,188 INFO L225 Difference]: With dead ends: 6038 [2020-01-16 17:57:21,188 INFO L226 Difference]: Without dead ends: 6007 [2020-01-16 17:57:21,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-01-16 17:57:21,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3124. [2020-01-16 17:57:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:57:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15575 transitions. [2020-01-16 17:57:21,416 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15575 transitions. Word has length 31 [2020-01-16 17:57:21,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:21,416 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15575 transitions. [2020-01-16 17:57:21,416 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15575 transitions. [2020-01-16 17:57:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:21,421 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:21,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:21,421 INFO L426 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:21,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:21,422 INFO L82 PathProgramCache]: Analyzing trace with hash -966031370, now seen corresponding path program 419 times [2020-01-16 17:57:21,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:21,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148705378] [2020-01-16 17:57:21,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:21,948 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:57:22,079 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:22,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148705378] [2020-01-16 17:57:22,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:22,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:22,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104937994] [2020-01-16 17:57:22,089 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:22,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:22,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:22,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:22,090 INFO L87 Difference]: Start difference. First operand 3124 states and 15575 transitions. Second operand 12 states. [2020-01-16 17:57:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:22,393 INFO L93 Difference]: Finished difference Result 6026 states and 26826 transitions. [2020-01-16 17:57:22,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:22,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:22,409 INFO L225 Difference]: With dead ends: 6026 [2020-01-16 17:57:22,409 INFO L226 Difference]: Without dead ends: 6010 [2020-01-16 17:57:22,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-01-16 17:57:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3130. [2020-01-16 17:57:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:57:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15586 transitions. [2020-01-16 17:57:22,684 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15586 transitions. Word has length 31 [2020-01-16 17:57:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:22,684 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15586 transitions. [2020-01-16 17:57:22,684 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15586 transitions. [2020-01-16 17:57:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:22,689 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:22,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:22,689 INFO L426 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:22,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:22,690 INFO L82 PathProgramCache]: Analyzing trace with hash -473435608, now seen corresponding path program 420 times [2020-01-16 17:57:22,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:22,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339151418] [2020-01-16 17:57:22,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:23,215 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:57:23,344 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:23,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339151418] [2020-01-16 17:57:23,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:23,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:23,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26907163] [2020-01-16 17:57:23,353 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:23,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:23,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:23,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:23,354 INFO L87 Difference]: Start difference. First operand 3130 states and 15586 transitions. Second operand 12 states. [2020-01-16 17:57:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:23,608 INFO L93 Difference]: Finished difference Result 6032 states and 26832 transitions. [2020-01-16 17:57:23,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:23,608 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:23,623 INFO L225 Difference]: With dead ends: 6032 [2020-01-16 17:57:23,623 INFO L226 Difference]: Without dead ends: 5998 [2020-01-16 17:57:23,623 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-01-16 17:57:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3118. [2020-01-16 17:57:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-01-16 17:57:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15558 transitions. [2020-01-16 17:57:23,845 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15558 transitions. Word has length 31 [2020-01-16 17:57:23,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:23,845 INFO L478 AbstractCegarLoop]: Abstraction has 3118 states and 15558 transitions. [2020-01-16 17:57:23,845 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15558 transitions. [2020-01-16 17:57:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:23,850 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:23,850 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:23,850 INFO L426 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash 191895208, now seen corresponding path program 421 times [2020-01-16 17:57:23,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:23,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164937011] [2020-01-16 17:57:23,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:24,368 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:57:24,498 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:24,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164937011] [2020-01-16 17:57:24,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:24,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:24,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15076481] [2020-01-16 17:57:24,508 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:24,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:24,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:24,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:24,508 INFO L87 Difference]: Start difference. First operand 3118 states and 15558 transitions. Second operand 12 states. [2020-01-16 17:57:24,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:24,734 INFO L93 Difference]: Finished difference Result 6031 states and 26847 transitions. [2020-01-16 17:57:24,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:24,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:24,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:24,750 INFO L225 Difference]: With dead ends: 6031 [2020-01-16 17:57:24,750 INFO L226 Difference]: Without dead ends: 6012 [2020-01-16 17:57:24,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-01-16 17:57:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3131. [2020-01-16 17:57:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:57:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15595 transitions. [2020-01-16 17:57:24,977 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15595 transitions. Word has length 31 [2020-01-16 17:57:24,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:24,977 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15595 transitions. [2020-01-16 17:57:24,977 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15595 transitions. [2020-01-16 17:57:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:24,983 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:24,983 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:24,983 INFO L426 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:24,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:24,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1920533422, now seen corresponding path program 422 times [2020-01-16 17:57:24,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:24,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345042235] [2020-01-16 17:57:24,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:25,507 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:57:25,632 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:25,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345042235] [2020-01-16 17:57:25,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:25,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:25,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17521114] [2020-01-16 17:57:25,642 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:25,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:25,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:25,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:25,643 INFO L87 Difference]: Start difference. First operand 3131 states and 15595 transitions. Second operand 12 states. [2020-01-16 17:57:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:25,874 INFO L93 Difference]: Finished difference Result 6029 states and 26837 transitions. [2020-01-16 17:57:25,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:25,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:25,889 INFO L225 Difference]: With dead ends: 6029 [2020-01-16 17:57:25,889 INFO L226 Difference]: Without dead ends: 6006 [2020-01-16 17:57:25,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-01-16 17:57:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3125. [2020-01-16 17:57:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:57:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15578 transitions. [2020-01-16 17:57:26,116 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15578 transitions. Word has length 31 [2020-01-16 17:57:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:26,116 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15578 transitions. [2020-01-16 17:57:26,116 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15578 transitions. [2020-01-16 17:57:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:26,122 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:26,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:26,122 INFO L426 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:26,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:26,122 INFO L82 PathProgramCache]: Analyzing trace with hash -868882882, now seen corresponding path program 423 times [2020-01-16 17:57:26,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:26,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250499894] [2020-01-16 17:57:26,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:26,654 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:57:26,784 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:26,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250499894] [2020-01-16 17:57:26,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:26,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:26,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084782938] [2020-01-16 17:57:26,793 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:26,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:26,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:26,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:26,794 INFO L87 Difference]: Start difference. First operand 3125 states and 15578 transitions. Second operand 12 states. [2020-01-16 17:57:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:27,042 INFO L93 Difference]: Finished difference Result 6039 states and 26858 transitions. [2020-01-16 17:57:27,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:27,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:27,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:27,057 INFO L225 Difference]: With dead ends: 6039 [2020-01-16 17:57:27,057 INFO L226 Difference]: Without dead ends: 6020 [2020-01-16 17:57:27,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-01-16 17:57:27,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3134. [2020-01-16 17:57:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:57:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15595 transitions. [2020-01-16 17:57:27,278 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15595 transitions. Word has length 31 [2020-01-16 17:57:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:27,278 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15595 transitions. [2020-01-16 17:57:27,278 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15595 transitions. [2020-01-16 17:57:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:27,283 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:27,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:27,283 INFO L426 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:27,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:27,283 INFO L82 PathProgramCache]: Analyzing trace with hash -798772846, now seen corresponding path program 424 times [2020-01-16 17:57:27,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:27,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389723133] [2020-01-16 17:57:27,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:27,815 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:57:27,941 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:27,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389723133] [2020-01-16 17:57:27,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:27,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:27,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679061059] [2020-01-16 17:57:27,952 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:27,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:27,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:27,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:27,952 INFO L87 Difference]: Start difference. First operand 3134 states and 15595 transitions. Second operand 12 states. [2020-01-16 17:57:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:28,151 INFO L93 Difference]: Finished difference Result 6042 states and 26855 transitions. [2020-01-16 17:57:28,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:28,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:28,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:28,167 INFO L225 Difference]: With dead ends: 6042 [2020-01-16 17:57:28,167 INFO L226 Difference]: Without dead ends: 6011 [2020-01-16 17:57:28,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-01-16 17:57:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3125. [2020-01-16 17:57:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:57:28,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15571 transitions. [2020-01-16 17:57:28,393 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15571 transitions. Word has length 31 [2020-01-16 17:57:28,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:28,393 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15571 transitions. [2020-01-16 17:57:28,393 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15571 transitions. [2020-01-16 17:57:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:28,399 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:28,399 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:28,399 INFO L426 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:28,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash 252877694, now seen corresponding path program 425 times [2020-01-16 17:57:28,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:28,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031347075] [2020-01-16 17:57:28,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:28,925 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:57:29,057 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:29,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:29,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031347075] [2020-01-16 17:57:29,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:29,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:29,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957784955] [2020-01-16 17:57:29,067 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:29,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:29,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:29,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:29,067 INFO L87 Difference]: Start difference. First operand 3125 states and 15571 transitions. Second operand 12 states. [2020-01-16 17:57:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:29,324 INFO L93 Difference]: Finished difference Result 6033 states and 26837 transitions. [2020-01-16 17:57:29,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:29,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:29,339 INFO L225 Difference]: With dead ends: 6033 [2020-01-16 17:57:29,339 INFO L226 Difference]: Without dead ends: 6016 [2020-01-16 17:57:29,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:29,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-01-16 17:57:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3132. [2020-01-16 17:57:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:57:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15584 transitions. [2020-01-16 17:57:29,569 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15584 transitions. Word has length 31 [2020-01-16 17:57:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:29,569 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15584 transitions. [2020-01-16 17:57:29,569 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15584 transitions. [2020-01-16 17:57:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:29,575 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:29,575 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:29,575 INFO L426 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1859550936, now seen corresponding path program 426 times [2020-01-16 17:57:29,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:29,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503209866] [2020-01-16 17:57:29,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:30,118 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:57:30,249 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:30,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503209866] [2020-01-16 17:57:30,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:30,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:30,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633021862] [2020-01-16 17:57:30,259 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:30,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:30,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:30,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:30,259 INFO L87 Difference]: Start difference. First operand 3132 states and 15584 transitions. Second operand 12 states. [2020-01-16 17:57:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:30,462 INFO L93 Difference]: Finished difference Result 6038 states and 26840 transitions. [2020-01-16 17:57:30,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:30,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:30,477 INFO L225 Difference]: With dead ends: 6038 [2020-01-16 17:57:30,478 INFO L226 Difference]: Without dead ends: 6002 [2020-01-16 17:57:30,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:30,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-01-16 17:57:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3118. [2020-01-16 17:57:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-01-16 17:57:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15552 transitions. [2020-01-16 17:57:30,705 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15552 transitions. Word has length 31 [2020-01-16 17:57:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:30,706 INFO L478 AbstractCegarLoop]: Abstraction has 3118 states and 15552 transitions. [2020-01-16 17:57:30,706 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15552 transitions. [2020-01-16 17:57:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:30,711 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:30,711 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:30,711 INFO L426 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:30,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1570364298, now seen corresponding path program 427 times [2020-01-16 17:57:30,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:30,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183432421] [2020-01-16 17:57:30,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:30,987 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2020-01-16 17:57:31,286 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:57:31,415 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:31,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183432421] [2020-01-16 17:57:31,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:31,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:31,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470972912] [2020-01-16 17:57:31,424 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:31,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:31,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:31,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:31,425 INFO L87 Difference]: Start difference. First operand 3118 states and 15552 transitions. Second operand 12 states. [2020-01-16 17:57:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:31,658 INFO L93 Difference]: Finished difference Result 6016 states and 26804 transitions. [2020-01-16 17:57:31,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:31,659 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:31,674 INFO L225 Difference]: With dead ends: 6016 [2020-01-16 17:57:31,675 INFO L226 Difference]: Without dead ends: 6000 [2020-01-16 17:57:31,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-01-16 17:57:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3129. [2020-01-16 17:57:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:57:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15583 transitions. [2020-01-16 17:57:31,901 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15583 transitions. Word has length 31 [2020-01-16 17:57:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:31,902 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15583 transitions. [2020-01-16 17:57:31,902 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15583 transitions. [2020-01-16 17:57:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:31,907 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:31,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:31,907 INFO L426 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:31,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:31,907 INFO L82 PathProgramCache]: Analyzing trace with hash -119578606, now seen corresponding path program 428 times [2020-01-16 17:57:31,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:31,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587130153] [2020-01-16 17:57:31,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:32,448 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:57:32,576 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:32,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-01-16 17:57:32,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587130153] [2020-01-16 17:57:32,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:32,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:32,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170852303] [2020-01-16 17:57:32,586 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:32,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:32,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:32,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:32,586 INFO L87 Difference]: Start difference. First operand 3129 states and 15583 transitions. Second operand 12 states. [2020-01-16 17:57:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:32,827 INFO L93 Difference]: Finished difference Result 6017 states and 26801 transitions. [2020-01-16 17:57:32,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:32,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:32,842 INFO L225 Difference]: With dead ends: 6017 [2020-01-16 17:57:32,842 INFO L226 Difference]: Without dead ends: 5995 [2020-01-16 17:57:32,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-01-16 17:57:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 3124. [2020-01-16 17:57:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:57:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-01-16 17:57:33,068 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-01-16 17:57:33,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:33,068 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-01-16 17:57:33,068 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-01-16 17:57:33,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:33,074 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:33,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:33,074 INFO L426 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:33,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:33,074 INFO L82 PathProgramCache]: Analyzing trace with hash 509586208, now seen corresponding path program 429 times [2020-01-16 17:57:33,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:33,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889055692] [2020-01-16 17:57:33,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:33,588 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:57:33,727 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:33,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889055692] [2020-01-16 17:57:33,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:33,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:33,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999593043] [2020-01-16 17:57:33,737 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:33,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:33,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:33,738 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-01-16 17:57:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:34,032 INFO L93 Difference]: Finished difference Result 6022 states and 26810 transitions. [2020-01-16 17:57:34,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:34,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:34,047 INFO L225 Difference]: With dead ends: 6022 [2020-01-16 17:57:34,047 INFO L226 Difference]: Without dead ends: 6006 [2020-01-16 17:57:34,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-01-16 17:57:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-01-16 17:57:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:57:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15580 transitions. [2020-01-16 17:57:34,269 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15580 transitions. Word has length 31 [2020-01-16 17:57:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:34,270 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15580 transitions. [2020-01-16 17:57:34,270 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15580 transitions. [2020-01-16 17:57:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:34,275 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:34,275 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:34,275 INFO L426 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:34,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:34,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1002181970, now seen corresponding path program 430 times [2020-01-16 17:57:34,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:34,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78423773] [2020-01-16 17:57:34,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:34,799 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:57:34,931 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:57:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:34,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78423773] [2020-01-16 17:57:34,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:34,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:34,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693591885] [2020-01-16 17:57:34,941 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:34,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:34,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:34,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:34,941 INFO L87 Difference]: Start difference. First operand 3130 states and 15580 transitions. Second operand 12 states. [2020-01-16 17:57:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:35,128 INFO L93 Difference]: Finished difference Result 6028 states and 26816 transitions. [2020-01-16 17:57:35,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:35,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:35,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:35,143 INFO L225 Difference]: With dead ends: 6028 [2020-01-16 17:57:35,143 INFO L226 Difference]: Without dead ends: 6000 [2020-01-16 17:57:35,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-01-16 17:57:35,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3124. [2020-01-16 17:57:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:57:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15563 transitions. [2020-01-16 17:57:35,366 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15563 transitions. Word has length 31 [2020-01-16 17:57:35,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:35,366 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15563 transitions. [2020-01-16 17:57:35,366 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15563 transitions. [2020-01-16 17:57:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:35,372 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:35,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:35,372 INFO L426 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:35,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:35,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2028979168, now seen corresponding path program 431 times [2020-01-16 17:57:35,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:35,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815529372] [2020-01-16 17:57:35,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:35,911 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:57:36,044 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:36,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815529372] [2020-01-16 17:57:36,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:36,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:36,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238577244] [2020-01-16 17:57:36,053 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:36,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:36,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:36,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:36,054 INFO L87 Difference]: Start difference. First operand 3124 states and 15563 transitions. Second operand 12 states. [2020-01-16 17:57:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:36,313 INFO L93 Difference]: Finished difference Result 6025 states and 26811 transitions. [2020-01-16 17:57:36,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:36,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:36,329 INFO L225 Difference]: With dead ends: 6025 [2020-01-16 17:57:36,329 INFO L226 Difference]: Without dead ends: 6008 [2020-01-16 17:57:36,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-01-16 17:57:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3131. [2020-01-16 17:57:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:57:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15576 transitions. [2020-01-16 17:57:36,555 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15576 transitions. Word has length 31 [2020-01-16 17:57:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:36,555 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15576 transitions. [2020-01-16 17:57:36,555 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15576 transitions. [2020-01-16 17:57:36,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:36,561 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:36,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:36,561 INFO L426 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:36,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:36,561 INFO L82 PathProgramCache]: Analyzing trace with hash 153559498, now seen corresponding path program 432 times [2020-01-16 17:57:36,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:36,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507266857] [2020-01-16 17:57:36,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:37,104 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:57:37,232 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:37,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507266857] [2020-01-16 17:57:37,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:37,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:37,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911989070] [2020-01-16 17:57:37,243 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:37,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:37,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:37,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:37,243 INFO L87 Difference]: Start difference. First operand 3131 states and 15576 transitions. Second operand 12 states. [2020-01-16 17:57:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:37,448 INFO L93 Difference]: Finished difference Result 6030 states and 26814 transitions. [2020-01-16 17:57:37,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:37,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:37,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:37,463 INFO L225 Difference]: With dead ends: 6030 [2020-01-16 17:57:37,463 INFO L226 Difference]: Without dead ends: 5989 [2020-01-16 17:57:37,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-01-16 17:57:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3112. [2020-01-16 17:57:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-01-16 17:57:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15535 transitions. [2020-01-16 17:57:37,685 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15535 transitions. Word has length 31 [2020-01-16 17:57:37,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:37,685 INFO L478 AbstractCegarLoop]: Abstraction has 3112 states and 15535 transitions. [2020-01-16 17:57:37,685 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15535 transitions. [2020-01-16 17:57:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:37,690 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:37,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:37,690 INFO L426 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:37,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:37,690 INFO L82 PathProgramCache]: Analyzing trace with hash -331869382, now seen corresponding path program 433 times [2020-01-16 17:57:37,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:37,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115138623] [2020-01-16 17:57:37,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:38,236 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:57:38,368 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:57:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:38,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115138623] [2020-01-16 17:57:38,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:38,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:38,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244873963] [2020-01-16 17:57:38,378 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:38,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:38,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:38,378 INFO L87 Difference]: Start difference. First operand 3112 states and 15535 transitions. Second operand 12 states. [2020-01-16 17:57:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:38,675 INFO L93 Difference]: Finished difference Result 6055 states and 26922 transitions. [2020-01-16 17:57:38,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:38,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:38,690 INFO L225 Difference]: With dead ends: 6055 [2020-01-16 17:57:38,690 INFO L226 Difference]: Without dead ends: 6036 [2020-01-16 17:57:38,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-01-16 17:57:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3135. [2020-01-16 17:57:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:57:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15611 transitions. [2020-01-16 17:57:38,912 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15611 transitions. Word has length 31 [2020-01-16 17:57:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:38,912 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15611 transitions. [2020-01-16 17:57:38,913 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15611 transitions. [2020-01-16 17:57:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:38,920 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:38,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:38,920 INFO L426 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:38,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:38,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1599326560, now seen corresponding path program 434 times [2020-01-16 17:57:38,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:38,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140149716] [2020-01-16 17:57:38,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:39,457 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:57:39,630 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:57:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:39,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140149716] [2020-01-16 17:57:39,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:39,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:39,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507795641] [2020-01-16 17:57:39,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:39,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:39,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:39,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:39,640 INFO L87 Difference]: Start difference. First operand 3135 states and 15611 transitions. Second operand 12 states. [2020-01-16 17:57:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:39,884 INFO L93 Difference]: Finished difference Result 6056 states and 26916 transitions. [2020-01-16 17:57:39,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:39,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:39,901 INFO L225 Difference]: With dead ends: 6056 [2020-01-16 17:57:39,901 INFO L226 Difference]: Without dead ends: 6028 [2020-01-16 17:57:39,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:40,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-01-16 17:57:40,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3127. [2020-01-16 17:57:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:57:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15590 transitions. [2020-01-16 17:57:40,123 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15590 transitions. Word has length 31 [2020-01-16 17:57:40,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:40,123 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15590 transitions. [2020-01-16 17:57:40,124 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:40,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15590 transitions. [2020-01-16 17:57:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:40,129 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:40,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:40,129 INFO L426 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:40,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:40,129 INFO L82 PathProgramCache]: Analyzing trace with hash -756180618, now seen corresponding path program 435 times [2020-01-16 17:57:40,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:40,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014379462] [2020-01-16 17:57:40,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:40,778 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:57:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:40,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014379462] [2020-01-16 17:57:40,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:40,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:40,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983002234] [2020-01-16 17:57:40,788 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:40,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:40,789 INFO L87 Difference]: Start difference. First operand 3127 states and 15590 transitions. Second operand 12 states. [2020-01-16 17:57:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:41,021 INFO L93 Difference]: Finished difference Result 6050 states and 26904 transitions. [2020-01-16 17:57:41,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:41,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:41,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:41,036 INFO L225 Difference]: With dead ends: 6050 [2020-01-16 17:57:41,036 INFO L226 Difference]: Without dead ends: 6031 [2020-01-16 17:57:41,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-01-16 17:57:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3133. [2020-01-16 17:57:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:57:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15601 transitions. [2020-01-16 17:57:41,256 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15601 transitions. Word has length 31 [2020-01-16 17:57:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:41,256 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15601 transitions. [2020-01-16 17:57:41,256 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15601 transitions. [2020-01-16 17:57:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:41,262 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:41,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:41,262 INFO L426 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1426358048, now seen corresponding path program 436 times [2020-01-16 17:57:41,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:41,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101693252] [2020-01-16 17:57:41,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:41,803 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:57:41,934 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:57:41,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-01-16 17:57:41,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101693252] [2020-01-16 17:57:41,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:41,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:41,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604423609] [2020-01-16 17:57:41,944 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:41,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:41,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:41,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:41,945 INFO L87 Difference]: Start difference. First operand 3133 states and 15601 transitions. Second operand 12 states. [2020-01-16 17:57:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:42,219 INFO L93 Difference]: Finished difference Result 6048 states and 26894 transitions. [2020-01-16 17:57:42,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:42,220 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:42,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:42,234 INFO L225 Difference]: With dead ends: 6048 [2020-01-16 17:57:42,234 INFO L226 Difference]: Without dead ends: 6025 [2020-01-16 17:57:42,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2020-01-16 17:57:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3127. [2020-01-16 17:57:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:57:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15584 transitions. [2020-01-16 17:57:42,463 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15584 transitions. Word has length 31 [2020-01-16 17:57:42,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:42,464 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15584 transitions. [2020-01-16 17:57:42,464 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15584 transitions. [2020-01-16 17:57:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:42,469 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:42,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:42,469 INFO L426 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:42,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:42,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1634862646, now seen corresponding path program 437 times [2020-01-16 17:57:42,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:42,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526699914] [2020-01-16 17:57:42,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:43,000 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:57:43,128 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:57:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:43,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526699914] [2020-01-16 17:57:43,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:43,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:43,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971857246] [2020-01-16 17:57:43,138 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:43,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:43,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:43,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:43,138 INFO L87 Difference]: Start difference. First operand 3127 states and 15584 transitions. Second operand 12 states. [2020-01-16 17:57:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:43,486 INFO L93 Difference]: Finished difference Result 6052 states and 26902 transitions. [2020-01-16 17:57:43,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:43,486 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:43,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:43,501 INFO L225 Difference]: With dead ends: 6052 [2020-01-16 17:57:43,502 INFO L226 Difference]: Without dead ends: 6032 [2020-01-16 17:57:43,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-01-16 17:57:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3133. [2020-01-16 17:57:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:57:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15595 transitions. [2020-01-16 17:57:43,728 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15595 transitions. Word has length 31 [2020-01-16 17:57:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:43,728 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15595 transitions. [2020-01-16 17:57:43,728 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:43,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15595 transitions. [2020-01-16 17:57:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:43,733 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:43,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:43,734 INFO L426 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:43,734 INFO L82 PathProgramCache]: Analyzing trace with hash 789891194, now seen corresponding path program 438 times [2020-01-16 17:57:43,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:43,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242689606] [2020-01-16 17:57:43,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:44,262 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:57:44,391 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:57:44,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-01-16 17:57:44,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242689606] [2020-01-16 17:57:44,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:44,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:44,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248193919] [2020-01-16 17:57:44,400 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:44,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:44,400 INFO L87 Difference]: Start difference. First operand 3133 states and 15595 transitions. Second operand 12 states. [2020-01-16 17:57:44,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:44,720 INFO L93 Difference]: Finished difference Result 6049 states and 26890 transitions. [2020-01-16 17:57:44,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:44,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:44,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:44,735 INFO L225 Difference]: With dead ends: 6049 [2020-01-16 17:57:44,736 INFO L226 Difference]: Without dead ends: 6020 [2020-01-16 17:57:44,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:44,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-01-16 17:57:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3121. [2020-01-16 17:57:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:57:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15567 transitions. [2020-01-16 17:57:44,962 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15567 transitions. Word has length 31 [2020-01-16 17:57:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:44,962 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15567 transitions. [2020-01-16 17:57:44,962 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15567 transitions. [2020-01-16 17:57:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:44,967 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:44,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:44,967 INFO L426 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:44,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1143748196, now seen corresponding path program 439 times [2020-01-16 17:57:44,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:44,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707069967] [2020-01-16 17:57:44,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:45,520 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-01-16 17:57:45,650 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:57:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:45,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707069967] [2020-01-16 17:57:45,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:45,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:45,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939573227] [2020-01-16 17:57:45,660 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:45,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:45,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:45,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:45,661 INFO L87 Difference]: Start difference. First operand 3121 states and 15567 transitions. Second operand 12 states. [2020-01-16 17:57:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:46,011 INFO L93 Difference]: Finished difference Result 6073 states and 26959 transitions. [2020-01-16 17:57:46,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:46,012 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:46,029 INFO L225 Difference]: With dead ends: 6073 [2020-01-16 17:57:46,029 INFO L226 Difference]: Without dead ends: 6054 [2020-01-16 17:57:46,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-01-16 17:57:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3140. [2020-01-16 17:57:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-01-16 17:57:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15619 transitions. [2020-01-16 17:57:46,256 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15619 transitions. Word has length 31 [2020-01-16 17:57:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:46,256 INFO L478 AbstractCegarLoop]: Abstraction has 3140 states and 15619 transitions. [2020-01-16 17:57:46,256 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15619 transitions. [2020-01-16 17:57:46,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:46,261 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:46,261 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:46,261 INFO L426 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:46,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:46,262 INFO L82 PathProgramCache]: Analyzing trace with hash -123708982, now seen corresponding path program 440 times [2020-01-16 17:57:46,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:46,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561636693] [2020-01-16 17:57:46,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:46,937 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:57:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:46,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561636693] [2020-01-16 17:57:46,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:46,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:46,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718989198] [2020-01-16 17:57:46,947 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:46,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:46,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:46,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:46,948 INFO L87 Difference]: Start difference. First operand 3140 states and 15619 transitions. Second operand 12 states. [2020-01-16 17:57:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:47,271 INFO L93 Difference]: Finished difference Result 6074 states and 26953 transitions. [2020-01-16 17:57:47,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:47,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:47,286 INFO L225 Difference]: With dead ends: 6074 [2020-01-16 17:57:47,286 INFO L226 Difference]: Without dead ends: 6046 [2020-01-16 17:57:47,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:47,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-01-16 17:57:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3132. [2020-01-16 17:57:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:57:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15596 transitions. [2020-01-16 17:57:47,510 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15596 transitions. Word has length 31 [2020-01-16 17:57:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:47,510 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15596 transitions. [2020-01-16 17:57:47,511 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15596 transitions. [2020-01-16 17:57:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:47,516 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:47,516 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:47,516 INFO L426 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash -341341130, now seen corresponding path program 441 times [2020-01-16 17:57:47,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:47,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698221786] [2020-01-16 17:57:47,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:48,075 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:57:48,254 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:48,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-01-16 17:57:48,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698221786] [2020-01-16 17:57:48,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:48,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:48,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400705899] [2020-01-16 17:57:48,263 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:48,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:48,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:48,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:48,263 INFO L87 Difference]: Start difference. First operand 3132 states and 15596 transitions. Second operand 12 states. [2020-01-16 17:57:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:48,587 INFO L93 Difference]: Finished difference Result 6076 states and 26956 transitions. [2020-01-16 17:57:48,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:48,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:48,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:48,602 INFO L225 Difference]: With dead ends: 6076 [2020-01-16 17:57:48,602 INFO L226 Difference]: Without dead ends: 6057 [2020-01-16 17:57:48,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-01-16 17:57:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3141. [2020-01-16 17:57:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-01-16 17:57:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15613 transitions. [2020-01-16 17:57:48,824 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15613 transitions. Word has length 31 [2020-01-16 17:57:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:48,824 INFO L478 AbstractCegarLoop]: Abstraction has 3141 states and 15613 transitions. [2020-01-16 17:57:48,824 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15613 transitions. [2020-01-16 17:57:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:48,829 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:48,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:48,830 INFO L426 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:48,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:48,830 INFO L82 PathProgramCache]: Analyzing trace with hash -271231094, now seen corresponding path program 442 times [2020-01-16 17:57:48,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:48,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983951070] [2020-01-16 17:57:48,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:49,375 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:57:49,503 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:49,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983951070] [2020-01-16 17:57:49,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:49,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:49,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235108128] [2020-01-16 17:57:49,513 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:49,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:49,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:49,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:49,514 INFO L87 Difference]: Start difference. First operand 3141 states and 15613 transitions. Second operand 12 states. [2020-01-16 17:57:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:49,838 INFO L93 Difference]: Finished difference Result 6079 states and 26953 transitions. [2020-01-16 17:57:49,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:49,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:49,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:49,853 INFO L225 Difference]: With dead ends: 6079 [2020-01-16 17:57:49,853 INFO L226 Difference]: Without dead ends: 6048 [2020-01-16 17:57:49,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-01-16 17:57:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3132. [2020-01-16 17:57:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:57:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15587 transitions. [2020-01-16 17:57:50,081 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15587 transitions. Word has length 31 [2020-01-16 17:57:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:50,081 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15587 transitions. [2020-01-16 17:57:50,081 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15587 transitions. [2020-01-16 17:57:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:50,087 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:50,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:50,087 INFO L426 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:50,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:50,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2049702134, now seen corresponding path program 443 times [2020-01-16 17:57:50,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:50,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90684414] [2020-01-16 17:57:50,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:50,645 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:57:50,774 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:57:50,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-01-16 17:57:50,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90684414] [2020-01-16 17:57:50,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:50,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:50,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736444084] [2020-01-16 17:57:50,784 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:50,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:50,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:50,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:50,784 INFO L87 Difference]: Start difference. First operand 3132 states and 15587 transitions. Second operand 12 states. [2020-01-16 17:57:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:51,055 INFO L93 Difference]: Finished difference Result 6080 states and 26955 transitions. [2020-01-16 17:57:51,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:51,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:51,069 INFO L225 Difference]: With dead ends: 6080 [2020-01-16 17:57:51,069 INFO L226 Difference]: Without dead ends: 6060 [2020-01-16 17:57:51,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2020-01-16 17:57:51,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 3143. [2020-01-16 17:57:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-01-16 17:57:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15607 transitions. [2020-01-16 17:57:51,290 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15607 transitions. Word has length 31 [2020-01-16 17:57:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:51,290 INFO L478 AbstractCegarLoop]: Abstraction has 3143 states and 15607 transitions. [2020-01-16 17:57:51,290 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15607 transitions. [2020-01-16 17:57:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:51,295 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:51,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:51,295 INFO L426 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:51,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash -907697948, now seen corresponding path program 444 times [2020-01-16 17:57:51,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:51,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638271317] [2020-01-16 17:57:51,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:51,854 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:57:51,986 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:57:51,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-01-16 17:57:51,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638271317] [2020-01-16 17:57:51,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:51,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:51,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421309945] [2020-01-16 17:57:51,995 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:51,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:51,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:51,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:51,996 INFO L87 Difference]: Start difference. First operand 3143 states and 15607 transitions. Second operand 12 states. [2020-01-16 17:57:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:52,175 INFO L93 Difference]: Finished difference Result 6082 states and 26949 transitions. [2020-01-16 17:57:52,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:52,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:52,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:52,191 INFO L225 Difference]: With dead ends: 6082 [2020-01-16 17:57:52,191 INFO L226 Difference]: Without dead ends: 6038 [2020-01-16 17:57:52,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:52,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-01-16 17:57:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3121. [2020-01-16 17:57:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:57:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15558 transitions. [2020-01-16 17:57:52,416 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15558 transitions. Word has length 31 [2020-01-16 17:57:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:52,416 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15558 transitions. [2020-01-16 17:57:52,416 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15558 transitions. [2020-01-16 17:57:52,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:52,422 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:52,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:52,422 INFO L426 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:52,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:52,422 INFO L82 PathProgramCache]: Analyzing trace with hash 450690532, now seen corresponding path program 445 times [2020-01-16 17:57:52,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:52,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663405966] [2020-01-16 17:57:52,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:52,985 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:57:53,116 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:53,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663405966] [2020-01-16 17:57:53,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:53,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:53,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223609912] [2020-01-16 17:57:53,125 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:53,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:53,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:53,125 INFO L87 Difference]: Start difference. First operand 3121 states and 15558 transitions. Second operand 12 states. [2020-01-16 17:57:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:53,346 INFO L93 Difference]: Finished difference Result 6055 states and 26905 transitions. [2020-01-16 17:57:53,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:53,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:53,361 INFO L225 Difference]: With dead ends: 6055 [2020-01-16 17:57:53,361 INFO L226 Difference]: Without dead ends: 6036 [2020-01-16 17:57:53,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-01-16 17:57:53,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3134. [2020-01-16 17:57:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:57:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15595 transitions. [2020-01-16 17:57:53,586 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15595 transitions. Word has length 31 [2020-01-16 17:57:53,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:53,586 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15595 transitions. [2020-01-16 17:57:53,586 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15595 transitions. [2020-01-16 17:57:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:53,591 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:53,591 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:53,591 INFO L426 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:53,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:53,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1661738098, now seen corresponding path program 446 times [2020-01-16 17:57:53,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:53,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858058889] [2020-01-16 17:57:53,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:54,118 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:57:54,249 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:54,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-01-16 17:57:54,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858058889] [2020-01-16 17:57:54,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:54,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:54,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500441397] [2020-01-16 17:57:54,258 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:54,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:54,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:54,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:54,258 INFO L87 Difference]: Start difference. First operand 3134 states and 15595 transitions. Second operand 12 states. [2020-01-16 17:57:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:54,479 INFO L93 Difference]: Finished difference Result 6053 states and 26895 transitions. [2020-01-16 17:57:54,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:54,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:54,494 INFO L225 Difference]: With dead ends: 6053 [2020-01-16 17:57:54,494 INFO L226 Difference]: Without dead ends: 6030 [2020-01-16 17:57:54,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-01-16 17:57:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3128. [2020-01-16 17:57:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:57:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15578 transitions. [2020-01-16 17:57:54,714 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15578 transitions. Word has length 31 [2020-01-16 17:57:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:54,715 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15578 transitions. [2020-01-16 17:57:54,715 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15578 transitions. [2020-01-16 17:57:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:54,720 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:54,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:54,720 INFO L426 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:54,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:54,720 INFO L82 PathProgramCache]: Analyzing trace with hash -610087558, now seen corresponding path program 447 times [2020-01-16 17:57:54,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:54,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663925918] [2020-01-16 17:57:54,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:55,257 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:57:55,393 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:55,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-01-16 17:57:55,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663925918] [2020-01-16 17:57:55,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:55,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:55,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219315906] [2020-01-16 17:57:55,403 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:55,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:55,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:55,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:55,404 INFO L87 Difference]: Start difference. First operand 3128 states and 15578 transitions. Second operand 12 states. [2020-01-16 17:57:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:55,650 INFO L93 Difference]: Finished difference Result 6063 states and 26916 transitions. [2020-01-16 17:57:55,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:55,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:55,666 INFO L225 Difference]: With dead ends: 6063 [2020-01-16 17:57:55,666 INFO L226 Difference]: Without dead ends: 6044 [2020-01-16 17:57:55,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:55,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2020-01-16 17:57:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 3137. [2020-01-16 17:57:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-01-16 17:57:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15595 transitions. [2020-01-16 17:57:55,890 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15595 transitions. Word has length 31 [2020-01-16 17:57:55,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:55,891 INFO L478 AbstractCegarLoop]: Abstraction has 3137 states and 15595 transitions. [2020-01-16 17:57:55,891 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:55,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15595 transitions. [2020-01-16 17:57:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:55,896 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:55,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:55,896 INFO L426 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:55,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:55,896 INFO L82 PathProgramCache]: Analyzing trace with hash -539977522, now seen corresponding path program 448 times [2020-01-16 17:57:55,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:55,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399699380] [2020-01-16 17:57:55,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:56,451 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:57:56,584 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:56,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399699380] [2020-01-16 17:57:56,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:56,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:56,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345017648] [2020-01-16 17:57:56,594 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:56,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:56,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:56,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:56,594 INFO L87 Difference]: Start difference. First operand 3137 states and 15595 transitions. Second operand 12 states. [2020-01-16 17:57:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:56,897 INFO L93 Difference]: Finished difference Result 6066 states and 26913 transitions. [2020-01-16 17:57:56,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:56,898 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:56,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:56,913 INFO L225 Difference]: With dead ends: 6066 [2020-01-16 17:57:56,914 INFO L226 Difference]: Without dead ends: 6035 [2020-01-16 17:57:56,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2020-01-16 17:57:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 3128. [2020-01-16 17:57:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:57:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15571 transitions. [2020-01-16 17:57:57,133 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15571 transitions. Word has length 31 [2020-01-16 17:57:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:57,133 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15571 transitions. [2020-01-16 17:57:57,133 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15571 transitions. [2020-01-16 17:57:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:57,138 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:57,138 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:57,138 INFO L426 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:57,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:57,138 INFO L82 PathProgramCache]: Analyzing trace with hash 511673018, now seen corresponding path program 449 times [2020-01-16 17:57:57,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:57,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630110940] [2020-01-16 17:57:57,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:57,661 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:57:57,787 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:57:57,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630110940] [2020-01-16 17:57:57,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:57,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:57,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985039418] [2020-01-16 17:57:57,796 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:57,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:57,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:57,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:57,797 INFO L87 Difference]: Start difference. First operand 3128 states and 15571 transitions. Second operand 12 states. [2020-01-16 17:57:58,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:58,099 INFO L93 Difference]: Finished difference Result 6057 states and 26895 transitions. [2020-01-16 17:57:58,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:58,099 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:58,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:58,113 INFO L225 Difference]: With dead ends: 6057 [2020-01-16 17:57:58,114 INFO L226 Difference]: Without dead ends: 6040 [2020-01-16 17:57:58,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-01-16 17:57:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3135. [2020-01-16 17:57:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:57:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15584 transitions. [2020-01-16 17:57:58,333 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15584 transitions. Word has length 31 [2020-01-16 17:57:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:58,334 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15584 transitions. [2020-01-16 17:57:58,334 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15584 transitions. [2020-01-16 17:57:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:58,339 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:58,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:58,339 INFO L426 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:58,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:58,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1600755612, now seen corresponding path program 450 times [2020-01-16 17:57:58,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:58,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961090586] [2020-01-16 17:57:58,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:58,872 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:57:59,002 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:57: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-01-16 17:57:59,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961090586] [2020-01-16 17:57:59,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:57:59,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:57:59,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945543103] [2020-01-16 17:57:59,012 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:57:59,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:57:59,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:57:59,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:57:59,013 INFO L87 Difference]: Start difference. First operand 3135 states and 15584 transitions. Second operand 12 states. [2020-01-16 17:57:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:57:59,207 INFO L93 Difference]: Finished difference Result 6062 states and 26898 transitions. [2020-01-16 17:57:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:57:59,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:57:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:57:59,223 INFO L225 Difference]: With dead ends: 6062 [2020-01-16 17:57:59,223 INFO L226 Difference]: Without dead ends: 6026 [2020-01-16 17:57:59,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:57:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-01-16 17:57:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3121. [2020-01-16 17:57:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:57:59,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15551 transitions. [2020-01-16 17:57:59,443 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15551 transitions. Word has length 31 [2020-01-16 17:57:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:57:59,443 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15551 transitions. [2020-01-16 17:57:59,443 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:57:59,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15551 transitions. [2020-01-16 17:57:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:57:59,448 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:57:59,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:57:59,448 INFO L426 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:57:59,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:57:59,448 INFO L82 PathProgramCache]: Analyzing trace with hash 291130506, now seen corresponding path program 451 times [2020-01-16 17:57:59,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:57:59,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501986319] [2020-01-16 17:57:59,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:57:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:57:59,990 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:00,121 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:00,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501986319] [2020-01-16 17:58:00,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:00,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:00,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250450540] [2020-01-16 17:58:00,131 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:00,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:00,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:00,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:00,132 INFO L87 Difference]: Start difference. First operand 3121 states and 15551 transitions. Second operand 12 states. [2020-01-16 17:58:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:00,391 INFO L93 Difference]: Finished difference Result 6061 states and 26910 transitions. [2020-01-16 17:58:00,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:00,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:00,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:00,406 INFO L225 Difference]: With dead ends: 6061 [2020-01-16 17:58:00,406 INFO L226 Difference]: Without dead ends: 6041 [2020-01-16 17:58:00,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2020-01-16 17:58:00,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3135. [2020-01-16 17:58:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-01-16 17:58:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15590 transitions. [2020-01-16 17:58:00,633 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15590 transitions. Word has length 31 [2020-01-16 17:58:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:00,633 INFO L478 AbstractCegarLoop]: Abstraction has 3135 states and 15590 transitions. [2020-01-16 17:58:00,633 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15590 transitions. [2020-01-16 17:58:00,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:00,639 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:00,639 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:00,639 INFO L426 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:00,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:00,639 INFO L82 PathProgramCache]: Analyzing trace with hash -553840946, now seen corresponding path program 452 times [2020-01-16 17:58:00,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:00,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105984073] [2020-01-16 17:58:00,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:01,316 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:01,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105984073] [2020-01-16 17:58:01,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:01,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:01,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386401274] [2020-01-16 17:58:01,326 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:01,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:01,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:01,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:01,326 INFO L87 Difference]: Start difference. First operand 3135 states and 15590 transitions. Second operand 12 states. [2020-01-16 17:58:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:01,554 INFO L93 Difference]: Finished difference Result 6058 states and 26898 transitions. [2020-01-16 17:58:01,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:01,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:01,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:01,569 INFO L225 Difference]: With dead ends: 6058 [2020-01-16 17:58:01,570 INFO L226 Difference]: Without dead ends: 6035 [2020-01-16 17:58:01,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2020-01-16 17:58:01,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 3129. [2020-01-16 17:58:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:58:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15573 transitions. [2020-01-16 17:58:01,795 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15573 transitions. Word has length 31 [2020-01-16 17:58:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:01,795 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15573 transitions. [2020-01-16 17:58:01,795 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15573 transitions. [2020-01-16 17:58:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:01,800 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:01,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:01,800 INFO L426 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash -769647584, now seen corresponding path program 453 times [2020-01-16 17:58:01,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:01,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141701711] [2020-01-16 17:58:01,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:02,361 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:02,490 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58:02,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-01-16 17:58:02,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141701711] [2020-01-16 17:58:02,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:02,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:02,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631472284] [2020-01-16 17:58:02,500 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:02,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:02,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:02,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:02,501 INFO L87 Difference]: Start difference. First operand 3129 states and 15573 transitions. Second operand 12 states. [2020-01-16 17:58:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:02,731 INFO L93 Difference]: Finished difference Result 6071 states and 26925 transitions. [2020-01-16 17:58:02,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:02,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:02,747 INFO L225 Difference]: With dead ends: 6071 [2020-01-16 17:58:02,747 INFO L226 Difference]: Without dead ends: 6051 [2020-01-16 17:58:02,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-01-16 17:58:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3140. [2020-01-16 17:58:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-01-16 17:58:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15593 transitions. [2020-01-16 17:58:02,968 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15593 transitions. Word has length 31 [2020-01-16 17:58:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:02,969 INFO L478 AbstractCegarLoop]: Abstraction has 3140 states and 15593 transitions. [2020-01-16 17:58:02,969 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15593 transitions. [2020-01-16 17:58:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:02,974 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:02,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:02,974 INFO L426 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:02,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash 567919630, now seen corresponding path program 454 times [2020-01-16 17:58:02,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:02,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035403904] [2020-01-16 17:58:02,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:03,535 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:58:03,665 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:03,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035403904] [2020-01-16 17:58:03,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:03,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:03,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944946462] [2020-01-16 17:58:03,675 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:03,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:03,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:03,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:03,675 INFO L87 Difference]: Start difference. First operand 3140 states and 15593 transitions. Second operand 12 states. [2020-01-16 17:58:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:03,900 INFO L93 Difference]: Finished difference Result 6073 states and 26919 transitions. [2020-01-16 17:58:03,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:03,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:03,915 INFO L225 Difference]: With dead ends: 6073 [2020-01-16 17:58:03,916 INFO L226 Difference]: Without dead ends: 6040 [2020-01-16 17:58:03,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-01-16 17:58:04,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3129. [2020-01-16 17:58:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:58:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15565 transitions. [2020-01-16 17:58:04,140 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15565 transitions. Word has length 31 [2020-01-16 17:58:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:04,140 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15565 transitions. [2020-01-16 17:58:04,141 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15565 transitions. [2020-01-16 17:58:04,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:04,146 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:04,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:04,146 INFO L426 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:04,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:04,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2038930272, now seen corresponding path program 455 times [2020-01-16 17:58:04,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:04,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676727655] [2020-01-16 17:58:04,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:04,820 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:04,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676727655] [2020-01-16 17:58:04,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:04,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:04,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750756679] [2020-01-16 17:58:04,829 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:04,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:04,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:04,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:04,829 INFO L87 Difference]: Start difference. First operand 3129 states and 15565 transitions. Second operand 12 states. [2020-01-16 17:58:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:05,097 INFO L93 Difference]: Finished difference Result 6061 states and 26895 transitions. [2020-01-16 17:58:05,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:05,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:05,112 INFO L225 Difference]: With dead ends: 6061 [2020-01-16 17:58:05,112 INFO L226 Difference]: Without dead ends: 6044 [2020-01-16 17:58:05,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2020-01-16 17:58:05,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 3136. [2020-01-16 17:58:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-01-16 17:58:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15578 transitions. [2020-01-16 17:58:05,384 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15578 transitions. Word has length 31 [2020-01-16 17:58:05,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:05,384 INFO L478 AbstractCegarLoop]: Abstraction has 3136 states and 15578 transitions. [2020-01-16 17:58:05,384 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15578 transitions. [2020-01-16 17:58:05,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:05,390 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:05,390 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:05,390 INFO L426 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:05,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:05,391 INFO L82 PathProgramCache]: Analyzing trace with hash 143608394, now seen corresponding path program 456 times [2020-01-16 17:58:05,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:05,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578198229] [2020-01-16 17:58:05,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:05,949 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:58:06,084 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:06,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578198229] [2020-01-16 17:58:06,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:06,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:06,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904647034] [2020-01-16 17:58:06,093 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:06,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:06,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:06,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:06,093 INFO L87 Difference]: Start difference. First operand 3136 states and 15578 transitions. Second operand 12 states. [2020-01-16 17:58:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:06,283 INFO L93 Difference]: Finished difference Result 6066 states and 26898 transitions. [2020-01-16 17:58:06,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:06,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:06,298 INFO L225 Difference]: With dead ends: 6066 [2020-01-16 17:58:06,298 INFO L226 Difference]: Without dead ends: 6020 [2020-01-16 17:58:06,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-01-16 17:58:06,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3112. [2020-01-16 17:58:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-01-16 17:58:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15527 transitions. [2020-01-16 17:58:06,522 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15527 transitions. Word has length 31 [2020-01-16 17:58:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:06,522 INFO L478 AbstractCegarLoop]: Abstraction has 3112 states and 15527 transitions. [2020-01-16 17:58:06,522 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15527 transitions. [2020-01-16 17:58:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:06,528 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58: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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:06,528 INFO L426 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:06,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash -971486278, now seen corresponding path program 457 times [2020-01-16 17:58:06,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:06,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84698199] [2020-01-16 17:58:06,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:07,058 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:07,190 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:07,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84698199] [2020-01-16 17:58:07,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:07,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:07,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630208791] [2020-01-16 17:58:07,198 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:07,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:07,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:07,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:07,199 INFO L87 Difference]: Start difference. First operand 3112 states and 15527 transitions. Second operand 12 states. [2020-01-16 17:58:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:07,420 INFO L93 Difference]: Finished difference Result 6020 states and 26816 transitions. [2020-01-16 17:58:07,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:07,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:07,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:07,435 INFO L225 Difference]: With dead ends: 6020 [2020-01-16 17:58:07,435 INFO L226 Difference]: Without dead ends: 6004 [2020-01-16 17:58:07,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2020-01-16 17:58:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 3129. [2020-01-16 17:58:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:58:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15586 transitions. [2020-01-16 17:58:07,660 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15586 transitions. Word has length 31 [2020-01-16 17:58:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:07,660 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15586 transitions. [2020-01-16 17:58:07,660 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15586 transitions. [2020-01-16 17:58:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:07,666 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:07,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:07,666 INFO L426 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1816457730, now seen corresponding path program 458 times [2020-01-16 17:58:07,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:07,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239915410] [2020-01-16 17:58:07,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:08,200 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:58:08,328 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:08,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239915410] [2020-01-16 17:58:08,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:08,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:08,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816445673] [2020-01-16 17:58:08,337 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:08,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:08,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:08,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:08,338 INFO L87 Difference]: Start difference. First operand 3129 states and 15586 transitions. Second operand 12 states. [2020-01-16 17:58:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:08,568 INFO L93 Difference]: Finished difference Result 6024 states and 26819 transitions. [2020-01-16 17:58:08,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:08,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:08,584 INFO L225 Difference]: With dead ends: 6024 [2020-01-16 17:58:08,584 INFO L226 Difference]: Without dead ends: 5999 [2020-01-16 17:58:08,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2020-01-16 17:58:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3124. [2020-01-16 17:58:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:58:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15572 transitions. [2020-01-16 17:58:08,804 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15572 transitions. Word has length 31 [2020-01-16 17:58:08,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:08,805 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15572 transitions. [2020-01-16 17:58:08,805 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15572 transitions. [2020-01-16 17:58:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:08,810 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:08,810 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:08,810 INFO L426 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:08,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1395797514, now seen corresponding path program 459 times [2020-01-16 17:58:08,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:08,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484170601] [2020-01-16 17:58:08,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:09,355 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:09,482 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:09,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484170601] [2020-01-16 17:58:09,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:09,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:09,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752446121] [2020-01-16 17:58:09,493 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:09,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:09,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:09,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:09,493 INFO L87 Difference]: Start difference. First operand 3124 states and 15572 transitions. Second operand 12 states. [2020-01-16 17:58:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:09,724 INFO L93 Difference]: Finished difference Result 6017 states and 26805 transitions. [2020-01-16 17:58:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:09,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:09,740 INFO L225 Difference]: With dead ends: 6017 [2020-01-16 17:58:09,740 INFO L226 Difference]: Without dead ends: 6001 [2020-01-16 17:58:09,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-01-16 17:58:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3129. [2020-01-16 17:58:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:58:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15581 transitions. [2020-01-16 17:58:09,964 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15581 transitions. Word has length 31 [2020-01-16 17:58:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:09,964 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15581 transitions. [2020-01-16 17:58:09,965 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:09,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15581 transitions. [2020-01-16 17:58:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:09,970 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:09,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:09,970 INFO L426 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:09,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:09,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1209226878, now seen corresponding path program 460 times [2020-01-16 17:58:09,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:09,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913352962] [2020-01-16 17:58:09,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:10,630 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:10,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913352962] [2020-01-16 17:58:10,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:10,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:10,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609847689] [2020-01-16 17:58:10,640 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:10,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:10,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:10,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:10,640 INFO L87 Difference]: Start difference. First operand 3129 states and 15581 transitions. Second operand 12 states. [2020-01-16 17:58:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:10,889 INFO L93 Difference]: Finished difference Result 6018 states and 26802 transitions. [2020-01-16 17:58:10,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:10,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:10,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:10,904 INFO L225 Difference]: With dead ends: 6018 [2020-01-16 17:58:10,905 INFO L226 Difference]: Without dead ends: 5996 [2020-01-16 17:58:10,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-01-16 17:58:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3124. [2020-01-16 17:58:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:58:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15567 transitions. [2020-01-16 17:58:11,124 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15567 transitions. Word has length 31 [2020-01-16 17:58:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:11,124 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15567 transitions. [2020-01-16 17:58:11,124 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15567 transitions. [2020-01-16 17:58:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:11,129 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:11,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:11,130 INFO L426 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1629887094, now seen corresponding path program 461 times [2020-01-16 17:58:11,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:11,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840961615] [2020-01-16 17:58:11,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:11,676 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:11,805 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:11,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840961615] [2020-01-16 17:58:11,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:11,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:11,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277967604] [2020-01-16 17:58:11,815 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:11,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:11,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:11,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:11,815 INFO L87 Difference]: Start difference. First operand 3124 states and 15567 transitions. Second operand 12 states. [2020-01-16 17:58:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:12,164 INFO L93 Difference]: Finished difference Result 6026 states and 26819 transitions. [2020-01-16 17:58:12,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:12,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:12,178 INFO L225 Difference]: With dead ends: 6026 [2020-01-16 17:58:12,178 INFO L226 Difference]: Without dead ends: 6006 [2020-01-16 17:58:12,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-01-16 17:58:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-01-16 17:58:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:58:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15578 transitions. [2020-01-16 17:58:12,402 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15578 transitions. Word has length 31 [2020-01-16 17:58:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:12,402 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15578 transitions. [2020-01-16 17:58:12,402 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15578 transitions. [2020-01-16 17:58:12,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:12,407 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:12,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:12,408 INFO L426 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:12,408 INFO L82 PathProgramCache]: Analyzing trace with hash 784915642, now seen corresponding path program 462 times [2020-01-16 17:58:12,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:12,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151237349] [2020-01-16 17:58:12,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:12,957 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:58:13,089 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:13,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151237349] [2020-01-16 17:58:13,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:13,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:13,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068513027] [2020-01-16 17:58:13,099 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:13,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:13,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:13,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:13,099 INFO L87 Difference]: Start difference. First operand 3130 states and 15578 transitions. Second operand 12 states. [2020-01-16 17:58:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:13,343 INFO L93 Difference]: Finished difference Result 6023 states and 26807 transitions. [2020-01-16 17:58:13,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:13,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:13,358 INFO L225 Difference]: With dead ends: 6023 [2020-01-16 17:58:13,358 INFO L226 Difference]: Without dead ends: 5995 [2020-01-16 17:58:13,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-01-16 17:58:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 3119. [2020-01-16 17:58:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:58:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15553 transitions. [2020-01-16 17:58:13,583 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15553 transitions. Word has length 31 [2020-01-16 17:58:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:13,583 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15553 transitions. [2020-01-16 17:58:13,583 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15553 transitions. [2020-01-16 17:58:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:13,588 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:13,589 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:13,589 INFO L426 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:13,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:13,589 INFO L82 PathProgramCache]: Analyzing trace with hash 504131300, now seen corresponding path program 463 times [2020-01-16 17:58:13,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:13,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076659337] [2020-01-16 17:58:13,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:14,163 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:14,293 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:14,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-01-16 17:58:14,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076659337] [2020-01-16 17:58:14,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:14,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:14,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807436749] [2020-01-16 17:58:14,303 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:14,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:14,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:14,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:14,303 INFO L87 Difference]: Start difference. First operand 3119 states and 15553 transitions. Second operand 12 states. [2020-01-16 17:58:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:14,634 INFO L93 Difference]: Finished difference Result 6033 states and 26839 transitions. [2020-01-16 17:58:14,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:14,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:14,649 INFO L225 Difference]: With dead ends: 6033 [2020-01-16 17:58:14,649 INFO L226 Difference]: Without dead ends: 6017 [2020-01-16 17:58:14,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-01-16 17:58:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3131. [2020-01-16 17:58:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:58:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15586 transitions. [2020-01-16 17:58:14,870 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15586 transitions. Word has length 31 [2020-01-16 17:58:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:14,870 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15586 transitions. [2020-01-16 17:58:14,870 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15586 transitions. [2020-01-16 17:58:14,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:14,875 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:14,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:14,875 INFO L426 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:14,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:14,876 INFO L82 PathProgramCache]: Analyzing trace with hash -340840152, now seen corresponding path program 464 times [2020-01-16 17:58:14,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:14,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866901525] [2020-01-16 17:58:14,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:15,402 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:58:15,533 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:15,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866901525] [2020-01-16 17:58:15,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:15,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:15,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054985672] [2020-01-16 17:58:15,542 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:15,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:15,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:15,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:15,542 INFO L87 Difference]: Start difference. First operand 3131 states and 15586 transitions. Second operand 12 states. [2020-01-16 17:58:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:15,781 INFO L93 Difference]: Finished difference Result 6037 states and 26842 transitions. [2020-01-16 17:58:15,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:15,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:15,796 INFO L225 Difference]: With dead ends: 6037 [2020-01-16 17:58:15,796 INFO L226 Difference]: Without dead ends: 6012 [2020-01-16 17:58:15,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:15,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-01-16 17:58:16,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3126. [2020-01-16 17:58:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:58:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15572 transitions. [2020-01-16 17:58:16,021 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15572 transitions. Word has length 31 [2020-01-16 17:58:16,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:16,021 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15572 transitions. [2020-01-16 17:58:16,021 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15572 transitions. [2020-01-16 17:58:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:16,027 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:16,027 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:16,027 INFO L426 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:16,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash -980958026, now seen corresponding path program 465 times [2020-01-16 17:58:16,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:16,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354122001] [2020-01-16 17:58:16,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:16,720 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-01-16 17:58:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:16,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354122001] [2020-01-16 17:58:16,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:16,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:16,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404461115] [2020-01-16 17:58:16,728 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:16,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:16,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:16,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:16,729 INFO L87 Difference]: Start difference. First operand 3126 states and 15572 transitions. Second operand 12 states. [2020-01-16 17:58:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:16,971 INFO L93 Difference]: Finished difference Result 6036 states and 26839 transitions. [2020-01-16 17:58:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:16,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:16,985 INFO L225 Difference]: With dead ends: 6036 [2020-01-16 17:58:16,986 INFO L226 Difference]: Without dead ends: 6020 [2020-01-16 17:58:16,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-01-16 17:58:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3132. [2020-01-16 17:58:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:58:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15583 transitions. [2020-01-16 17:58:17,208 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15583 transitions. Word has length 31 [2020-01-16 17:58:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:17,208 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15583 transitions. [2020-01-16 17:58:17,208 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15583 transitions. [2020-01-16 17:58:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:17,213 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:17,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:17,213 INFO L426 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:17,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:17,214 INFO L82 PathProgramCache]: Analyzing trace with hash -488362264, now seen corresponding path program 466 times [2020-01-16 17:58:17,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:17,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116631235] [2020-01-16 17:58:17,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:17,756 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-01-16 17:58:17,888 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-01-16 17:58:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:17,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116631235] [2020-01-16 17:58:17,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:17,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:17,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798356370] [2020-01-16 17:58:17,897 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:17,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:17,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:17,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:17,898 INFO L87 Difference]: Start difference. First operand 3132 states and 15583 transitions. Second operand 12 states. [2020-01-16 17:58:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:18,142 INFO L93 Difference]: Finished difference Result 6042 states and 26845 transitions. [2020-01-16 17:58:18,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:18,142 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:18,156 INFO L225 Difference]: With dead ends: 6042 [2020-01-16 17:58:18,157 INFO L226 Difference]: Without dead ends: 6014 [2020-01-16 17:58:18,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:18,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-01-16 17:58:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3126. [2020-01-16 17:58:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:58:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15566 transitions. [2020-01-16 17:58:18,381 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15566 transitions. Word has length 31 [2020-01-16 17:58:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:18,382 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15566 transitions. [2020-01-16 17:58:18,382 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15566 transitions. [2020-01-16 17:58:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:18,387 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:18,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:18,387 INFO L426 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:18,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:18,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2044726582, now seen corresponding path program 467 times [2020-01-16 17:58:18,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:18,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489208751] [2020-01-16 17:58:18,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:18,933 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:58:19,062 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:19,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489208751] [2020-01-16 17:58:19,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:19,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:19,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665709101] [2020-01-16 17:58:19,072 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:19,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:19,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:19,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:19,073 INFO L87 Difference]: Start difference. First operand 3126 states and 15566 transitions. Second operand 12 states. [2020-01-16 17:58:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:19,343 INFO L93 Difference]: Finished difference Result 6049 states and 26862 transitions. [2020-01-16 17:58:19,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:19,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:19,359 INFO L225 Difference]: With dead ends: 6049 [2020-01-16 17:58:19,359 INFO L226 Difference]: Without dead ends: 6029 [2020-01-16 17:58:19,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2020-01-16 17:58:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3137. [2020-01-16 17:58:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-01-16 17:58:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15586 transitions. [2020-01-16 17:58:19,583 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15586 transitions. Word has length 31 [2020-01-16 17:58:19,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:19,583 INFO L478 AbstractCegarLoop]: Abstraction has 3137 states and 15586 transitions. [2020-01-16 17:58:19,583 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15586 transitions. [2020-01-16 17:58:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:19,588 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:19,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:19,589 INFO L426 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash -912673500, now seen corresponding path program 468 times [2020-01-16 17:58:19,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:19,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372385182] [2020-01-16 17:58:19,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:20,156 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-01-16 17:58:20,284 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-01-16 17:58:20,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-01-16 17:58:20,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372385182] [2020-01-16 17:58:20,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:20,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:20,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397432778] [2020-01-16 17:58:20,294 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:20,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:20,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:20,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:20,295 INFO L87 Difference]: Start difference. First operand 3137 states and 15586 transitions. Second operand 12 states. [2020-01-16 17:58:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:20,509 INFO L93 Difference]: Finished difference Result 6051 states and 26856 transitions. [2020-01-16 17:58:20,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:20,509 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:20,524 INFO L225 Difference]: With dead ends: 6051 [2020-01-16 17:58:20,524 INFO L226 Difference]: Without dead ends: 6011 [2020-01-16 17:58:20,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-01-16 17:58:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3119. [2020-01-16 17:58:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:58:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15546 transitions. [2020-01-16 17:58:20,748 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15546 transitions. Word has length 31 [2020-01-16 17:58:20,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:20,748 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15546 transitions. [2020-01-16 17:58:20,749 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15546 transitions. [2020-01-16 17:58:20,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:20,754 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:20,754 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:20,754 INFO L426 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:20,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:20,755 INFO L82 PathProgramCache]: Analyzing trace with hash -188926364, now seen corresponding path program 469 times [2020-01-16 17:58:20,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:20,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649226831] [2020-01-16 17:58:20,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:21,434 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-01-16 17:58:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:21,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649226831] [2020-01-16 17:58:21,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:21,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:21,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722112904] [2020-01-16 17:58:21,444 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:21,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:21,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:21,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:21,444 INFO L87 Difference]: Start difference. First operand 3119 states and 15546 transitions. Second operand 12 states. [2020-01-16 17:58:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:21,734 INFO L93 Difference]: Finished difference Result 6022 states and 26808 transitions. [2020-01-16 17:58:21,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:21,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:21,748 INFO L225 Difference]: With dead ends: 6022 [2020-01-16 17:58:21,748 INFO L226 Difference]: Without dead ends: 6006 [2020-01-16 17:58:21,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-01-16 17:58:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-01-16 17:58:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:58:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15577 transitions. [2020-01-16 17:58:21,969 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15577 transitions. Word has length 31 [2020-01-16 17:58:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:21,970 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15577 transitions. [2020-01-16 17:58:21,970 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15577 transitions. [2020-01-16 17:58:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:21,975 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:21,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:21,975 INFO L426 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:21,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1878869268, now seen corresponding path program 470 times [2020-01-16 17:58:21,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:21,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488086059] [2020-01-16 17:58:21,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:22,453 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2020-01-16 17:58:22,575 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:58:22,705 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:22,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488086059] [2020-01-16 17:58:22,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:22,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:22,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61265538] [2020-01-16 17:58:22,714 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:22,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:22,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:22,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:22,715 INFO L87 Difference]: Start difference. First operand 3130 states and 15577 transitions. Second operand 12 states. [2020-01-16 17:58:22,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:22,952 INFO L93 Difference]: Finished difference Result 6023 states and 26805 transitions. [2020-01-16 17:58:22,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:22,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:22,967 INFO L225 Difference]: With dead ends: 6023 [2020-01-16 17:58:22,967 INFO L226 Difference]: Without dead ends: 6001 [2020-01-16 17:58:22,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-01-16 17:58:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3125. [2020-01-16 17:58:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:58:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15563 transitions. [2020-01-16 17:58:23,189 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15563 transitions. Word has length 31 [2020-01-16 17:58:23,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:23,189 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15563 transitions. [2020-01-16 17:58:23,189 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:23,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15563 transitions. [2020-01-16 17:58:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:23,194 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:23,194 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:23,195 INFO L426 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:23,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1249704454, now seen corresponding path program 471 times [2020-01-16 17:58:23,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:23,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172059466] [2020-01-16 17:58:23,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:23,724 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:58:23,855 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-01-16 17:58:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:23,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172059466] [2020-01-16 17:58:23,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:23,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:23,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587802997] [2020-01-16 17:58:23,864 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:23,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:23,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:23,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:23,864 INFO L87 Difference]: Start difference. First operand 3125 states and 15563 transitions. Second operand 12 states. [2020-01-16 17:58:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:24,093 INFO L93 Difference]: Finished difference Result 6028 states and 26814 transitions. [2020-01-16 17:58:24,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:24,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:24,108 INFO L225 Difference]: With dead ends: 6028 [2020-01-16 17:58:24,108 INFO L226 Difference]: Without dead ends: 6012 [2020-01-16 17:58:24,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-01-16 17:58:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3131. [2020-01-16 17:58:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:58:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15574 transitions. [2020-01-16 17:58:24,329 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15574 transitions. Word has length 31 [2020-01-16 17:58:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:24,329 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15574 transitions. [2020-01-16 17:58:24,329 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15574 transitions. [2020-01-16 17:58:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:24,334 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:24,334 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:24,335 INFO L426 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:24,335 INFO L82 PathProgramCache]: Analyzing trace with hash -757108692, now seen corresponding path program 472 times [2020-01-16 17:58:24,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:24,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741929909] [2020-01-16 17:58:24,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:24,867 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-01-16 17:58:24,997 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-01-16 17:58:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:25,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741929909] [2020-01-16 17:58:25,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:25,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:25,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897244865] [2020-01-16 17:58:25,007 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:25,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:25,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:25,007 INFO L87 Difference]: Start difference. First operand 3131 states and 15574 transitions. Second operand 12 states. [2020-01-16 17:58:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:25,194 INFO L93 Difference]: Finished difference Result 6034 states and 26820 transitions. [2020-01-16 17:58:25,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:25,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:25,209 INFO L225 Difference]: With dead ends: 6034 [2020-01-16 17:58:25,210 INFO L226 Difference]: Without dead ends: 6006 [2020-01-16 17:58:25,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-01-16 17:58:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3125. [2020-01-16 17:58:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:58:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15557 transitions. [2020-01-16 17:58:25,431 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15557 transitions. Word has length 31 [2020-01-16 17:58:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:25,431 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15557 transitions. [2020-01-16 17:58:25,431 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15557 transitions. [2020-01-16 17:58:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:25,436 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:25,436 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:25,436 INFO L426 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:25,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:25,436 INFO L82 PathProgramCache]: Analyzing trace with hash 506697466, now seen corresponding path program 473 times [2020-01-16 17:58:25,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:25,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899096629] [2020-01-16 17:58:25,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:26,097 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:26,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899096629] [2020-01-16 17:58:26,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:26,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:26,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017116513] [2020-01-16 17:58:26,106 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:26,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:26,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:26,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:26,107 INFO L87 Difference]: Start difference. First operand 3125 states and 15557 transitions. Second operand 12 states. [2020-01-16 17:58:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:26,420 INFO L93 Difference]: Finished difference Result 6031 states and 26815 transitions. [2020-01-16 17:58:26,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:26,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:26,434 INFO L225 Difference]: With dead ends: 6031 [2020-01-16 17:58:26,434 INFO L226 Difference]: Without dead ends: 6014 [2020-01-16 17:58:26,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-01-16 17:58:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3132. [2020-01-16 17:58:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:58:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15570 transitions. [2020-01-16 17:58:26,656 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15570 transitions. Word has length 31 [2020-01-16 17:58:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:26,657 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15570 transitions. [2020-01-16 17:58:26,657 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15570 transitions. [2020-01-16 17:58:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:26,662 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:26,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:26,662 INFO L426 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:26,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1605731164, now seen corresponding path program 474 times [2020-01-16 17:58:26,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:26,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29777562] [2020-01-16 17:58:26,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:27,213 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:58:27,340 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:27,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29777562] [2020-01-16 17:58:27,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:27,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:27,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360098408] [2020-01-16 17:58:27,351 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:27,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:27,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:27,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:27,351 INFO L87 Difference]: Start difference. First operand 3132 states and 15570 transitions. Second operand 12 states. [2020-01-16 17:58:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:27,549 INFO L93 Difference]: Finished difference Result 6036 states and 26818 transitions. [2020-01-16 17:58:27,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:27,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:27,563 INFO L225 Difference]: With dead ends: 6036 [2020-01-16 17:58:27,563 INFO L226 Difference]: Without dead ends: 6001 [2020-01-16 17:58:27,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:27,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-01-16 17:58:27,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3119. [2020-01-16 17:58:27,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-01-16 17:58:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15540 transitions. [2020-01-16 17:58:27,787 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15540 transitions. Word has length 31 [2020-01-16 17:58:27,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:27,787 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 15540 transitions. [2020-01-16 17:58:27,787 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15540 transitions. [2020-01-16 17:58:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:27,792 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:27,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:27,792 INFO L426 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:27,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1726955480, now seen corresponding path program 475 times [2020-01-16 17:58:27,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:27,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166708187] [2020-01-16 17:58:27,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:28,348 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:28,477 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58: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-01-16 17:58:28,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166708187] [2020-01-16 17:58:28,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:28,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:28,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490630440] [2020-01-16 17:58:28,487 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:28,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:28,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:28,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:28,488 INFO L87 Difference]: Start difference. First operand 3119 states and 15540 transitions. Second operand 12 states. [2020-01-16 17:58:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:28,728 INFO L93 Difference]: Finished difference Result 6043 states and 26851 transitions. [2020-01-16 17:58:28,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:28,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:28,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:28,743 INFO L225 Difference]: With dead ends: 6043 [2020-01-16 17:58:28,743 INFO L226 Difference]: Without dead ends: 6023 [2020-01-16 17:58:28,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-01-16 17:58:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3133. [2020-01-16 17:58:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:58:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15579 transitions. [2020-01-16 17:58:28,964 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15579 transitions. Word has length 31 [2020-01-16 17:58:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:28,964 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15579 transitions. [2020-01-16 17:58:28,964 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15579 transitions. [2020-01-16 17:58:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:28,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:28,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:28,970 INFO L426 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:28,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:28,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1723040364, now seen corresponding path program 476 times [2020-01-16 17:58:28,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:28,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193945356] [2020-01-16 17:58:28,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:29,513 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:58:29,647 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:29,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193945356] [2020-01-16 17:58:29,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:29,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:29,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673358227] [2020-01-16 17:58:29,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:29,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:29,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:29,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:29,657 INFO L87 Difference]: Start difference. First operand 3133 states and 15579 transitions. Second operand 12 states. [2020-01-16 17:58:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:29,900 INFO L93 Difference]: Finished difference Result 6040 states and 26839 transitions. [2020-01-16 17:58:29,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:29,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:29,915 INFO L225 Difference]: With dead ends: 6040 [2020-01-16 17:58:29,915 INFO L226 Difference]: Without dead ends: 6017 [2020-01-16 17:58:29,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-01-16 17:58:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3127. [2020-01-16 17:58:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:58:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15562 transitions. [2020-01-16 17:58:30,135 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15562 transitions. Word has length 31 [2020-01-16 17:58:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:30,135 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15562 transitions. [2020-01-16 17:58:30,135 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15562 transitions. [2020-01-16 17:58:30,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:30,140 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:30,141 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:30,141 INFO L426 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:30,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:30,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1507233726, now seen corresponding path program 477 times [2020-01-16 17:58:30,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:30,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535237719] [2020-01-16 17:58:30,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:30,863 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:30,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535237719] [2020-01-16 17:58:30,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:30,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:30,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961319547] [2020-01-16 17:58:30,873 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:30,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:30,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:30,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:30,873 INFO L87 Difference]: Start difference. First operand 3127 states and 15562 transitions. Second operand 12 states. [2020-01-16 17:58:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:31,193 INFO L93 Difference]: Finished difference Result 6053 states and 26866 transitions. [2020-01-16 17:58:31,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:31,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:31,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:31,208 INFO L225 Difference]: With dead ends: 6053 [2020-01-16 17:58:31,209 INFO L226 Difference]: Without dead ends: 6033 [2020-01-16 17:58:31,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:31,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-01-16 17:58:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3138. [2020-01-16 17:58:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-01-16 17:58:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15582 transitions. [2020-01-16 17:58:31,434 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15582 transitions. Word has length 31 [2020-01-16 17:58:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:31,435 INFO L478 AbstractCegarLoop]: Abstraction has 3138 states and 15582 transitions. [2020-01-16 17:58:31,435 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15582 transitions. [2020-01-16 17:58:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:31,441 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:31,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:31,441 INFO L426 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:31,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:31,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1450166356, now seen corresponding path program 478 times [2020-01-16 17:58:31,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:31,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225793266] [2020-01-16 17:58:31,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:32,007 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:58:32,134 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:32,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225793266] [2020-01-16 17:58:32,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:32,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:32,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263502433] [2020-01-16 17:58:32,143 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:32,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:32,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:32,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:32,144 INFO L87 Difference]: Start difference. First operand 3138 states and 15582 transitions. Second operand 12 states. [2020-01-16 17:58:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:32,365 INFO L93 Difference]: Finished difference Result 6055 states and 26860 transitions. [2020-01-16 17:58:32,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:32,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:32,380 INFO L225 Difference]: With dead ends: 6055 [2020-01-16 17:58:32,381 INFO L226 Difference]: Without dead ends: 6022 [2020-01-16 17:58:32,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-01-16 17:58:32,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3127. [2020-01-16 17:58:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:58:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15554 transitions. [2020-01-16 17:58:32,601 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15554 transitions. Word has length 31 [2020-01-16 17:58:32,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:32,601 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15554 transitions. [2020-01-16 17:58:32,601 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15554 transitions. [2020-01-16 17:58:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:32,606 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:32,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:32,607 INFO L426 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:32,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:32,607 INFO L82 PathProgramCache]: Analyzing trace with hash 237951038, now seen corresponding path program 479 times [2020-01-16 17:58:32,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:32,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074172353] [2020-01-16 17:58:32,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:33,157 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:58:33,290 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:33,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074172353] [2020-01-16 17:58:33,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:33,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:33,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811516163] [2020-01-16 17:58:33,299 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:33,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:33,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:33,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:33,300 INFO L87 Difference]: Start difference. First operand 3127 states and 15554 transitions. Second operand 12 states. [2020-01-16 17:58:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:33,524 INFO L93 Difference]: Finished difference Result 6043 states and 26836 transitions. [2020-01-16 17:58:33,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:33,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:33,540 INFO L225 Difference]: With dead ends: 6043 [2020-01-16 17:58:33,540 INFO L226 Difference]: Without dead ends: 6026 [2020-01-16 17:58:33,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-01-16 17:58:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3134. [2020-01-16 17:58:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 17:58:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15567 transitions. [2020-01-16 17:58:33,760 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15567 transitions. Word has length 31 [2020-01-16 17:58:33,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:33,760 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15567 transitions. [2020-01-16 17:58:33,760 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15567 transitions. [2020-01-16 17:58:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:33,765 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:33,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:33,765 INFO L426 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:33,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:33,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1874477592, now seen corresponding path program 480 times [2020-01-16 17:58:33,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:33,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161543755] [2020-01-16 17:58:33,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:34,331 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:58:34,458 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:34,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161543755] [2020-01-16 17:58:34,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:34,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:34,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119513589] [2020-01-16 17:58:34,467 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:34,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:34,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:34,468 INFO L87 Difference]: Start difference. First operand 3134 states and 15567 transitions. Second operand 12 states. [2020-01-16 17:58:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:34,798 INFO L93 Difference]: Finished difference Result 6048 states and 26839 transitions. [2020-01-16 17:58:34,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:34,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:34,812 INFO L225 Difference]: With dead ends: 6048 [2020-01-16 17:58:34,812 INFO L226 Difference]: Without dead ends: 5996 [2020-01-16 17:58:34,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-01-16 17:58:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3104. [2020-01-16 17:58:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-01-16 17:58:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15505 transitions. [2020-01-16 17:58:35,032 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15505 transitions. Word has length 31 [2020-01-16 17:58:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:35,032 INFO L478 AbstractCegarLoop]: Abstraction has 3104 states and 15505 transitions. [2020-01-16 17:58:35,032 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15505 transitions. [2020-01-16 17:58:35,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:35,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:35,037 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:35,038 INFO L426 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:35,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:35,038 INFO L82 PathProgramCache]: Analyzing trace with hash 727124524, now seen corresponding path program 481 times [2020-01-16 17:58:35,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:35,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028016841] [2020-01-16 17:58:35,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:35,563 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:58:35,694 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:58:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:35,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028016841] [2020-01-16 17:58:35,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:35,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:35,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503277617] [2020-01-16 17:58:35,704 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:35,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:35,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:35,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:35,704 INFO L87 Difference]: Start difference. First operand 3104 states and 15505 transitions. Second operand 12 states. [2020-01-16 17:58:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:35,987 INFO L93 Difference]: Finished difference Result 5985 states and 26750 transitions. [2020-01-16 17:58:35,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:35,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:36,002 INFO L225 Difference]: With dead ends: 5985 [2020-01-16 17:58:36,002 INFO L226 Difference]: Without dead ends: 5966 [2020-01-16 17:58:36,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-01-16 17:58:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3125. [2020-01-16 17:58:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:58:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15591 transitions. [2020-01-16 17:58:36,224 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15591 transitions. Word has length 31 [2020-01-16 17:58:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:36,224 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15591 transitions. [2020-01-16 17:58:36,224 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15591 transitions. [2020-01-16 17:58:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:36,229 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:36,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:36,229 INFO L426 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:36,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:36,229 INFO L82 PathProgramCache]: Analyzing trace with hash 304638798, now seen corresponding path program 482 times [2020-01-16 17:58:36,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:36,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527051738] [2020-01-16 17:58:36,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:36,764 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:58:36,896 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:58:36,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-01-16 17:58:36,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527051738] [2020-01-16 17:58:36,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:36,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:36,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108367665] [2020-01-16 17:58:36,906 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:36,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:36,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:36,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:36,907 INFO L87 Difference]: Start difference. First operand 3125 states and 15591 transitions. Second operand 12 states. [2020-01-16 17:58:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:37,258 INFO L93 Difference]: Finished difference Result 5982 states and 26739 transitions. [2020-01-16 17:58:37,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:37,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:37,273 INFO L225 Difference]: With dead ends: 5982 [2020-01-16 17:58:37,273 INFO L226 Difference]: Without dead ends: 5961 [2020-01-16 17:58:37,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2020-01-16 17:58:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 3120. [2020-01-16 17:58:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:58:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15577 transitions. [2020-01-16 17:58:37,492 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15577 transitions. Word has length 31 [2020-01-16 17:58:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:37,492 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15577 transitions. [2020-01-16 17:58:37,492 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15577 transitions. [2020-01-16 17:58:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:37,497 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:37,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:37,498 INFO L426 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:37,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:37,498 INFO L82 PathProgramCache]: Analyzing trace with hash -121497948, now seen corresponding path program 483 times [2020-01-16 17:58:37,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:37,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681823878] [2020-01-16 17:58:37,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:38,038 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:58:38,173 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:58:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:38,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681823878] [2020-01-16 17:58:38,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:38,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:38,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610339439] [2020-01-16 17:58:38,183 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:38,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:38,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:38,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:38,183 INFO L87 Difference]: Start difference. First operand 3120 states and 15577 transitions. Second operand 12 states. [2020-01-16 17:58:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:38,537 INFO L93 Difference]: Finished difference Result 5987 states and 26750 transitions. [2020-01-16 17:58:38,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:38,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:38,551 INFO L225 Difference]: With dead ends: 5987 [2020-01-16 17:58:38,551 INFO L226 Difference]: Without dead ends: 5968 [2020-01-16 17:58:38,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-01-16 17:58:38,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3126. [2020-01-16 17:58:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:58:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15588 transitions. [2020-01-16 17:58:38,776 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15588 transitions. Word has length 31 [2020-01-16 17:58:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:38,776 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15588 transitions. [2020-01-16 17:58:38,776 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15588 transitions. [2020-01-16 17:58:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:38,781 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:38,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:38,781 INFO L426 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:38,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:38,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2061040718, now seen corresponding path program 484 times [2020-01-16 17:58:38,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:38,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530102160] [2020-01-16 17:58:38,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:39,435 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:58:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:39,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530102160] [2020-01-16 17:58:39,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:39,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:39,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894553291] [2020-01-16 17:58:39,445 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:39,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:39,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:39,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:39,445 INFO L87 Difference]: Start difference. First operand 3126 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:58:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:39,804 INFO L93 Difference]: Finished difference Result 5985 states and 26740 transitions. [2020-01-16 17:58:39,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:39,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:39,818 INFO L225 Difference]: With dead ends: 5985 [2020-01-16 17:58:39,818 INFO L226 Difference]: Without dead ends: 5962 [2020-01-16 17:58:39,818 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-01-16 17:58:40,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3120. [2020-01-16 17:58:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:58:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15572 transitions. [2020-01-16 17:58:40,079 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15572 transitions. Word has length 31 [2020-01-16 17:58:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:40,080 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15572 transitions. [2020-01-16 17:58:40,080 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15572 transitions. [2020-01-16 17:58:40,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:40,085 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:40,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:40,085 INFO L426 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:40,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:40,085 INFO L82 PathProgramCache]: Analyzing trace with hash -756139292, now seen corresponding path program 485 times [2020-01-16 17:58:40,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:40,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296692304] [2020-01-16 17:58:40,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:40,625 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:58:40,756 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:58:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:40,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296692304] [2020-01-16 17:58:40,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:40,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:40,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704254917] [2020-01-16 17:58:40,766 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:40,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:40,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:40,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:40,766 INFO L87 Difference]: Start difference. First operand 3120 states and 15572 transitions. Second operand 12 states. [2020-01-16 17:58:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:40,986 INFO L93 Difference]: Finished difference Result 5980 states and 26730 transitions. [2020-01-16 17:58:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:40,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:41,001 INFO L225 Difference]: With dead ends: 5980 [2020-01-16 17:58:41,001 INFO L226 Difference]: Without dead ends: 5964 [2020-01-16 17:58:41,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:41,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-01-16 17:58:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3125. [2020-01-16 17:58:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:58:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15581 transitions. [2020-01-16 17:58:41,227 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15581 transitions. Word has length 31 [2020-01-16 17:58:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:41,228 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15581 transitions. [2020-01-16 17:58:41,228 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15581 transitions. [2020-01-16 17:58:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:41,233 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:41,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:41,234 INFO L426 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:41,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:41,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1848885100, now seen corresponding path program 486 times [2020-01-16 17:58:41,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:41,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829527757] [2020-01-16 17:58:41,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:41,810 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:41,941 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:58:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:41,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829527757] [2020-01-16 17:58:41,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:41,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:41,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663429256] [2020-01-16 17:58:41,951 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:41,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:41,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:41,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:41,951 INFO L87 Difference]: Start difference. First operand 3125 states and 15581 transitions. Second operand 12 states. [2020-01-16 17:58:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:42,173 INFO L93 Difference]: Finished difference Result 5981 states and 26727 transitions. [2020-01-16 17:58:42,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:42,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:42,187 INFO L225 Difference]: With dead ends: 5981 [2020-01-16 17:58:42,188 INFO L226 Difference]: Without dead ends: 5954 [2020-01-16 17:58:42,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-01-16 17:58:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3115. [2020-01-16 17:58:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-01-16 17:58:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15558 transitions. [2020-01-16 17:58:42,408 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15558 transitions. Word has length 31 [2020-01-16 17:58:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:42,409 INFO L478 AbstractCegarLoop]: Abstraction has 3115 states and 15558 transitions. [2020-01-16 17:58:42,409 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15558 transitions. [2020-01-16 17:58:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:42,414 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:42,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:42,414 INFO L426 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash 458378096, now seen corresponding path program 487 times [2020-01-16 17:58:42,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:42,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272397640] [2020-01-16 17:58:42,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:42,949 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:58:43,080 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:58:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:43,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272397640] [2020-01-16 17:58:43,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:43,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:43,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539962622] [2020-01-16 17:58:43,089 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:43,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:43,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:43,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:43,090 INFO L87 Difference]: Start difference. First operand 3115 states and 15558 transitions. Second operand 12 states. [2020-01-16 17:58:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:43,308 INFO L93 Difference]: Finished difference Result 5987 states and 26750 transitions. [2020-01-16 17:58:43,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:43,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:43,323 INFO L225 Difference]: With dead ends: 5987 [2020-01-16 17:58:43,324 INFO L226 Difference]: Without dead ends: 5968 [2020-01-16 17:58:43,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-01-16 17:58:43,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3125. [2020-01-16 17:58:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:58:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15586 transitions. [2020-01-16 17:58:43,544 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15586 transitions. Word has length 31 [2020-01-16 17:58:43,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:43,544 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15586 transitions. [2020-01-16 17:58:43,544 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15586 transitions. [2020-01-16 17:58:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:43,549 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:43,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:43,549 INFO L426 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:43,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:43,549 INFO L82 PathProgramCache]: Analyzing trace with hash 35892370, now seen corresponding path program 488 times [2020-01-16 17:58:43,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:43,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249051121] [2020-01-16 17:58:43,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:44,088 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:58:44,215 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:58:44,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-01-16 17:58:44,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249051121] [2020-01-16 17:58:44,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:44,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:44,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726226599] [2020-01-16 17:58:44,224 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:44,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:44,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:44,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:44,225 INFO L87 Difference]: Start difference. First operand 3125 states and 15586 transitions. Second operand 12 states. [2020-01-16 17:58:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:44,442 INFO L93 Difference]: Finished difference Result 5984 states and 26739 transitions. [2020-01-16 17:58:44,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:44,443 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:44,457 INFO L225 Difference]: With dead ends: 5984 [2020-01-16 17:58:44,457 INFO L226 Difference]: Without dead ends: 5963 [2020-01-16 17:58:44,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2020-01-16 17:58:44,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 3120. [2020-01-16 17:58:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:58:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15572 transitions. [2020-01-16 17:58:44,675 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15572 transitions. Word has length 31 [2020-01-16 17:58:44,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:44,675 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15572 transitions. [2020-01-16 17:58:44,675 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15572 transitions. [2020-01-16 17:58:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:44,681 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:44,681 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:44,681 INFO L426 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash -814555612, now seen corresponding path program 489 times [2020-01-16 17:58:44,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:44,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863959985] [2020-01-16 17:58:44,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:45,225 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:58:45,358 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:58:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:45,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863959985] [2020-01-16 17:58:45,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:45,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:45,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203930797] [2020-01-16 17:58:45,368 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:45,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:45,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:45,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:45,368 INFO L87 Difference]: Start difference. First operand 3120 states and 15572 transitions. Second operand 12 states. [2020-01-16 17:58:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:45,593 INFO L93 Difference]: Finished difference Result 5991 states and 26755 transitions. [2020-01-16 17:58:45,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:45,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:45,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:45,608 INFO L225 Difference]: With dead ends: 5991 [2020-01-16 17:58:45,608 INFO L226 Difference]: Without dead ends: 5972 [2020-01-16 17:58:45,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-01-16 17:58:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3127. [2020-01-16 17:58:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:58:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15585 transitions. [2020-01-16 17:58:45,832 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15585 transitions. Word has length 31 [2020-01-16 17:58:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:45,832 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15585 transitions. [2020-01-16 17:58:45,832 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15585 transitions. [2020-01-16 17:58:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:45,837 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:45,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:45,838 INFO L426 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:45,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:45,838 INFO L82 PathProgramCache]: Analyzing trace with hash 523011602, now seen corresponding path program 490 times [2020-01-16 17:58:45,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:45,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493512492] [2020-01-16 17:58:45,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:46,382 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:58:46,513 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:58:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:46,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493512492] [2020-01-16 17:58:46,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:46,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:46,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941749539] [2020-01-16 17:58:46,523 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:46,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:46,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:46,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:46,523 INFO L87 Difference]: Start difference. First operand 3127 states and 15585 transitions. Second operand 12 states. [2020-01-16 17:58:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:46,741 INFO L93 Difference]: Finished difference Result 5990 states and 26746 transitions. [2020-01-16 17:58:46,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:46,742 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:46,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:46,756 INFO L225 Difference]: With dead ends: 5990 [2020-01-16 17:58:46,756 INFO L226 Difference]: Without dead ends: 5965 [2020-01-16 17:58:46,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5965 states. [2020-01-16 17:58:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5965 to 3120. [2020-01-16 17:58:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:58:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15567 transitions. [2020-01-16 17:58:46,981 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15567 transitions. Word has length 31 [2020-01-16 17:58:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:46,981 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15567 transitions. [2020-01-16 17:58:46,981 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:46,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15567 transitions. [2020-01-16 17:58:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:46,987 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:46,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:46,987 INFO L426 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:46,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:46,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1449196956, now seen corresponding path program 491 times [2020-01-16 17:58:46,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:46,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329755987] [2020-01-16 17:58:46,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:47,518 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:47,647 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:58:47,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-01-16 17:58:47,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329755987] [2020-01-16 17:58:47,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:47,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:47,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957315312] [2020-01-16 17:58:47,657 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:47,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:47,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:47,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:47,658 INFO L87 Difference]: Start difference. First operand 3120 states and 15567 transitions. Second operand 12 states. [2020-01-16 17:58:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:47,881 INFO L93 Difference]: Finished difference Result 5983 states and 26732 transitions. [2020-01-16 17:58:47,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:47,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:47,896 INFO L225 Difference]: With dead ends: 5983 [2020-01-16 17:58:47,897 INFO L226 Difference]: Without dead ends: 5967 [2020-01-16 17:58:47,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2020-01-16 17:58:48,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 3125. [2020-01-16 17:58:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:58:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-01-16 17:58:48,123 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-01-16 17:58:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:48,123 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-01-16 17:58:48,123 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-01-16 17:58:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:48,128 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:48,128 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:48,128 INFO L426 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:48,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash 310855984, now seen corresponding path program 492 times [2020-01-16 17:58:48,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:48,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219068234] [2020-01-16 17:58:48,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:48,415 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-01-16 17:58:48,717 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:58:48,844 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:58:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:48,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219068234] [2020-01-16 17:58:48,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:48,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:48,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987363790] [2020-01-16 17:58:48,854 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:48,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:48,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:48,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:48,854 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-01-16 17:58:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:49,120 INFO L93 Difference]: Finished difference Result 5985 states and 26731 transitions. [2020-01-16 17:58:49,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:49,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:49,136 INFO L225 Difference]: With dead ends: 5985 [2020-01-16 17:58:49,136 INFO L226 Difference]: Without dead ends: 5957 [2020-01-16 17:58:49,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-01-16 17:58:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3115. [2020-01-16 17:58:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-01-16 17:58:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15553 transitions. [2020-01-16 17:58:49,362 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15553 transitions. Word has length 31 [2020-01-16 17:58:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:49,362 INFO L478 AbstractCegarLoop]: Abstraction has 3115 states and 15553 transitions. [2020-01-16 17:58:49,362 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15553 transitions. [2020-01-16 17:58:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:49,367 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:49,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:49,367 INFO L426 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:49,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash -927737232, now seen corresponding path program 493 times [2020-01-16 17:58:49,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:49,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102280080] [2020-01-16 17:58:49,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:50,033 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:58:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:50,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102280080] [2020-01-16 17:58:50,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:50,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:50,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180958344] [2020-01-16 17:58:50,042 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:50,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:50,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:50,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:50,042 INFO L87 Difference]: Start difference. First operand 3115 states and 15553 transitions. Second operand 12 states. [2020-01-16 17:58:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:50,265 INFO L93 Difference]: Finished difference Result 5993 states and 26762 transitions. [2020-01-16 17:58:50,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:50,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:50,279 INFO L225 Difference]: With dead ends: 5993 [2020-01-16 17:58:50,280 INFO L226 Difference]: Without dead ends: 5974 [2020-01-16 17:58:50,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:50,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-01-16 17:58:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3127. [2020-01-16 17:58:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:58:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15587 transitions. [2020-01-16 17:58:50,503 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15587 transitions. Word has length 31 [2020-01-16 17:58:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:50,503 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15587 transitions. [2020-01-16 17:58:50,504 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15587 transitions. [2020-01-16 17:58:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:50,509 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:50,509 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:50,509 INFO L426 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:50,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:50,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1254801434, now seen corresponding path program 494 times [2020-01-16 17:58:50,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:50,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673402637] [2020-01-16 17:58:50,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:51,061 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:51,186 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:58:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:51,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673402637] [2020-01-16 17:58:51,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:51,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:51,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955327895] [2020-01-16 17:58:51,195 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:51,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:51,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:51,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:51,196 INFO L87 Difference]: Start difference. First operand 3127 states and 15587 transitions. Second operand 12 states. [2020-01-16 17:58:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:51,413 INFO L93 Difference]: Finished difference Result 5991 states and 26752 transitions. [2020-01-16 17:58:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:51,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:51,429 INFO L225 Difference]: With dead ends: 5991 [2020-01-16 17:58:51,429 INFO L226 Difference]: Without dead ends: 5968 [2020-01-16 17:58:51,429 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-01-16 17:58:51,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-01-16 17:58:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:58:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-01-16 17:58:51,659 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-01-16 17:58:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:51,659 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-01-16 17:58:51,659 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-01-16 17:58:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:51,665 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:51,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:51,665 INFO L426 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:51,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:51,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1352048468, now seen corresponding path program 495 times [2020-01-16 17:58:51,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:51,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740145069] [2020-01-16 17:58:51,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:52,219 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:58:52,349 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 17:58:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:52,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740145069] [2020-01-16 17:58:52,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:52,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:52,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215222170] [2020-01-16 17:58:52,359 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:52,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:52,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:52,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:52,359 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-01-16 17:58:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:52,614 INFO L93 Difference]: Finished difference Result 5995 states and 26761 transitions. [2020-01-16 17:58:52,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:52,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:52,630 INFO L225 Difference]: With dead ends: 5995 [2020-01-16 17:58:52,630 INFO L226 Difference]: Without dead ends: 5976 [2020-01-16 17:58:52,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-01-16 17:58:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3128. [2020-01-16 17:58:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:58:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-01-16 17:58:52,856 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-01-16 17:58:52,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:52,856 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-01-16 17:58:52,856 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-01-16 17:58:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:52,862 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:52,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:52,862 INFO L426 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:52,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:52,862 INFO L82 PathProgramCache]: Analyzing trace with hash -14481254, now seen corresponding path program 496 times [2020-01-16 17:58:52,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:52,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021431412] [2020-01-16 17:58:52,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:53,415 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:53,545 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:53,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021431412] [2020-01-16 17:58:53,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:53,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:53,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536143152] [2020-01-16 17:58:53,555 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:53,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:53,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:53,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:53,556 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-01-16 17:58:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:53,784 INFO L93 Difference]: Finished difference Result 5994 states and 26752 transitions. [2020-01-16 17:58:53,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:53,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:53,798 INFO L225 Difference]: With dead ends: 5994 [2020-01-16 17:58:53,798 INFO L226 Difference]: Without dead ends: 5969 [2020-01-16 17:58:53,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-01-16 17:58:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-01-16 17:58:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:58:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15564 transitions. [2020-01-16 17:58:54,018 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15564 transitions. Word has length 31 [2020-01-16 17:58:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:54,018 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15564 transitions. [2020-01-16 17:58:54,018 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15564 transitions. [2020-01-16 17:58:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:54,023 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:54,023 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:54,023 INFO L426 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:54,023 INFO L82 PathProgramCache]: Analyzing trace with hash -230287892, now seen corresponding path program 497 times [2020-01-16 17:58:54,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:54,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256555103] [2020-01-16 17:58:54,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:54,561 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:58:54,694 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:54,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256555103] [2020-01-16 17:58:54,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:54,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:54,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425703146] [2020-01-16 17:58:54,705 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:54,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:54,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:54,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:54,705 INFO L87 Difference]: Start difference. First operand 3121 states and 15564 transitions. Second operand 12 states. [2020-01-16 17:58:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:54,933 INFO L93 Difference]: Finished difference Result 5990 states and 26744 transitions. [2020-01-16 17:58:54,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:54,934 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:54,948 INFO L225 Difference]: With dead ends: 5990 [2020-01-16 17:58:54,949 INFO L226 Difference]: Without dead ends: 5973 [2020-01-16 17:58:54,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-01-16 17:58:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3127. [2020-01-16 17:58:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:58:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15575 transitions. [2020-01-16 17:58:55,169 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15575 transitions. Word has length 31 [2020-01-16 17:58:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:55,169 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15575 transitions. [2020-01-16 17:58:55,169 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15575 transitions. [2020-01-16 17:58:55,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:55,174 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:55,174 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:55,174 INFO L426 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1075259344, now seen corresponding path program 498 times [2020-01-16 17:58:55,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:55,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710152455] [2020-01-16 17:58:55,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:55,725 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:55,850 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58:55,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-01-16 17:58:55,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710152455] [2020-01-16 17:58:55,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:55,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:55,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181198046] [2020-01-16 17:58:55,859 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:55,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:55,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:55,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:55,860 INFO L87 Difference]: Start difference. First operand 3127 states and 15575 transitions. Second operand 12 states. [2020-01-16 17:58:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:56,083 INFO L93 Difference]: Finished difference Result 5991 states and 26740 transitions. [2020-01-16 17:58:56,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:56,084 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:56,098 INFO L225 Difference]: With dead ends: 5991 [2020-01-16 17:58:56,098 INFO L226 Difference]: Without dead ends: 5961 [2020-01-16 17:58:56,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2020-01-16 17:58:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 3115. [2020-01-16 17:58:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-01-16 17:58:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15548 transitions. [2020-01-16 17:58:56,318 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15548 transitions. Word has length 31 [2020-01-16 17:58:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:56,318 INFO L478 AbstractCegarLoop]: Abstraction has 3115 states and 15548 transitions. [2020-01-16 17:58:56,319 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15548 transitions. [2020-01-16 17:58:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:56,324 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:56,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:56,324 INFO L426 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash 450731858, now seen corresponding path program 499 times [2020-01-16 17:58:56,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:56,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309708594] [2020-01-16 17:58:56,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:56,884 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:57,015 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 17:58:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:57,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309708594] [2020-01-16 17:58:57,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:57,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:57,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361506682] [2020-01-16 17:58:57,024 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:57,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:57,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:57,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:57,024 INFO L87 Difference]: Start difference. First operand 3115 states and 15548 transitions. Second operand 12 states. [2020-01-16 17:58:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:57,300 INFO L93 Difference]: Finished difference Result 5979 states and 26723 transitions. [2020-01-16 17:58:57,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:57,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:57,315 INFO L225 Difference]: With dead ends: 5979 [2020-01-16 17:58:57,316 INFO L226 Difference]: Without dead ends: 5963 [2020-01-16 17:58:57,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2020-01-16 17:58:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 3125. [2020-01-16 17:58:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:58:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-01-16 17:58:57,541 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-01-16 17:58:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:57,541 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-01-16 17:58:57,541 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-01-16 17:58:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:57,546 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58: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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:57,547 INFO L426 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:57,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:57,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1239211046, now seen corresponding path program 500 times [2020-01-16 17:58:57,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:57,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628322704] [2020-01-16 17:58:57,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:58,220 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:58:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:58,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628322704] [2020-01-16 17:58:58,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:58,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:58,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822253163] [2020-01-16 17:58:58,230 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:58,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:58,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:58,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:58,230 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-01-16 17:58:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:58,453 INFO L93 Difference]: Finished difference Result 5980 states and 26720 transitions. [2020-01-16 17:58:58,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:58,454 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:58,468 INFO L225 Difference]: With dead ends: 5980 [2020-01-16 17:58:58,469 INFO L226 Difference]: Without dead ends: 5958 [2020-01-16 17:58:58,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:58,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-01-16 17:58:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3120. [2020-01-16 17:58:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:58:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15562 transitions. [2020-01-16 17:58:58,691 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15562 transitions. Word has length 31 [2020-01-16 17:58:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:58,692 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15562 transitions. [2020-01-16 17:58:58,692 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15562 transitions. [2020-01-16 17:58:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:58,697 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:58,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:58,697 INFO L426 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:58,697 INFO L82 PathProgramCache]: Analyzing trace with hash 26420622, now seen corresponding path program 501 times [2020-01-16 17:58:58,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:58,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258193007] [2020-01-16 17:58:58,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:58:59,232 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:58:59,361 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:58:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:58:59,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258193007] [2020-01-16 17:58:59,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:58:59,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:58:59,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291929326] [2020-01-16 17:58:59,371 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:58:59,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:58:59,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:58:59,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:58:59,371 INFO L87 Difference]: Start difference. First operand 3120 states and 15562 transitions. Second operand 12 states. [2020-01-16 17:58:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:58:59,676 INFO L93 Difference]: Finished difference Result 5980 states and 26720 transitions. [2020-01-16 17:58:59,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:58:59,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:58:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:58:59,692 INFO L225 Difference]: With dead ends: 5980 [2020-01-16 17:58:59,692 INFO L226 Difference]: Without dead ends: 5964 [2020-01-16 17:58:59,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:58:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-01-16 17:58:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3125. [2020-01-16 17:58:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 17:58:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15571 transitions. [2020-01-16 17:58:59,912 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15571 transitions. Word has length 31 [2020-01-16 17:58:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:58:59,912 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15571 transitions. [2020-01-16 17:58:59,913 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:58:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15571 transitions. [2020-01-16 17:58:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:58:59,918 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:58:59,918 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:58:59,918 INFO L426 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:58:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:58:59,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1786473562, now seen corresponding path program 502 times [2020-01-16 17:58:59,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:58:59,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415471209] [2020-01-16 17:58:59,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:58:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:00,457 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:00,591 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:00,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-01-16 17:59:00,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415471209] [2020-01-16 17:59:00,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:00,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:00,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022907111] [2020-01-16 17:59:00,601 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:00,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:00,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:00,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:00,602 INFO L87 Difference]: Start difference. First operand 3125 states and 15571 transitions. Second operand 12 states. [2020-01-16 17:59:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:00,876 INFO L93 Difference]: Finished difference Result 5982 states and 26719 transitions. [2020-01-16 17:59:00,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:00,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:00,890 INFO L225 Difference]: With dead ends: 5982 [2020-01-16 17:59:00,890 INFO L226 Difference]: Without dead ends: 5959 [2020-01-16 17:59:00,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:01,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2020-01-16 17:59:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 3120. [2020-01-16 17:59:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-01-16 17:59:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15557 transitions. [2020-01-16 17:59:01,110 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15557 transitions. Word has length 31 [2020-01-16 17:59:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:01,110 INFO L478 AbstractCegarLoop]: Abstraction has 3120 states and 15557 transitions. [2020-01-16 17:59:01,110 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15557 transitions. [2020-01-16 17:59:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:01,115 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:01,115 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:01,115 INFO L426 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:01,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1782822542, now seen corresponding path program 503 times [2020-01-16 17:59:01,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:01,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245910842] [2020-01-16 17:59:01,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:01,663 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:01,792 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:59:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:01,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245910842] [2020-01-16 17:59:01,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:01,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:01,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503276859] [2020-01-16 17:59:01,802 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:01,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:01,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:01,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:01,803 INFO L87 Difference]: Start difference. First operand 3120 states and 15557 transitions. Second operand 12 states. [2020-01-16 17:59:02,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:02,113 INFO L93 Difference]: Finished difference Result 5983 states and 26722 transitions. [2020-01-16 17:59:02,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:02,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:02,129 INFO L225 Difference]: With dead ends: 5983 [2020-01-16 17:59:02,129 INFO L226 Difference]: Without dead ends: 5966 [2020-01-16 17:59:02,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-01-16 17:59:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3126. [2020-01-16 17:59:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:59:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15568 transitions. [2020-01-16 17:59:02,353 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15568 transitions. Word has length 31 [2020-01-16 17:59:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:02,353 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15568 transitions. [2020-01-16 17:59:02,353 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15568 transitions. [2020-01-16 17:59:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:02,358 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:02,358 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:02,358 INFO L426 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:02,359 INFO L82 PathProgramCache]: Analyzing trace with hash 937851090, now seen corresponding path program 504 times [2020-01-16 17:59:02,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:02,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102960708] [2020-01-16 17:59:02,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:02,903 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:59:03,035 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 17:59:03,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-01-16 17:59:03,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102960708] [2020-01-16 17:59:03,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:03,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:03,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230175498] [2020-01-16 17:59:03,045 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:03,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:03,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:03,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:03,045 INFO L87 Difference]: Start difference. First operand 3126 states and 15568 transitions. Second operand 12 states. [2020-01-16 17:59:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:03,284 INFO L93 Difference]: Finished difference Result 5984 states and 26718 transitions. [2020-01-16 17:59:03,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:03,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:03,299 INFO L225 Difference]: With dead ends: 5984 [2020-01-16 17:59:03,299 INFO L226 Difference]: Without dead ends: 5950 [2020-01-16 17:59:03,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:03,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-01-16 17:59:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3110. [2020-01-16 17:59:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-01-16 17:59:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15534 transitions. [2020-01-16 17:59:03,524 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15534 transitions. Word has length 31 [2020-01-16 17:59:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:03,524 INFO L478 AbstractCegarLoop]: Abstraction has 3110 states and 15534 transitions. [2020-01-16 17:59:03,524 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15534 transitions. [2020-01-16 17:59:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:03,529 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:03,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:03,530 INFO L426 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:03,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1032166138, now seen corresponding path program 505 times [2020-01-16 17:59:03,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:03,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39823036] [2020-01-16 17:59:03,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:04,181 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:04,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39823036] [2020-01-16 17:59:04,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:04,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:04,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808049588] [2020-01-16 17:59:04,190 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:04,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:04,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:04,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:04,191 INFO L87 Difference]: Start difference. First operand 3110 states and 15534 transitions. Second operand 12 states. [2020-01-16 17:59:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:04,510 INFO L93 Difference]: Finished difference Result 5997 states and 26774 transitions. [2020-01-16 17:59:04,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:04,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:04,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:04,525 INFO L225 Difference]: With dead ends: 5997 [2020-01-16 17:59:04,525 INFO L226 Difference]: Without dead ends: 5978 [2020-01-16 17:59:04,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:04,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-01-16 17:59:04,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3126. [2020-01-16 17:59:04,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:59:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15590 transitions. [2020-01-16 17:59:04,745 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15590 transitions. Word has length 31 [2020-01-16 17:59:04,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:04,746 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15590 transitions. [2020-01-16 17:59:04,746 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:04,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15590 transitions. [2020-01-16 17:59:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:04,751 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:04,751 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:04,751 INFO L426 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:04,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:04,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1454651864, now seen corresponding path program 506 times [2020-01-16 17:59:04,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:04,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919885835] [2020-01-16 17:59:04,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:05,277 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:59:05,412 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:05,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919885835] [2020-01-16 17:59:05,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:05,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:05,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702927740] [2020-01-16 17:59:05,421 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:05,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:05,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:05,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:05,421 INFO L87 Difference]: Start difference. First operand 3126 states and 15590 transitions. Second operand 12 states. [2020-01-16 17:59:05,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:05,665 INFO L93 Difference]: Finished difference Result 5994 states and 26763 transitions. [2020-01-16 17:59:05,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:05,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:05,681 INFO L225 Difference]: With dead ends: 5994 [2020-01-16 17:59:05,681 INFO L226 Difference]: Without dead ends: 5973 [2020-01-16 17:59:05,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-01-16 17:59:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3121. [2020-01-16 17:59:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:59:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15576 transitions. [2020-01-16 17:59:05,946 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15576 transitions. Word has length 31 [2020-01-16 17:59:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:05,946 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15576 transitions. [2020-01-16 17:59:05,946 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15576 transitions. [2020-01-16 17:59:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:05,951 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:05,951 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:05,951 INFO L426 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1880788610, now seen corresponding path program 507 times [2020-01-16 17:59:05,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:05,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220729428] [2020-01-16 17:59:05,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:06,486 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:59:06,612 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:06,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220729428] [2020-01-16 17:59:06,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:06,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:06,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102215601] [2020-01-16 17:59:06,622 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:06,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:06,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:06,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:06,623 INFO L87 Difference]: Start difference. First operand 3121 states and 15576 transitions. Second operand 12 states. [2020-01-16 17:59:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:06,878 INFO L93 Difference]: Finished difference Result 5999 states and 26774 transitions. [2020-01-16 17:59:06,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:06,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:06,892 INFO L225 Difference]: With dead ends: 5999 [2020-01-16 17:59:06,892 INFO L226 Difference]: Without dead ends: 5980 [2020-01-16 17:59:06,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-01-16 17:59:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3127. [2020-01-16 17:59:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:59:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15587 transitions. [2020-01-16 17:59:07,119 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15587 transitions. Word has length 31 [2020-01-16 17:59:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:07,119 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15587 transitions. [2020-01-16 17:59:07,119 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:07,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15587 transitions. [2020-01-16 17:59:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:07,124 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:07,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:07,125 INFO L426 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:07,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash 301750056, now seen corresponding path program 508 times [2020-01-16 17:59:07,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:07,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827412878] [2020-01-16 17:59:07,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:07,662 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:59:07,791 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:07,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-01-16 17:59:07,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827412878] [2020-01-16 17:59:07,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:07,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:07,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498771367] [2020-01-16 17:59:07,801 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:07,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:07,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:07,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:07,801 INFO L87 Difference]: Start difference. First operand 3127 states and 15587 transitions. Second operand 12 states. [2020-01-16 17:59:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:08,083 INFO L93 Difference]: Finished difference Result 5997 states and 26764 transitions. [2020-01-16 17:59:08,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:08,083 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:08,097 INFO L225 Difference]: With dead ends: 5997 [2020-01-16 17:59:08,098 INFO L226 Difference]: Without dead ends: 5974 [2020-01-16 17:59:08,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-01-16 17:59:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3121. [2020-01-16 17:59:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:59:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15571 transitions. [2020-01-16 17:59:08,319 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15571 transitions. Word has length 31 [2020-01-16 17:59:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:08,319 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15571 transitions. [2020-01-16 17:59:08,319 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15571 transitions. [2020-01-16 17:59:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:08,324 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:08,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:08,324 INFO L426 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1779537342, now seen corresponding path program 509 times [2020-01-16 17:59:08,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:08,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148786062] [2020-01-16 17:59:08,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:08,870 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:59:08,999 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:09,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148786062] [2020-01-16 17:59:09,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:09,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:09,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2519668] [2020-01-16 17:59:09,009 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:09,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:09,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:09,009 INFO L87 Difference]: Start difference. First operand 3121 states and 15571 transitions. Second operand 12 states. [2020-01-16 17:59:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:09,237 INFO L93 Difference]: Finished difference Result 5992 states and 26754 transitions. [2020-01-16 17:59:09,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:09,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:09,252 INFO L225 Difference]: With dead ends: 5992 [2020-01-16 17:59:09,252 INFO L226 Difference]: Without dead ends: 5976 [2020-01-16 17:59:09,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-01-16 17:59:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3126. [2020-01-16 17:59:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:59:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15580 transitions. [2020-01-16 17:59:09,472 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15580 transitions. Word has length 31 [2020-01-16 17:59:09,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:09,473 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15580 transitions. [2020-01-16 17:59:09,473 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15580 transitions. [2020-01-16 17:59:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:09,478 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:09,478 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:09,478 INFO L426 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:09,478 INFO L82 PathProgramCache]: Analyzing trace with hash 89594438, now seen corresponding path program 510 times [2020-01-16 17:59:09,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:09,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47540615] [2020-01-16 17:59:09,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:10,017 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:59:10,146 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:10,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47540615] [2020-01-16 17:59:10,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:10,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:10,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629197346] [2020-01-16 17:59:10,156 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:10,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:10,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:10,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:10,156 INFO L87 Difference]: Start difference. First operand 3126 states and 15580 transitions. Second operand 12 states. [2020-01-16 17:59:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:10,389 INFO L93 Difference]: Finished difference Result 5993 states and 26751 transitions. [2020-01-16 17:59:10,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:10,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:10,404 INFO L225 Difference]: With dead ends: 5993 [2020-01-16 17:59:10,404 INFO L226 Difference]: Without dead ends: 5966 [2020-01-16 17:59:10,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:10,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-01-16 17:59:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3116. [2020-01-16 17:59:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-01-16 17:59:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15557 transitions. [2020-01-16 17:59:10,623 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15557 transitions. Word has length 31 [2020-01-16 17:59:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:10,623 INFO L478 AbstractCegarLoop]: Abstraction has 3116 states and 15557 transitions. [2020-01-16 17:59:10,623 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:10,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15557 transitions. [2020-01-16 17:59:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:10,628 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:10,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:10,628 INFO L426 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:10,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:10,629 INFO L82 PathProgramCache]: Analyzing trace with hash 443451440, now seen corresponding path program 511 times [2020-01-16 17:59:10,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:10,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854709897] [2020-01-16 17:59:10,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:11,280 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:11,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854709897] [2020-01-16 17:59:11,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:11,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:11,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604670690] [2020-01-16 17:59:11,289 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:11,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:11,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:11,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:11,290 INFO L87 Difference]: Start difference. First operand 3116 states and 15557 transitions. Second operand 12 states. [2020-01-16 17:59:11,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:11,523 INFO L93 Difference]: Finished difference Result 6007 states and 26791 transitions. [2020-01-16 17:59:11,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:11,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:11,538 INFO L225 Difference]: With dead ends: 6007 [2020-01-16 17:59:11,539 INFO L226 Difference]: Without dead ends: 5988 [2020-01-16 17:59:11,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:11,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-01-16 17:59:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3127. [2020-01-16 17:59:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:59:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15588 transitions. [2020-01-16 17:59:11,762 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15588 transitions. Word has length 31 [2020-01-16 17:59:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:11,763 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15588 transitions. [2020-01-16 17:59:11,763 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15588 transitions. [2020-01-16 17:59:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:11,768 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:11,768 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:11,768 INFO L426 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:11,768 INFO L82 PathProgramCache]: Analyzing trace with hash 20965714, now seen corresponding path program 512 times [2020-01-16 17:59:11,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:11,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407256010] [2020-01-16 17:59:11,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:12,302 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:59:12,426 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:12,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407256010] [2020-01-16 17:59:12,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:12,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:12,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104352413] [2020-01-16 17:59:12,435 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:12,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:12,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:12,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:12,436 INFO L87 Difference]: Start difference. First operand 3127 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:59:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:12,753 INFO L93 Difference]: Finished difference Result 6004 states and 26780 transitions. [2020-01-16 17:59:12,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:12,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:12,769 INFO L225 Difference]: With dead ends: 6004 [2020-01-16 17:59:12,769 INFO L226 Difference]: Without dead ends: 5983 [2020-01-16 17:59:12,769 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-01-16 17:59:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3122. [2020-01-16 17:59:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:59:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15574 transitions. [2020-01-16 17:59:12,987 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15574 transitions. Word has length 31 [2020-01-16 17:59:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:12,987 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15574 transitions. [2020-01-16 17:59:12,987 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15574 transitions. [2020-01-16 17:59:12,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:12,992 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:12,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:12,993 INFO L426 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:12,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:12,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1465949122, now seen corresponding path program 513 times [2020-01-16 17:59:12,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:12,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404153968] [2020-01-16 17:59:12,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:13,536 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-01-16 17:59:13,662 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:13,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404153968] [2020-01-16 17:59:13,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:13,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:13,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083587707] [2020-01-16 17:59:13,671 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:13,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:13,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:13,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:13,672 INFO L87 Difference]: Start difference. First operand 3122 states and 15574 transitions. Second operand 12 states. [2020-01-16 17:59:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:13,936 INFO L93 Difference]: Finished difference Result 6017 states and 26808 transitions. [2020-01-16 17:59:13,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:13,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:13,951 INFO L225 Difference]: With dead ends: 6017 [2020-01-16 17:59:13,951 INFO L226 Difference]: Without dead ends: 5998 [2020-01-16 17:59:13,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-01-16 17:59:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3131. [2020-01-16 17:59:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:59:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15591 transitions. [2020-01-16 17:59:14,177 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15591 transitions. Word has length 31 [2020-01-16 17:59:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:14,177 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15591 transitions. [2020-01-16 17:59:14,177 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15591 transitions. [2020-01-16 17:59:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:14,182 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:14,183 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:14,183 INFO L426 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:14,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1395839086, now seen corresponding path program 514 times [2020-01-16 17:59:14,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:14,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888023448] [2020-01-16 17:59:14,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:14,539 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2020-01-16 17:59:14,774 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:59:14,906 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:14,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-01-16 17:59:14,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888023448] [2020-01-16 17:59:14,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:14,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:14,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111941410] [2020-01-16 17:59:14,915 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:14,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:14,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:14,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:14,915 INFO L87 Difference]: Start difference. First operand 3131 states and 15591 transitions. Second operand 12 states. [2020-01-16 17:59:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:15,120 INFO L93 Difference]: Finished difference Result 6020 states and 26805 transitions. [2020-01-16 17:59:15,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:15,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:15,136 INFO L225 Difference]: With dead ends: 6020 [2020-01-16 17:59:15,136 INFO L226 Difference]: Without dead ends: 5989 [2020-01-16 17:59:15,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-01-16 17:59:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3122. [2020-01-16 17:59:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:59:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15568 transitions. [2020-01-16 17:59:15,360 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15568 transitions. Word has length 31 [2020-01-16 17:59:15,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:15,360 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15568 transitions. [2020-01-16 17:59:15,360 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15568 transitions. [2020-01-16 17:59:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:15,365 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:15,365 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:15,365 INFO L426 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2100590466, now seen corresponding path program 515 times [2020-01-16 17:59:15,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:15,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715074169] [2020-01-16 17:59:15,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:15,886 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:59:16,012 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:16,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715074169] [2020-01-16 17:59:16,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:16,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:16,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815241113] [2020-01-16 17:59:16,021 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:16,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:16,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:16,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:16,021 INFO L87 Difference]: Start difference. First operand 3122 states and 15568 transitions. Second operand 12 states. [2020-01-16 17:59:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:16,311 INFO L93 Difference]: Finished difference Result 6008 states and 26781 transitions. [2020-01-16 17:59:16,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:16,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:16,326 INFO L225 Difference]: With dead ends: 6008 [2020-01-16 17:59:16,326 INFO L226 Difference]: Without dead ends: 5992 [2020-01-16 17:59:16,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:16,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-01-16 17:59:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3128. [2020-01-16 17:59:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:59:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15579 transitions. [2020-01-16 17:59:16,552 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15579 transitions. Word has length 31 [2020-01-16 17:59:16,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:16,552 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15579 transitions. [2020-01-16 17:59:16,552 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15579 transitions. [2020-01-16 17:59:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:16,557 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:16,557 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:16,557 INFO L426 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:16,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:16,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1607994704, now seen corresponding path program 516 times [2020-01-16 17:59:16,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:16,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792423650] [2020-01-16 17:59:16,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:17,093 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:59:17,224 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:17,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-01-16 17:59:17,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792423650] [2020-01-16 17:59:17,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:17,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:17,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263005597] [2020-01-16 17:59:17,233 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:17,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:17,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:17,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:17,233 INFO L87 Difference]: Start difference. First operand 3128 states and 15579 transitions. Second operand 12 states. [2020-01-16 17:59:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:17,446 INFO L93 Difference]: Finished difference Result 6014 states and 26787 transitions. [2020-01-16 17:59:17,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:17,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:17,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:17,462 INFO L225 Difference]: With dead ends: 6014 [2020-01-16 17:59:17,462 INFO L226 Difference]: Without dead ends: 5980 [2020-01-16 17:59:17,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-01-16 17:59:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3116. [2020-01-16 17:59:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-01-16 17:59:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15551 transitions. [2020-01-16 17:59:17,687 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15551 transitions. Word has length 31 [2020-01-16 17:59:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:17,687 INFO L478 AbstractCegarLoop]: Abstraction has 3116 states and 15551 transitions. [2020-01-16 17:59:17,687 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15551 transitions. [2020-01-16 17:59:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:17,692 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:17,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:17,692 INFO L426 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:17,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:17,692 INFO L82 PathProgramCache]: Analyzing trace with hash -942663888, now seen corresponding path program 517 times [2020-01-16 17:59:17,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:17,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744864908] [2020-01-16 17:59:17,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:18,218 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:59:18,345 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:18,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744864908] [2020-01-16 17:59:18,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:18,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:18,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538994495] [2020-01-16 17:59:18,355 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:18,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:18,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:18,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:18,355 INFO L87 Difference]: Start difference. First operand 3116 states and 15551 transitions. Second operand 12 states. [2020-01-16 17:59:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:18,598 INFO L93 Difference]: Finished difference Result 6013 states and 26802 transitions. [2020-01-16 17:59:18,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:18,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:18,614 INFO L225 Difference]: With dead ends: 6013 [2020-01-16 17:59:18,614 INFO L226 Difference]: Without dead ends: 5994 [2020-01-16 17:59:18,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-01-16 17:59:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3129. [2020-01-16 17:59:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:59:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15588 transitions. [2020-01-16 17:59:18,839 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15588 transitions. Word has length 31 [2020-01-16 17:59:18,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:18,839 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15588 transitions. [2020-01-16 17:59:18,839 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15588 transitions. [2020-01-16 17:59:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:18,844 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:18,845 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:18,845 INFO L426 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1239874778, now seen corresponding path program 518 times [2020-01-16 17:59:18,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:18,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447251942] [2020-01-16 17:59:18,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:19,377 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:59:19,504 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:19,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447251942] [2020-01-16 17:59:19,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:19,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:19,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309504370] [2020-01-16 17:59:19,514 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:19,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:19,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:19,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:19,514 INFO L87 Difference]: Start difference. First operand 3129 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:59:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:19,759 INFO L93 Difference]: Finished difference Result 6011 states and 26792 transitions. [2020-01-16 17:59:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:19,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:19,773 INFO L225 Difference]: With dead ends: 6011 [2020-01-16 17:59:19,773 INFO L226 Difference]: Without dead ends: 5988 [2020-01-16 17:59:19,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-01-16 17:59:19,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3123. [2020-01-16 17:59:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:59:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15571 transitions. [2020-01-16 17:59:19,999 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15571 transitions. Word has length 31 [2020-01-16 17:59:19,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:19,999 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15571 transitions. [2020-01-16 17:59:19,999 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15571 transitions. [2020-01-16 17:59:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:20,005 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:20,005 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:20,005 INFO L426 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:20,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2003441978, now seen corresponding path program 519 times [2020-01-16 17:59:20,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:20,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171057265] [2020-01-16 17:59:20,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:20,546 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 17:59:20,679 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:20,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171057265] [2020-01-16 17:59:20,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:20,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:20,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242100158] [2020-01-16 17:59:20,689 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:20,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:20,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:20,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:20,689 INFO L87 Difference]: Start difference. First operand 3123 states and 15571 transitions. Second operand 12 states. [2020-01-16 17:59:20,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:20,949 INFO L93 Difference]: Finished difference Result 6021 states and 26813 transitions. [2020-01-16 17:59:20,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:20,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:20,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:20,963 INFO L225 Difference]: With dead ends: 6021 [2020-01-16 17:59:20,964 INFO L226 Difference]: Without dead ends: 6002 [2020-01-16 17:59:20,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-01-16 17:59:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3132. [2020-01-16 17:59:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:59:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15588 transitions. [2020-01-16 17:59:21,190 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15588 transitions. Word has length 31 [2020-01-16 17:59:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:21,191 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15588 transitions. [2020-01-16 17:59:21,191 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15588 transitions. [2020-01-16 17:59:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:21,196 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:21,196 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:21,196 INFO L426 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:21,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:21,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1933331942, now seen corresponding path program 520 times [2020-01-16 17:59:21,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:21,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433708538] [2020-01-16 17:59:21,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:21,742 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:59:21,872 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:21,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-01-16 17:59:21,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433708538] [2020-01-16 17:59:21,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:21,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:21,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563596816] [2020-01-16 17:59:21,882 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:21,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:21,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:21,883 INFO L87 Difference]: Start difference. First operand 3132 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:59:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:22,128 INFO L93 Difference]: Finished difference Result 6024 states and 26810 transitions. [2020-01-16 17:59:22,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:22,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:22,144 INFO L225 Difference]: With dead ends: 6024 [2020-01-16 17:59:22,144 INFO L226 Difference]: Without dead ends: 5993 [2020-01-16 17:59:22,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-01-16 17:59:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3123. [2020-01-16 17:59:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 17:59:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15564 transitions. [2020-01-16 17:59:22,369 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15564 transitions. Word has length 31 [2020-01-16 17:59:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:22,369 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15564 transitions. [2020-01-16 17:59:22,369 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15564 transitions. [2020-01-16 17:59:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:22,374 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:22,374 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:22,374 INFO L426 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:22,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash -881681402, now seen corresponding path program 521 times [2020-01-16 17:59:22,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:22,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88163421] [2020-01-16 17:59:22,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:22,893 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:59:23,025 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:23,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88163421] [2020-01-16 17:59:23,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:23,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:23,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908219695] [2020-01-16 17:59:23,035 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:23,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:23,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:23,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:23,035 INFO L87 Difference]: Start difference. First operand 3123 states and 15564 transitions. Second operand 12 states. [2020-01-16 17:59:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:23,298 INFO L93 Difference]: Finished difference Result 6015 states and 26792 transitions. [2020-01-16 17:59:23,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:23,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:23,313 INFO L225 Difference]: With dead ends: 6015 [2020-01-16 17:59:23,313 INFO L226 Difference]: Without dead ends: 5998 [2020-01-16 17:59:23,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-01-16 17:59:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3130. [2020-01-16 17:59:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:59:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15577 transitions. [2020-01-16 17:59:23,573 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15577 transitions. Word has length 31 [2020-01-16 17:59:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:23,573 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15577 transitions. [2020-01-16 17:59:23,573 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15577 transitions. [2020-01-16 17:59:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:23,578 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:23,579 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:23,579 INFO L426 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:23,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:23,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1300857264, now seen corresponding path program 522 times [2020-01-16 17:59:23,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:23,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697051081] [2020-01-16 17:59:23,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:24,115 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:59:24,246 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:24,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697051081] [2020-01-16 17:59:24,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:24,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:24,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98210757] [2020-01-16 17:59:24,256 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:24,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:24,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:24,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:24,256 INFO L87 Difference]: Start difference. First operand 3130 states and 15577 transitions. Second operand 12 states. [2020-01-16 17:59:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:24,525 INFO L93 Difference]: Finished difference Result 6020 states and 26795 transitions. [2020-01-16 17:59:24,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:24,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:24,539 INFO L225 Difference]: With dead ends: 6020 [2020-01-16 17:59:24,539 INFO L226 Difference]: Without dead ends: 5984 [2020-01-16 17:59:24,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-01-16 17:59:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3116. [2020-01-16 17:59:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-01-16 17:59:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15545 transitions. [2020-01-16 17:59:24,760 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15545 transitions. Word has length 31 [2020-01-16 17:59:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:24,760 INFO L478 AbstractCegarLoop]: Abstraction has 3116 states and 15545 transitions. [2020-01-16 17:59:24,761 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15545 transitions. [2020-01-16 17:59:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:24,766 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:24,766 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:24,766 INFO L426 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:24,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash 435805202, now seen corresponding path program 523 times [2020-01-16 17:59:24,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:24,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157637718] [2020-01-16 17:59:24,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:25,288 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:59:25,419 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:25,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157637718] [2020-01-16 17:59:25,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:25,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:25,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411791708] [2020-01-16 17:59:25,429 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:25,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:25,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:25,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:25,429 INFO L87 Difference]: Start difference. First operand 3116 states and 15545 transitions. Second operand 12 states. [2020-01-16 17:59:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:25,686 INFO L93 Difference]: Finished difference Result 5998 states and 26759 transitions. [2020-01-16 17:59:25,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:25,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:25,700 INFO L225 Difference]: With dead ends: 5998 [2020-01-16 17:59:25,700 INFO L226 Difference]: Without dead ends: 5982 [2020-01-16 17:59:25,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-01-16 17:59:25,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3127. [2020-01-16 17:59:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:59:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15576 transitions. [2020-01-16 17:59:25,926 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15576 transitions. Word has length 31 [2020-01-16 17:59:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:25,926 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15576 transitions. [2020-01-16 17:59:25,926 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15576 transitions. [2020-01-16 17:59:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:25,931 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:25,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:25,932 INFO L426 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:25,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:25,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1254137702, now seen corresponding path program 524 times [2020-01-16 17:59:25,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:25,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056996483] [2020-01-16 17:59:25,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:26,464 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:59:26,593 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:26,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-01-16 17:59:26,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056996483] [2020-01-16 17:59:26,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:26,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:26,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921229720] [2020-01-16 17:59:26,602 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:26,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:26,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:26,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:26,603 INFO L87 Difference]: Start difference. First operand 3127 states and 15576 transitions. Second operand 12 states. [2020-01-16 17:59:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:26,956 INFO L93 Difference]: Finished difference Result 5999 states and 26756 transitions. [2020-01-16 17:59:26,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:26,957 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:26,972 INFO L225 Difference]: With dead ends: 5999 [2020-01-16 17:59:26,972 INFO L226 Difference]: Without dead ends: 5977 [2020-01-16 17:59:26,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2020-01-16 17:59:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 3122. [2020-01-16 17:59:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:59:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15562 transitions. [2020-01-16 17:59:27,192 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15562 transitions. Word has length 31 [2020-01-16 17:59:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:27,192 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15562 transitions. [2020-01-16 17:59:27,192 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15562 transitions. [2020-01-16 17:59:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:27,197 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:27,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:27,198 INFO L426 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:27,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:27,198 INFO L82 PathProgramCache]: Analyzing trace with hash -624972888, now seen corresponding path program 525 times [2020-01-16 17:59:27,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:27,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996242586] [2020-01-16 17:59:27,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:27,717 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-01-16 17:59:27,847 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:27,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996242586] [2020-01-16 17:59:27,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:27,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:27,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690298697] [2020-01-16 17:59:27,856 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:27,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:27,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:27,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:27,857 INFO L87 Difference]: Start difference. First operand 3122 states and 15562 transitions. Second operand 12 states. [2020-01-16 17:59:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:28,216 INFO L93 Difference]: Finished difference Result 6004 states and 26765 transitions. [2020-01-16 17:59:28,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:28,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:28,232 INFO L225 Difference]: With dead ends: 6004 [2020-01-16 17:59:28,232 INFO L226 Difference]: Without dead ends: 5988 [2020-01-16 17:59:28,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-01-16 17:59:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3128. [2020-01-16 17:59:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:59:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15573 transitions. [2020-01-16 17:59:28,456 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15573 transitions. Word has length 31 [2020-01-16 17:59:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:28,456 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15573 transitions. [2020-01-16 17:59:28,456 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15573 transitions. [2020-01-16 17:59:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:28,461 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:28,461 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:28,462 INFO L426 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:28,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:28,462 INFO L82 PathProgramCache]: Analyzing trace with hash -132377126, now seen corresponding path program 526 times [2020-01-16 17:59:28,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:28,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919258360] [2020-01-16 17:59:28,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:28,995 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:59:29,125 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:29,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919258360] [2020-01-16 17:59:29,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:29,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:29,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855897300] [2020-01-16 17:59:29,135 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:29,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:29,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:29,136 INFO L87 Difference]: Start difference. First operand 3128 states and 15573 transitions. Second operand 12 states. [2020-01-16 17:59:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:29,457 INFO L93 Difference]: Finished difference Result 6010 states and 26771 transitions. [2020-01-16 17:59:29,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:29,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:29,472 INFO L225 Difference]: With dead ends: 6010 [2020-01-16 17:59:29,473 INFO L226 Difference]: Without dead ends: 5982 [2020-01-16 17:59:29,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:29,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-01-16 17:59:29,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3122. [2020-01-16 17:59:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:59:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15556 transitions. [2020-01-16 17:59:29,698 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15556 transitions. Word has length 31 [2020-01-16 17:59:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:29,698 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15556 transitions. [2020-01-16 17:59:29,698 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15556 transitions. [2020-01-16 17:59:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:29,703 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:29,703 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:29,703 INFO L426 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1131429032, now seen corresponding path program 527 times [2020-01-16 17:59:29,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:29,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361945306] [2020-01-16 17:59:29,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:30,232 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:59:30,363 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:30,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361945306] [2020-01-16 17:59:30,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:30,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:30,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381788465] [2020-01-16 17:59:30,373 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:30,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:30,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:30,373 INFO L87 Difference]: Start difference. First operand 3122 states and 15556 transitions. Second operand 12 states. [2020-01-16 17:59:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:30,729 INFO L93 Difference]: Finished difference Result 6007 states and 26766 transitions. [2020-01-16 17:59:30,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:30,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:30,744 INFO L225 Difference]: With dead ends: 6007 [2020-01-16 17:59:30,744 INFO L226 Difference]: Without dead ends: 5990 [2020-01-16 17:59:30,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2020-01-16 17:59:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 3129. [2020-01-16 17:59:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 17:59:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15569 transitions. [2020-01-16 17:59:30,964 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15569 transitions. Word has length 31 [2020-01-16 17:59:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:30,964 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15569 transitions. [2020-01-16 17:59:30,964 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15569 transitions. [2020-01-16 17:59:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:30,969 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:30,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:30,969 INFO L426 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:30,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:30,970 INFO L82 PathProgramCache]: Analyzing trace with hash -980999598, now seen corresponding path program 528 times [2020-01-16 17:59:30,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:30,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723528158] [2020-01-16 17:59:30,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:31,511 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:59:31,642 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:31,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723528158] [2020-01-16 17:59:31,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:31,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:31,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223728534] [2020-01-16 17:59:31,652 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:31,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:31,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:31,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:31,652 INFO L87 Difference]: Start difference. First operand 3129 states and 15569 transitions. Second operand 12 states. [2020-01-16 17:59:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:31,863 INFO L93 Difference]: Finished difference Result 6012 states and 26769 transitions. [2020-01-16 17:59:31,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:31,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:31,879 INFO L225 Difference]: With dead ends: 6012 [2020-01-16 17:59:31,879 INFO L226 Difference]: Without dead ends: 5971 [2020-01-16 17:59:31,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:32,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5971 states. [2020-01-16 17:59:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5971 to 3110. [2020-01-16 17:59:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-01-16 17:59:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15528 transitions. [2020-01-16 17:59:32,104 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15528 transitions. Word has length 31 [2020-01-16 17:59:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:32,104 INFO L478 AbstractCegarLoop]: Abstraction has 3110 states and 15528 transitions. [2020-01-16 17:59:32,104 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15528 transitions. [2020-01-16 17:59:32,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:32,110 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:32,110 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:32,110 INFO L426 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:32,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:32,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1042117242, now seen corresponding path program 529 times [2020-01-16 17:59:32,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:32,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471829472] [2020-01-16 17:59:32,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:32,685 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:32,821 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:32,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:32,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471829472] [2020-01-16 17:59:32,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:32,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:32,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103873200] [2020-01-16 17:59:32,830 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:32,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:32,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:32,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:32,830 INFO L87 Difference]: Start difference. First operand 3110 states and 15528 transitions. Second operand 12 states. [2020-01-16 17:59:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:33,048 INFO L93 Difference]: Finished difference Result 6003 states and 26785 transitions. [2020-01-16 17:59:33,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:33,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:33,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:33,064 INFO L225 Difference]: With dead ends: 6003 [2020-01-16 17:59:33,064 INFO L226 Difference]: Without dead ends: 5984 [2020-01-16 17:59:33,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-01-16 17:59:33,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3126. [2020-01-16 17:59:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:59:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15584 transitions. [2020-01-16 17:59:33,285 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15584 transitions. Word has length 31 [2020-01-16 17:59:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:33,285 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15584 transitions. [2020-01-16 17:59:33,285 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15584 transitions. [2020-01-16 17:59:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:33,291 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:33,291 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:33,291 INFO L426 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1464602968, now seen corresponding path program 530 times [2020-01-16 17:59:33,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:33,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706101974] [2020-01-16 17:59:33,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:33,823 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:59:33,950 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:33,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706101974] [2020-01-16 17:59:33,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:33,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:33,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834916629] [2020-01-16 17:59:33,959 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:33,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:33,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:33,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:33,960 INFO L87 Difference]: Start difference. First operand 3126 states and 15584 transitions. Second operand 12 states. [2020-01-16 17:59:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:34,181 INFO L93 Difference]: Finished difference Result 6000 states and 26774 transitions. [2020-01-16 17:59:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:34,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:34,196 INFO L225 Difference]: With dead ends: 6000 [2020-01-16 17:59:34,196 INFO L226 Difference]: Without dead ends: 5979 [2020-01-16 17:59:34,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:34,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2020-01-16 17:59:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3121. [2020-01-16 17:59:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:59:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-01-16 17:59:34,419 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-01-16 17:59:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:34,420 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-01-16 17:59:34,420 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-01-16 17:59:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:34,425 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:34,425 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:34,425 INFO L426 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:34,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:34,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1979916346, now seen corresponding path program 531 times [2020-01-16 17:59:34,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:34,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657949882] [2020-01-16 17:59:34,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:34,956 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:35,087 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:35,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657949882] [2020-01-16 17:59:35,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:35,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:35,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677611477] [2020-01-16 17:59:35,097 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:35,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:35,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:35,098 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-01-16 17:59:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:35,318 INFO L93 Difference]: Finished difference Result 6007 states and 26790 transitions. [2020-01-16 17:59:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:35,319 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:35,334 INFO L225 Difference]: With dead ends: 6007 [2020-01-16 17:59:35,334 INFO L226 Difference]: Without dead ends: 5988 [2020-01-16 17:59:35,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:35,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-01-16 17:59:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3128. [2020-01-16 17:59:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:59:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-01-16 17:59:35,554 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-01-16 17:59:35,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:35,554 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-01-16 17:59:35,554 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-01-16 17:59:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:35,559 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:35,559 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:35,560 INFO L426 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:35,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:35,560 INFO L82 PathProgramCache]: Analyzing trace with hash -977483736, now seen corresponding path program 532 times [2020-01-16 17:59:35,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:35,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086064680] [2020-01-16 17:59:35,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:36,090 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:36,220 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:36,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086064680] [2020-01-16 17:59:36,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:36,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:36,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901920330] [2020-01-16 17:59:36,230 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:36,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:36,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:36,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:36,230 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-01-16 17:59:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:36,442 INFO L93 Difference]: Finished difference Result 6006 states and 26781 transitions. [2020-01-16 17:59:36,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:36,443 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:36,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:36,458 INFO L225 Difference]: With dead ends: 6006 [2020-01-16 17:59:36,459 INFO L226 Difference]: Without dead ends: 5981 [2020-01-16 17:59:36,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:36,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-01-16 17:59:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3121. [2020-01-16 17:59:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 17:59:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15565 transitions. [2020-01-16 17:59:36,682 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15565 transitions. Word has length 31 [2020-01-16 17:59:36,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:36,683 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15565 transitions. [2020-01-16 17:59:36,683 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15565 transitions. [2020-01-16 17:59:36,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:36,688 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:36,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:36,688 INFO L426 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:36,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:36,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1345275002, now seen corresponding path program 533 times [2020-01-16 17:59:36,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:36,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236423207] [2020-01-16 17:59:36,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:37,223 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:59:37,354 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:37,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-01-16 17:59:37,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236423207] [2020-01-16 17:59:37,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:37,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:37,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780620550] [2020-01-16 17:59:37,363 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:37,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:37,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:37,364 INFO L87 Difference]: Start difference. First operand 3121 states and 15565 transitions. Second operand 12 states. [2020-01-16 17:59:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:37,630 INFO L93 Difference]: Finished difference Result 5999 states and 26767 transitions. [2020-01-16 17:59:37,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:37,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:37,646 INFO L225 Difference]: With dead ends: 5999 [2020-01-16 17:59:37,646 INFO L226 Difference]: Without dead ends: 5983 [2020-01-16 17:59:37,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-01-16 17:59:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3126. [2020-01-16 17:59:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 17:59:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15574 transitions. [2020-01-16 17:59:37,873 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15574 transitions. Word has length 31 [2020-01-16 17:59:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:37,873 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15574 transitions. [2020-01-16 17:59:37,873 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15574 transitions. [2020-01-16 17:59:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:37,878 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:37,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:37,878 INFO L426 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:37,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:37,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1189639354, now seen corresponding path program 534 times [2020-01-16 17:59:37,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:37,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644908058] [2020-01-16 17:59:37,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:38,410 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:38,542 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:38,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-01-16 17:59:38,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644908058] [2020-01-16 17:59:38,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:38,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:38,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218544250] [2020-01-16 17:59:38,552 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:38,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:38,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:38,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:38,552 INFO L87 Difference]: Start difference. First operand 3126 states and 15574 transitions. Second operand 12 states. [2020-01-16 17:59:38,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:38,779 INFO L93 Difference]: Finished difference Result 6001 states and 26766 transitions. [2020-01-16 17:59:38,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:38,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:38,793 INFO L225 Difference]: With dead ends: 6001 [2020-01-16 17:59:38,793 INFO L226 Difference]: Without dead ends: 5973 [2020-01-16 17:59:38,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-01-16 17:59:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3116. [2020-01-16 17:59:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-01-16 17:59:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15551 transitions. [2020-01-16 17:59:39,015 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15551 transitions. Word has length 31 [2020-01-16 17:59:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:39,016 INFO L478 AbstractCegarLoop]: Abstraction has 3116 states and 15551 transitions. [2020-01-16 17:59:39,016 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15551 transitions. [2020-01-16 17:59:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:39,021 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:39,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:39,021 INFO L426 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:39,021 INFO L82 PathProgramCache]: Analyzing trace with hash 702246764, now seen corresponding path program 535 times [2020-01-16 17:59:39,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:39,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898286931] [2020-01-16 17:59:39,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:39,558 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:39,693 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:39,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-01-16 17:59:39,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898286931] [2020-01-16 17:59:39,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:39,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:39,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938987250] [2020-01-16 17:59:39,702 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:39,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:39,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:39,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:39,702 INFO L87 Difference]: Start difference. First operand 3116 states and 15551 transitions. Second operand 12 states. [2020-01-16 17:59:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:39,970 INFO L93 Difference]: Finished difference Result 6011 states and 26797 transitions. [2020-01-16 17:59:39,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:39,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:39,984 INFO L225 Difference]: With dead ends: 6011 [2020-01-16 17:59:39,985 INFO L226 Difference]: Without dead ends: 5992 [2020-01-16 17:59:39,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-01-16 17:59:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3127. [2020-01-16 17:59:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:59:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15582 transitions. [2020-01-16 17:59:40,204 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15582 transitions. Word has length 31 [2020-01-16 17:59:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:40,204 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15582 transitions. [2020-01-16 17:59:40,204 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15582 transitions. [2020-01-16 17:59:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:40,209 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:40,209 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:40,209 INFO L426 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:40,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:40,210 INFO L82 PathProgramCache]: Analyzing trace with hash 279761038, now seen corresponding path program 536 times [2020-01-16 17:59:40,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:40,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376222573] [2020-01-16 17:59:40,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:40,751 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:59:40,881 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:40,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-01-16 17:59:40,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376222573] [2020-01-16 17:59:40,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:40,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:40,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396199858] [2020-01-16 17:59:40,891 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:40,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:40,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:40,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:40,891 INFO L87 Difference]: Start difference. First operand 3127 states and 15582 transitions. Second operand 12 states. [2020-01-16 17:59:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:41,160 INFO L93 Difference]: Finished difference Result 6008 states and 26786 transitions. [2020-01-16 17:59:41,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:41,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:41,175 INFO L225 Difference]: With dead ends: 6008 [2020-01-16 17:59:41,176 INFO L226 Difference]: Without dead ends: 5987 [2020-01-16 17:59:41,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:41,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-01-16 17:59:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3122. [2020-01-16 17:59:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:59:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15568 transitions. [2020-01-16 17:59:41,395 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15568 transitions. Word has length 31 [2020-01-16 17:59:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:41,395 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15568 transitions. [2020-01-16 17:59:41,395 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15568 transitions. [2020-01-16 17:59:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:41,400 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:41,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:41,401 INFO L426 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:41,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1207153798, now seen corresponding path program 537 times [2020-01-16 17:59:41,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:41,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069464950] [2020-01-16 17:59:41,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:41,932 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:42,066 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:42,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-01-16 17:59:42,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069464950] [2020-01-16 17:59:42,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:42,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:42,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653988377] [2020-01-16 17:59:42,075 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:42,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:42,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:42,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:42,076 INFO L87 Difference]: Start difference. First operand 3122 states and 15568 transitions. Second operand 12 states. [2020-01-16 17:59:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:42,377 INFO L93 Difference]: Finished difference Result 6021 states and 26814 transitions. [2020-01-16 17:59:42,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:42,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:42,392 INFO L225 Difference]: With dead ends: 6021 [2020-01-16 17:59:42,392 INFO L226 Difference]: Without dead ends: 6002 [2020-01-16 17:59:42,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-01-16 17:59:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3131. [2020-01-16 17:59:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:59:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15585 transitions. [2020-01-16 17:59:42,612 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15585 transitions. Word has length 31 [2020-01-16 17:59:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:42,613 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15585 transitions. [2020-01-16 17:59:42,613 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15585 transitions. [2020-01-16 17:59:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:42,618 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:42,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:42,618 INFO L426 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:42,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1137043762, now seen corresponding path program 538 times [2020-01-16 17:59:42,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:42,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814570847] [2020-01-16 17:59:42,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:43,158 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:59:43,287 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:43,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:43,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814570847] [2020-01-16 17:59:43,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:43,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:43,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903042280] [2020-01-16 17:59:43,296 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:43,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:43,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:43,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:43,296 INFO L87 Difference]: Start difference. First operand 3131 states and 15585 transitions. Second operand 12 states. [2020-01-16 17:59:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:43,484 INFO L93 Difference]: Finished difference Result 6024 states and 26811 transitions. [2020-01-16 17:59:43,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:43,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:43,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:43,500 INFO L225 Difference]: With dead ends: 6024 [2020-01-16 17:59:43,500 INFO L226 Difference]: Without dead ends: 5993 [2020-01-16 17:59:43,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-01-16 17:59:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3122. [2020-01-16 17:59:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:59:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15562 transitions. [2020-01-16 17:59:43,723 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15562 transitions. Word has length 31 [2020-01-16 17:59:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:43,723 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15562 transitions. [2020-01-16 17:59:43,723 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15562 transitions. [2020-01-16 17:59:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:43,728 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:43,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:43,728 INFO L426 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:43,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:43,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1841795142, now seen corresponding path program 539 times [2020-01-16 17:59:43,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:43,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462300774] [2020-01-16 17:59:43,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:44,248 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-01-16 17:59:44,380 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:44,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462300774] [2020-01-16 17:59:44,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:44,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:44,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878465069] [2020-01-16 17:59:44,390 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:44,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:44,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:44,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:44,390 INFO L87 Difference]: Start difference. First operand 3122 states and 15562 transitions. Second operand 12 states. [2020-01-16 17:59:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:44,642 INFO L93 Difference]: Finished difference Result 6012 states and 26787 transitions. [2020-01-16 17:59:44,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:44,643 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:44,656 INFO L225 Difference]: With dead ends: 6012 [2020-01-16 17:59:44,656 INFO L226 Difference]: Without dead ends: 5996 [2020-01-16 17:59:44,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-01-16 17:59:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3128. [2020-01-16 17:59:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:59:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15573 transitions. [2020-01-16 17:59:44,877 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15573 transitions. Word has length 31 [2020-01-16 17:59:44,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:44,877 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15573 transitions. [2020-01-16 17:59:44,877 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:44,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15573 transitions. [2020-01-16 17:59:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:44,882 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:44,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:44,882 INFO L426 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1349199380, now seen corresponding path program 540 times [2020-01-16 17:59:44,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:44,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863238070] [2020-01-16 17:59:44,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:45,407 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:59:45,536 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:45,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863238070] [2020-01-16 17:59:45,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:45,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:45,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905184065] [2020-01-16 17:59:45,545 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:45,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:45,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:45,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:45,546 INFO L87 Difference]: Start difference. First operand 3128 states and 15573 transitions. Second operand 12 states. [2020-01-16 17:59:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:45,739 INFO L93 Difference]: Finished difference Result 6018 states and 26793 transitions. [2020-01-16 17:59:45,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:45,740 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:45,754 INFO L225 Difference]: With dead ends: 6018 [2020-01-16 17:59:45,754 INFO L226 Difference]: Without dead ends: 5984 [2020-01-16 17:59:45,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-01-16 17:59:45,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3116. [2020-01-16 17:59:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-01-16 17:59:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15545 transitions. [2020-01-16 17:59:45,979 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15545 transitions. Word has length 31 [2020-01-16 17:59:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:45,979 INFO L478 AbstractCegarLoop]: Abstraction has 3116 states and 15545 transitions. [2020-01-16 17:59:45,979 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15545 transitions. [2020-01-16 17:59:45,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:45,984 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:45,984 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:45,984 INFO L426 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:45,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:45,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1376926228, now seen corresponding path program 541 times [2020-01-16 17:59:45,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:45,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018105718] [2020-01-16 17:59:45,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:46,515 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:46,645 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:46,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018105718] [2020-01-16 17:59:46,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:46,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:46,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067179338] [2020-01-16 17:59:46,655 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:46,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:46,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:46,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:46,655 INFO L87 Difference]: Start difference. First operand 3116 states and 15545 transitions. Second operand 12 states. [2020-01-16 17:59:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:46,889 INFO L93 Difference]: Finished difference Result 6023 states and 26825 transitions. [2020-01-16 17:59:46,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:46,889 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:46,904 INFO L225 Difference]: With dead ends: 6023 [2020-01-16 17:59:46,904 INFO L226 Difference]: Without dead ends: 6004 [2020-01-16 17:59:46,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:47,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2020-01-16 17:59:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 3131. [2020-01-16 17:59:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 17:59:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15588 transitions. [2020-01-16 17:59:47,125 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15588 transitions. Word has length 31 [2020-01-16 17:59:47,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:47,125 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15588 transitions. [2020-01-16 17:59:47,125 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:47,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15588 transitions. [2020-01-16 17:59:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:47,130 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:47,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:47,130 INFO L426 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:47,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:47,130 INFO L82 PathProgramCache]: Analyzing trace with hash -39359014, now seen corresponding path program 542 times [2020-01-16 17:59:47,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:47,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541737691] [2020-01-16 17:59:47,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:47,675 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:47,804 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:47,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-01-16 17:59:47,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541737691] [2020-01-16 17:59:47,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:47,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:47,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415460517] [2020-01-16 17:59:47,814 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:47,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:47,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:47,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:47,814 INFO L87 Difference]: Start difference. First operand 3131 states and 15588 transitions. Second operand 12 states. [2020-01-16 17:59:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:48,065 INFO L93 Difference]: Finished difference Result 6022 states and 26816 transitions. [2020-01-16 17:59:48,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:48,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:48,080 INFO L225 Difference]: With dead ends: 6022 [2020-01-16 17:59:48,081 INFO L226 Difference]: Without dead ends: 5997 [2020-01-16 17:59:48,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-01-16 17:59:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3124. [2020-01-16 17:59:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:59:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15568 transitions. [2020-01-16 17:59:48,308 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15568 transitions. Word has length 31 [2020-01-16 17:59:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:48,309 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15568 transitions. [2020-01-16 17:59:48,309 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15568 transitions. [2020-01-16 17:59:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:48,314 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:48,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:48,314 INFO L426 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:48,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393082, now seen corresponding path program 543 times [2020-01-16 17:59:48,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:48,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116886278] [2020-01-16 17:59:48,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:48,861 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:48,990 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:49,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116886278] [2020-01-16 17:59:49,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:49,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:49,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615196582] [2020-01-16 17:59:49,000 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:49,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:49,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:49,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:49,001 INFO L87 Difference]: Start difference. First operand 3124 states and 15568 transitions. Second operand 12 states. [2020-01-16 17:59:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:49,223 INFO L93 Difference]: Finished difference Result 6029 states and 26830 transitions. [2020-01-16 17:59:49,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:49,224 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:49,238 INFO L225 Difference]: With dead ends: 6029 [2020-01-16 17:59:49,239 INFO L226 Difference]: Without dead ends: 6010 [2020-01-16 17:59:49,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-01-16 17:59:49,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3133. [2020-01-16 17:59:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 17:59:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15585 transitions. [2020-01-16 17:59:49,464 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15585 transitions. Word has length 31 [2020-01-16 17:59:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:49,464 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15585 transitions. [2020-01-16 17:59:49,464 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15585 transitions. [2020-01-16 17:59:49,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:49,469 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:49,470 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:49,470 INFO L426 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:49,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:49,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1943283046, now seen corresponding path program 544 times [2020-01-16 17:59:49,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:49,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483659541] [2020-01-16 17:59:49,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:49,840 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 26 [2020-01-16 17:59:50,068 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 17:59:50,198 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 17:59:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:50,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483659541] [2020-01-16 17:59:50,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:50,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:50,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495244610] [2020-01-16 17:59:50,208 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:50,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:50,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:50,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:50,208 INFO L87 Difference]: Start difference. First operand 3133 states and 15585 transitions. Second operand 12 states. [2020-01-16 17:59:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:50,506 INFO L93 Difference]: Finished difference Result 6032 states and 26827 transitions. [2020-01-16 17:59:50,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:50,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:50,521 INFO L225 Difference]: With dead ends: 6032 [2020-01-16 17:59:50,521 INFO L226 Difference]: Without dead ends: 6001 [2020-01-16 17:59:50,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-01-16 17:59:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3124. [2020-01-16 17:59:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 17:59:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15560 transitions. [2020-01-16 17:59:50,743 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15560 transitions. Word has length 31 [2020-01-16 17:59:50,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:50,744 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15560 transitions. [2020-01-16 17:59:50,744 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15560 transitions. [2020-01-16 17:59:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:50,749 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:50,749 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:50,749 INFO L426 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:50,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:50,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2134052102, now seen corresponding path program 545 times [2020-01-16 17:59:50,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:50,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640627935] [2020-01-16 17:59:50,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:51,281 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:51,411 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:51,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640627935] [2020-01-16 17:59:51,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:51,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:51,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217073614] [2020-01-16 17:59:51,420 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:51,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:51,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:51,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:51,420 INFO L87 Difference]: Start difference. First operand 3124 states and 15560 transitions. Second operand 12 states. [2020-01-16 17:59:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:51,669 INFO L93 Difference]: Finished difference Result 6026 states and 26815 transitions. [2020-01-16 17:59:51,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:51,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:51,684 INFO L225 Difference]: With dead ends: 6026 [2020-01-16 17:59:51,684 INFO L226 Difference]: Without dead ends: 6008 [2020-01-16 17:59:51,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:51,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-01-16 17:59:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3132. [2020-01-16 17:59:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 17:59:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15575 transitions. [2020-01-16 17:59:51,908 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15575 transitions. Word has length 31 [2020-01-16 17:59:51,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:51,909 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15575 transitions. [2020-01-16 17:59:51,909 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15575 transitions. [2020-01-16 17:59:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:51,914 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:51,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:51,914 INFO L426 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:51,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:51,914 INFO L82 PathProgramCache]: Analyzing trace with hash 866594924, now seen corresponding path program 546 times [2020-01-16 17:59:51,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:51,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252503036] [2020-01-16 17:59:51,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:52,460 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:59:52,588 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:52,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-01-16 17:59:52,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252503036] [2020-01-16 17:59:52,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:52,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:52,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515693097] [2020-01-16 17:59:52,597 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:52,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:52,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:52,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:52,598 INFO L87 Difference]: Start difference. First operand 3132 states and 15575 transitions. Second operand 12 states. [2020-01-16 17:59:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:52,806 INFO L93 Difference]: Finished difference Result 6030 states and 26815 transitions. [2020-01-16 17:59:52,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:52,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:52,821 INFO L225 Difference]: With dead ends: 6030 [2020-01-16 17:59:52,822 INFO L226 Difference]: Without dead ends: 5992 [2020-01-16 17:59:52,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-01-16 17:59:53,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3116. [2020-01-16 17:59:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-01-16 17:59:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15539 transitions. [2020-01-16 17:59:53,047 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15539 transitions. Word has length 31 [2020-01-16 17:59:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:53,047 INFO L478 AbstractCegarLoop]: Abstraction has 3116 states and 15539 transitions. [2020-01-16 17:59:53,047 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15539 transitions. [2020-01-16 17:59:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:53,052 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:53,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:53,053 INFO L426 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:53,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:53,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1542862, now seen corresponding path program 547 times [2020-01-16 17:59:53,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:53,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825086135] [2020-01-16 17:59:53,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:53,586 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:59:53,716 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:53,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825086135] [2020-01-16 17:59:53,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:53,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:53,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938604299] [2020-01-16 17:59:53,726 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:53,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:53,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:53,727 INFO L87 Difference]: Start difference. First operand 3116 states and 15539 transitions. Second operand 12 states. [2020-01-16 17:59:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:53,971 INFO L93 Difference]: Finished difference Result 6005 states and 26772 transitions. [2020-01-16 17:59:53,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:53,972 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:53,987 INFO L225 Difference]: With dead ends: 6005 [2020-01-16 17:59:53,987 INFO L226 Difference]: Without dead ends: 5989 [2020-01-16 17:59:53,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-01-16 17:59:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3127. [2020-01-16 17:59:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 17:59:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15570 transitions. [2020-01-16 17:59:54,212 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15570 transitions. Word has length 31 [2020-01-16 17:59:54,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:54,212 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15570 transitions. [2020-01-16 17:59:54,212 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15570 transitions. [2020-01-16 17:59:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:54,217 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:54,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:54,217 INFO L426 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:54,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:54,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1761595802, now seen corresponding path program 548 times [2020-01-16 17:59:54,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:54,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611720209] [2020-01-16 17:59:54,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:54,871 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:54,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611720209] [2020-01-16 17:59:54,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:54,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:54,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690285777] [2020-01-16 17:59:54,880 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:54,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:54,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:54,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:54,881 INFO L87 Difference]: Start difference. First operand 3127 states and 15570 transitions. Second operand 12 states. [2020-01-16 17:59:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:55,116 INFO L93 Difference]: Finished difference Result 6007 states and 26771 transitions. [2020-01-16 17:59:55,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:55,116 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:55,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:55,130 INFO L225 Difference]: With dead ends: 6007 [2020-01-16 17:59:55,131 INFO L226 Difference]: Without dead ends: 5984 [2020-01-16 17:59:55,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-01-16 17:59:55,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3122. [2020-01-16 17:59:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:59:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15556 transitions. [2020-01-16 17:59:55,352 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15556 transitions. Word has length 31 [2020-01-16 17:59:55,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:55,352 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15556 transitions. [2020-01-16 17:59:55,352 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15556 transitions. [2020-01-16 17:59:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:55,357 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:55,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:55,357 INFO L426 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:55,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:55,357 INFO L82 PathProgramCache]: Analyzing trace with hash -634923992, now seen corresponding path program 549 times [2020-01-16 17:59:55,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:55,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277634480] [2020-01-16 17:59:55,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:55,877 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 17:59:56,007 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:56,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277634480] [2020-01-16 17:59:56,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:56,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:56,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749878892] [2020-01-16 17:59:56,017 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:56,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:56,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:56,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:56,018 INFO L87 Difference]: Start difference. First operand 3122 states and 15556 transitions. Second operand 12 states. [2020-01-16 17:59:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:56,265 INFO L93 Difference]: Finished difference Result 6010 states and 26776 transitions. [2020-01-16 17:59:56,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:56,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:56,280 INFO L225 Difference]: With dead ends: 6010 [2020-01-16 17:59:56,281 INFO L226 Difference]: Without dead ends: 5994 [2020-01-16 17:59:56,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-01-16 17:59:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3128. [2020-01-16 17:59:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 17:59:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15567 transitions. [2020-01-16 17:59:56,502 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15567 transitions. Word has length 31 [2020-01-16 17:59:56,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:56,502 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15567 transitions. [2020-01-16 17:59:56,502 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15567 transitions. [2020-01-16 17:59:56,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:56,507 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:56,507 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:56,507 INFO L426 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash -142328230, now seen corresponding path program 550 times [2020-01-16 17:59:56,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:56,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061171124] [2020-01-16 17:59:56,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:57,037 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:59:57,169 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:57,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061171124] [2020-01-16 17:59:57,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:57,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:57,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954689143] [2020-01-16 17:59:57,178 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:57,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:57,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:57,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:57,179 INFO L87 Difference]: Start difference. First operand 3128 states and 15567 transitions. Second operand 12 states. [2020-01-16 17:59:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:57,366 INFO L93 Difference]: Finished difference Result 6016 states and 26782 transitions. [2020-01-16 17:59:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:57,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:57,381 INFO L225 Difference]: With dead ends: 6016 [2020-01-16 17:59:57,382 INFO L226 Difference]: Without dead ends: 5988 [2020-01-16 17:59:57,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:57,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-01-16 17:59:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3122. [2020-01-16 17:59:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 17:59:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15550 transitions. [2020-01-16 17:59:57,608 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15550 transitions. Word has length 31 [2020-01-16 17:59:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:57,609 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15550 transitions. [2020-01-16 17:59:57,609 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15550 transitions. [2020-01-16 17:59:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:57,614 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:57,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, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:57,614 INFO L426 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:57,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:57,614 INFO L82 PathProgramCache]: Analyzing trace with hash -147804760, now seen corresponding path program 551 times [2020-01-16 17:59:57,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:57,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613858132] [2020-01-16 17:59:57,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:58,152 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 17:59:58,284 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:58,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613858132] [2020-01-16 17:59:58,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:58,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:58,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672890807] [2020-01-16 17:59:58,293 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:58,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:58,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:58,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:58,294 INFO L87 Difference]: Start difference. First operand 3122 states and 15550 transitions. Second operand 12 states. [2020-01-16 17:59:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:58,570 INFO L93 Difference]: Finished difference Result 6016 states and 26784 transitions. [2020-01-16 17:59:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:58,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:58,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:58,586 INFO L225 Difference]: With dead ends: 6016 [2020-01-16 17:59:58,586 INFO L226 Difference]: Without dead ends: 5998 [2020-01-16 17:59:58,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-01-16 17:59:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3130. [2020-01-16 17:59:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 17:59:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15565 transitions. [2020-01-16 17:59:58,849 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15565 transitions. Word has length 31 [2020-01-16 17:59:58,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:58,849 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15565 transitions. [2020-01-16 17:59:58,849 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15565 transitions. [2020-01-16 17:59:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:58,854 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:58,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:58,854 INFO L426 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:58,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:58,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1415261938, now seen corresponding path program 552 times [2020-01-16 17:59:58,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:58,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718440039] [2020-01-16 17:59:58,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 17:59:59,384 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 17:59:59,514 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 17:59:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 17:59:59,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718440039] [2020-01-16 17:59:59,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 17:59:59,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 17:59:59,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479398623] [2020-01-16 17:59:59,524 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 17:59:59,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 17:59:59,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 17:59:59,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 17:59:59,525 INFO L87 Difference]: Start difference. First operand 3130 states and 15565 transitions. Second operand 12 states. [2020-01-16 17:59:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 17:59:59,730 INFO L93 Difference]: Finished difference Result 6020 states and 26784 transitions. [2020-01-16 17:59:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 17:59:59,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 17:59:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 17:59:59,744 INFO L225 Difference]: With dead ends: 6020 [2020-01-16 17:59:59,744 INFO L226 Difference]: Without dead ends: 5978 [2020-01-16 17:59:59,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 17:59:59,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-01-16 17:59:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3110. [2020-01-16 17:59:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-01-16 17:59:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15522 transitions. [2020-01-16 17:59:59,966 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15522 transitions. Word has length 31 [2020-01-16 17:59:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 17:59:59,966 INFO L478 AbstractCegarLoop]: Abstraction has 3110 states and 15522 transitions. [2020-01-16 17:59:59,966 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 17:59:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15522 transitions. [2020-01-16 17:59:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 17:59:59,971 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 17:59:59,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 17:59:59,971 INFO L426 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 17:59:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 17:59:59,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1910641922, now seen corresponding path program 553 times [2020-01-16 17:59:59,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 17:59:59,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172818642] [2020-01-16 17:59:59,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 17:59:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:00,514 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 18:00:00,643 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 18:00:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:00,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172818642] [2020-01-16 18:00:00,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:00,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:00,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82546546] [2020-01-16 18:00:00,653 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:00,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:00,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:00,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:00,653 INFO L87 Difference]: Start difference. First operand 3110 states and 15522 transitions. Second operand 12 states. [2020-01-16 18:00:00,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:00,924 INFO L93 Difference]: Finished difference Result 6017 states and 26824 transitions. [2020-01-16 18:00:00,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:00,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:00,939 INFO L225 Difference]: With dead ends: 6017 [2020-01-16 18:00:00,939 INFO L226 Difference]: Without dead ends: 5998 [2020-01-16 18:00:00,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-01-16 18:00:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3129. [2020-01-16 18:00:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 18:00:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15589 transitions. [2020-01-16 18:00:01,159 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15589 transitions. Word has length 31 [2020-01-16 18:00:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:01,159 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15589 transitions. [2020-01-16 18:00:01,159 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15589 transitions. [2020-01-16 18:00:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:01,165 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:01,165 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:01,165 INFO L426 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:01,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash 271896744, now seen corresponding path program 554 times [2020-01-16 18:00:01,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:01,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788784755] [2020-01-16 18:00:01,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:01,702 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:01,828 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 18:00:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:01,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788784755] [2020-01-16 18:00:01,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:01,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:01,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650742954] [2020-01-16 18:00:01,838 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:01,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:01,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:01,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:01,838 INFO L87 Difference]: Start difference. First operand 3129 states and 15589 transitions. Second operand 12 states. [2020-01-16 18:00:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:02,099 INFO L93 Difference]: Finished difference Result 6015 states and 26814 transitions. [2020-01-16 18:00:02,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:02,099 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:02,114 INFO L225 Difference]: With dead ends: 6015 [2020-01-16 18:00:02,115 INFO L226 Difference]: Without dead ends: 5992 [2020-01-16 18:00:02,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-01-16 18:00:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3123. [2020-01-16 18:00:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 18:00:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15572 transitions. [2020-01-16 18:00:02,337 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15572 transitions. Word has length 31 [2020-01-16 18:00:02,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:02,337 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15572 transitions. [2020-01-16 18:00:02,337 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15572 transitions. [2020-01-16 18:00:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:02,342 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:02,342 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:02,342 INFO L426 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:02,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1960014138, now seen corresponding path program 555 times [2020-01-16 18:00:02,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:02,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293316662] [2020-01-16 18:00:02,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:02,914 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 18:00:03,045 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 18:00:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:03,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293316662] [2020-01-16 18:00:03,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:03,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:03,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695894483] [2020-01-16 18:00:03,055 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:03,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:03,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:03,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:03,055 INFO L87 Difference]: Start difference. First operand 3123 states and 15572 transitions. Second operand 12 states. [2020-01-16 18:00:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:03,341 INFO L93 Difference]: Finished difference Result 6019 states and 26823 transitions. [2020-01-16 18:00:03,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:03,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:03,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:03,355 INFO L225 Difference]: With dead ends: 6019 [2020-01-16 18:00:03,356 INFO L226 Difference]: Without dead ends: 6000 [2020-01-16 18:00:03,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:03,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-01-16 18:00:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3130. [2020-01-16 18:00:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 18:00:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15585 transitions. [2020-01-16 18:00:03,589 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15585 transitions. Word has length 31 [2020-01-16 18:00:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:03,590 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15585 transitions. [2020-01-16 18:00:03,590 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15585 transitions. [2020-01-16 18:00:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:03,595 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:03,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, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:03,595 INFO L426 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash -997385944, now seen corresponding path program 556 times [2020-01-16 18:00:03,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:03,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384105554] [2020-01-16 18:00:03,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:04,138 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:04,260 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:04,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384105554] [2020-01-16 18:00:04,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:04,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:04,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315615842] [2020-01-16 18:00:04,270 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:04,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:04,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:04,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:04,270 INFO L87 Difference]: Start difference. First operand 3130 states and 15585 transitions. Second operand 12 states. [2020-01-16 18:00:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:04,516 INFO L93 Difference]: Finished difference Result 6018 states and 26814 transitions. [2020-01-16 18:00:04,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:04,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:04,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:04,531 INFO L225 Difference]: With dead ends: 6018 [2020-01-16 18:00:04,532 INFO L226 Difference]: Without dead ends: 5993 [2020-01-16 18:00:04,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:04,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-01-16 18:00:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3123. [2020-01-16 18:00:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 18:00:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15566 transitions. [2020-01-16 18:00:04,753 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15566 transitions. Word has length 31 [2020-01-16 18:00:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:04,753 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15566 transitions. [2020-01-16 18:00:04,753 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15566 transitions. [2020-01-16 18:00:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:04,758 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:04,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:04,758 INFO L426 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:04,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:04,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1213192582, now seen corresponding path program 557 times [2020-01-16 18:00:04,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:04,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218264554] [2020-01-16 18:00:04,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:05,309 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 18:00:05,441 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:05,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218264554] [2020-01-16 18:00:05,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:05,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:05,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039862356] [2020-01-16 18:00:05,451 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:05,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:05,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:05,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:05,451 INFO L87 Difference]: Start difference. First operand 3123 states and 15566 transitions. Second operand 12 states. [2020-01-16 18:00:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:05,706 INFO L93 Difference]: Finished difference Result 6014 states and 26806 transitions. [2020-01-16 18:00:05,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:05,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:05,722 INFO L225 Difference]: With dead ends: 6014 [2020-01-16 18:00:05,722 INFO L226 Difference]: Without dead ends: 5997 [2020-01-16 18:00:05,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-01-16 18:00:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3129. [2020-01-16 18:00:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 18:00:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15577 transitions. [2020-01-16 18:00:05,947 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15577 transitions. Word has length 31 [2020-01-16 18:00:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:05,947 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15577 transitions. [2020-01-16 18:00:05,947 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15577 transitions. [2020-01-16 18:00:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:05,953 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:05,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:05,953 INFO L426 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:05,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:05,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2058164034, now seen corresponding path program 558 times [2020-01-16 18:00:05,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:05,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212340838] [2020-01-16 18:00:05,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:06,488 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:06,619 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:06,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212340838] [2020-01-16 18:00:06,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:06,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:06,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479215788] [2020-01-16 18:00:06,629 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:06,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:06,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:06,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:06,629 INFO L87 Difference]: Start difference. First operand 3129 states and 15577 transitions. Second operand 12 states. [2020-01-16 18:00:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:06,873 INFO L93 Difference]: Finished difference Result 6015 states and 26802 transitions. [2020-01-16 18:00:06,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:06,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:06,888 INFO L225 Difference]: With dead ends: 6015 [2020-01-16 18:00:06,888 INFO L226 Difference]: Without dead ends: 5985 [2020-01-16 18:00:06,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:07,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2020-01-16 18:00:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 3117. [2020-01-16 18:00:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-01-16 18:00:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15549 transitions. [2020-01-16 18:00:07,109 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15549 transitions. Word has length 31 [2020-01-16 18:00:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:07,109 INFO L478 AbstractCegarLoop]: Abstraction has 3117 states and 15549 transitions. [2020-01-16 18:00:07,109 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15549 transitions. [2020-01-16 18:00:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:07,114 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:07,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, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:07,115 INFO L426 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:07,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:07,115 INFO L82 PathProgramCache]: Analyzing trace with hash -166277916, now seen corresponding path program 559 times [2020-01-16 18:00:07,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:07,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721653458] [2020-01-16 18:00:07,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:07,692 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 18:00:07,824 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 18:00:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:07,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721653458] [2020-01-16 18:00:07,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:07,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:07,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515800912] [2020-01-16 18:00:07,833 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:07,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:07,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:07,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:07,833 INFO L87 Difference]: Start difference. First operand 3117 states and 15549 transitions. Second operand 12 states. [2020-01-16 18:00:08,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:08,122 INFO L93 Difference]: Finished difference Result 6025 states and 26835 transitions. [2020-01-16 18:00:08,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:08,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:08,139 INFO L225 Difference]: With dead ends: 6025 [2020-01-16 18:00:08,139 INFO L226 Difference]: Without dead ends: 6006 [2020-01-16 18:00:08,140 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-01-16 18:00:08,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-01-16 18:00:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 18:00:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15586 transitions. [2020-01-16 18:00:08,366 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15586 transitions. Word has length 31 [2020-01-16 18:00:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:08,366 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15586 transitions. [2020-01-16 18:00:08,366 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15586 transitions. [2020-01-16 18:00:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:08,372 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:08,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:08,372 INFO L426 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:08,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:08,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2016260750, now seen corresponding path program 560 times [2020-01-16 18:00:08,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:08,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964450085] [2020-01-16 18:00:08,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:08,908 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:09,034 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 18:00:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:09,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964450085] [2020-01-16 18:00:09,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:09,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:09,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550472924] [2020-01-16 18:00:09,043 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:09,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:09,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:09,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:09,043 INFO L87 Difference]: Start difference. First operand 3130 states and 15586 transitions. Second operand 12 states. [2020-01-16 18:00:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:09,297 INFO L93 Difference]: Finished difference Result 6023 states and 26825 transitions. [2020-01-16 18:00:09,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:09,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:09,312 INFO L225 Difference]: With dead ends: 6023 [2020-01-16 18:00:09,312 INFO L226 Difference]: Without dead ends: 6000 [2020-01-16 18:00:09,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-01-16 18:00:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3124. [2020-01-16 18:00:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 18:00:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-01-16 18:00:09,537 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-01-16 18:00:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:09,537 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-01-16 18:00:09,538 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-01-16 18:00:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:09,543 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:09,543 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:09,543 INFO L426 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:09,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:09,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1227056006, now seen corresponding path program 561 times [2020-01-16 18:00:09,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:09,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696429434] [2020-01-16 18:00:09,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:10,083 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 18:00:10,213 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 18:00:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:10,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696429434] [2020-01-16 18:00:10,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:10,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:10,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49441327] [2020-01-16 18:00:10,223 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:10,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:10,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:10,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:10,223 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-01-16 18:00:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:10,462 INFO L93 Difference]: Finished difference Result 6033 states and 26846 transitions. [2020-01-16 18:00:10,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:10,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:10,477 INFO L225 Difference]: With dead ends: 6033 [2020-01-16 18:00:10,477 INFO L226 Difference]: Without dead ends: 6014 [2020-01-16 18:00:10,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-01-16 18:00:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3133. [2020-01-16 18:00:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 18:00:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15586 transitions. [2020-01-16 18:00:10,702 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15586 transitions. Word has length 31 [2020-01-16 18:00:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:10,702 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15586 transitions. [2020-01-16 18:00:10,702 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15586 transitions. [2020-01-16 18:00:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:10,707 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:10,708 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:10,708 INFO L426 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:10,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1156945970, now seen corresponding path program 562 times [2020-01-16 18:00:10,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:10,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301495926] [2020-01-16 18:00:10,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:11,249 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 18:00:11,377 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 18:00:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:11,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301495926] [2020-01-16 18:00:11,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:11,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:11,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027904369] [2020-01-16 18:00:11,387 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:11,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:11,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:11,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:11,387 INFO L87 Difference]: Start difference. First operand 3133 states and 15586 transitions. Second operand 12 states. [2020-01-16 18:00:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:11,624 INFO L93 Difference]: Finished difference Result 6036 states and 26843 transitions. [2020-01-16 18:00:11,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:11,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:11,640 INFO L225 Difference]: With dead ends: 6036 [2020-01-16 18:00:11,640 INFO L226 Difference]: Without dead ends: 6005 [2020-01-16 18:00:11,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-01-16 18:00:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3124. [2020-01-16 18:00:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 18:00:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15562 transitions. [2020-01-16 18:00:11,862 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15562 transitions. Word has length 31 [2020-01-16 18:00:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:11,862 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15562 transitions. [2020-01-16 18:00:11,862 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15562 transitions. [2020-01-16 18:00:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:11,867 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:11,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:11,867 INFO L426 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:11,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash -105295430, now seen corresponding path program 563 times [2020-01-16 18:00:11,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:11,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794645928] [2020-01-16 18:00:11,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:12,399 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:12,528 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 18:00:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:12,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794645928] [2020-01-16 18:00:12,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:12,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:12,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612702454] [2020-01-16 18:00:12,537 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:12,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:12,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:12,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:12,538 INFO L87 Difference]: Start difference. First operand 3124 states and 15562 transitions. Second operand 12 states. [2020-01-16 18:00:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:12,798 INFO L93 Difference]: Finished difference Result 6027 states and 26825 transitions. [2020-01-16 18:00:12,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:12,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:12,814 INFO L225 Difference]: With dead ends: 6027 [2020-01-16 18:00:12,814 INFO L226 Difference]: Without dead ends: 6010 [2020-01-16 18:00:12,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:12,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-01-16 18:00:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3131. [2020-01-16 18:00:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 18:00:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15575 transitions. [2020-01-16 18:00:13,037 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15575 transitions. Word has length 31 [2020-01-16 18:00:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:13,038 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15575 transitions. [2020-01-16 18:00:13,038 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15575 transitions. [2020-01-16 18:00:13,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:13,043 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:13,043 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:13,043 INFO L426 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:13,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:13,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2077243236, now seen corresponding path program 564 times [2020-01-16 18:00:13,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:13,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806149114] [2020-01-16 18:00:13,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:13,588 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-01-16 18:00:13,723 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-01-16 18:00:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:13,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806149114] [2020-01-16 18:00:13,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:13,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:13,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147275094] [2020-01-16 18:00:13,733 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:13,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:13,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:13,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:13,733 INFO L87 Difference]: Start difference. First operand 3131 states and 15575 transitions. Second operand 12 states. [2020-01-16 18:00:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:13,957 INFO L93 Difference]: Finished difference Result 6032 states and 26828 transitions. [2020-01-16 18:00:13,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:13,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:13,971 INFO L225 Difference]: With dead ends: 6032 [2020-01-16 18:00:13,971 INFO L226 Difference]: Without dead ends: 5996 [2020-01-16 18:00:13,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:14,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-01-16 18:00:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3117. [2020-01-16 18:00:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-01-16 18:00:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15542 transitions. [2020-01-16 18:00:14,193 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15542 transitions. Word has length 31 [2020-01-16 18:00:14,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:14,193 INFO L478 AbstractCegarLoop]: Abstraction has 3117 states and 15542 transitions. [2020-01-16 18:00:14,193 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15542 transitions. [2020-01-16 18:00:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:14,198 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:14,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:14,198 INFO L426 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:14,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:14,198 INFO L82 PathProgramCache]: Analyzing trace with hash -859335580, now seen corresponding path program 565 times [2020-01-16 18:00:14,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:14,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956705834] [2020-01-16 18:00:14,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:14,746 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 18:00:14,875 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 18:00:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:14,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956705834] [2020-01-16 18:00:14,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:14,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:14,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167048403] [2020-01-16 18:00:14,884 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:14,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:14,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:14,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:14,885 INFO L87 Difference]: Start difference. First operand 3117 states and 15542 transitions. Second operand 12 states. [2020-01-16 18:00:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:15,236 INFO L93 Difference]: Finished difference Result 6031 states and 26845 transitions. [2020-01-16 18:00:15,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:15,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:15,252 INFO L225 Difference]: With dead ends: 6031 [2020-01-16 18:00:15,252 INFO L226 Difference]: Without dead ends: 6012 [2020-01-16 18:00:15,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:15,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-01-16 18:00:15,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3132. [2020-01-16 18:00:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 18:00:15,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15585 transitions. [2020-01-16 18:00:15,472 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15585 transitions. Word has length 31 [2020-01-16 18:00:15,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:15,472 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15585 transitions. [2020-01-16 18:00:15,472 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:15,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15585 transitions. [2020-01-16 18:00:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:15,477 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:15,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:15,477 INFO L426 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:15,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:15,477 INFO L82 PathProgramCache]: Analyzing trace with hash 478231634, now seen corresponding path program 566 times [2020-01-16 18:00:15,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:15,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69333594] [2020-01-16 18:00:15,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:16,038 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:16,170 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00: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-01-16 18:00:16,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69333594] [2020-01-16 18:00:16,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:16,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:16,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012063820] [2020-01-16 18:00:16,180 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:16,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:16,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:16,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:16,180 INFO L87 Difference]: Start difference. First operand 3132 states and 15585 transitions. Second operand 12 states. [2020-01-16 18:00:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:16,427 INFO L93 Difference]: Finished difference Result 6030 states and 26836 transitions. [2020-01-16 18:00:16,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:16,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:16,442 INFO L225 Difference]: With dead ends: 6030 [2020-01-16 18:00:16,442 INFO L226 Difference]: Without dead ends: 6005 [2020-01-16 18:00:16,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-01-16 18:00:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3125. [2020-01-16 18:00:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 18:00:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15565 transitions. [2020-01-16 18:00:16,710 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15565 transitions. Word has length 31 [2020-01-16 18:00:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:16,710 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15565 transitions. [2020-01-16 18:00:16,711 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15565 transitions. [2020-01-16 18:00:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:16,716 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:16,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:16,716 INFO L426 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:16,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1495802434, now seen corresponding path program 567 times [2020-01-16 18:00:16,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:16,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428791586] [2020-01-16 18:00:16,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:17,257 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-01-16 18:00:17,388 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 18:00:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:17,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428791586] [2020-01-16 18:00:17,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:17,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:17,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732324209] [2020-01-16 18:00:17,398 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:17,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:17,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:17,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:17,398 INFO L87 Difference]: Start difference. First operand 3125 states and 15565 transitions. Second operand 12 states. [2020-01-16 18:00:17,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:17,754 INFO L93 Difference]: Finished difference Result 6037 states and 26850 transitions. [2020-01-16 18:00:17,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:17,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:17,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:17,770 INFO L225 Difference]: With dead ends: 6037 [2020-01-16 18:00:17,770 INFO L226 Difference]: Without dead ends: 6018 [2020-01-16 18:00:17,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-01-16 18:00:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3134. [2020-01-16 18:00:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-01-16 18:00:17,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15582 transitions. [2020-01-16 18:00:17,992 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15582 transitions. Word has length 31 [2020-01-16 18:00:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:17,992 INFO L478 AbstractCegarLoop]: Abstraction has 3134 states and 15582 transitions. [2020-01-16 18:00:17,992 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15582 transitions. [2020-01-16 18:00:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:17,997 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:17,997 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:17,997 INFO L426 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:17,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1425692398, now seen corresponding path program 568 times [2020-01-16 18:00:17,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:17,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989537989] [2020-01-16 18:00:17,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:18,555 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-01-16 18:00:18,684 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-01-16 18:00:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:18,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989537989] [2020-01-16 18:00:18,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:18,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:18,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018180223] [2020-01-16 18:00:18,694 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:18,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:18,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:18,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:18,694 INFO L87 Difference]: Start difference. First operand 3134 states and 15582 transitions. Second operand 12 states. [2020-01-16 18:00:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:19,014 INFO L93 Difference]: Finished difference Result 6040 states and 26847 transitions. [2020-01-16 18:00:19,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:19,015 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:19,030 INFO L225 Difference]: With dead ends: 6040 [2020-01-16 18:00:19,030 INFO L226 Difference]: Without dead ends: 6009 [2020-01-16 18:00:19,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2020-01-16 18:00:19,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 3125. [2020-01-16 18:00:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-01-16 18:00:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15557 transitions. [2020-01-16 18:00:19,254 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15557 transitions. Word has length 31 [2020-01-16 18:00:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:19,254 INFO L478 AbstractCegarLoop]: Abstraction has 3125 states and 15557 transitions. [2020-01-16 18:00:19,254 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:19,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15557 transitions. [2020-01-16 18:00:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:19,259 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:19,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:19,260 INFO L426 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1643324546, now seen corresponding path program 569 times [2020-01-16 18:00:19,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:19,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446107188] [2020-01-16 18:00:19,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:19,799 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:19,932 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:19,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446107188] [2020-01-16 18:00:19,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:19,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:19,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122267626] [2020-01-16 18:00:19,942 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:19,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:19,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:19,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:19,942 INFO L87 Difference]: Start difference. First operand 3125 states and 15557 transitions. Second operand 12 states. [2020-01-16 18:00:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:20,302 INFO L93 Difference]: Finished difference Result 6034 states and 26835 transitions. [2020-01-16 18:00:20,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:20,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:20,318 INFO L225 Difference]: With dead ends: 6034 [2020-01-16 18:00:20,318 INFO L226 Difference]: Without dead ends: 6016 [2020-01-16 18:00:20,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-01-16 18:00:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3133. [2020-01-16 18:00:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-01-16 18:00:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15572 transitions. [2020-01-16 18:00:20,542 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15572 transitions. Word has length 31 [2020-01-16 18:00:20,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:20,542 INFO L478 AbstractCegarLoop]: Abstraction has 3133 states and 15572 transitions. [2020-01-16 18:00:20,542 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15572 transitions. [2020-01-16 18:00:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:20,547 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:20,547 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:20,547 INFO L426 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:20,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:20,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1384185572, now seen corresponding path program 570 times [2020-01-16 18:00:20,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:20,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807840274] [2020-01-16 18:00:20,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:21,103 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-01-16 18:00:21,231 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:21,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807840274] [2020-01-16 18:00:21,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:21,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:21,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977524290] [2020-01-16 18:00:21,241 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:21,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:21,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:21,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:21,241 INFO L87 Difference]: Start difference. First operand 3133 states and 15572 transitions. Second operand 12 states. [2020-01-16 18:00:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:21,473 INFO L93 Difference]: Finished difference Result 6038 states and 26835 transitions. [2020-01-16 18:00:21,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:21,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:21,489 INFO L225 Difference]: With dead ends: 6038 [2020-01-16 18:00:21,489 INFO L226 Difference]: Without dead ends: 6000 [2020-01-16 18:00:21,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-01-16 18:00:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3117. [2020-01-16 18:00:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-01-16 18:00:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15535 transitions. [2020-01-16 18:00:21,709 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15535 transitions. Word has length 31 [2020-01-16 18:00:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:21,709 INFO L478 AbstractCegarLoop]: Abstraction has 3117 states and 15535 transitions. [2020-01-16 18:00:21,709 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15535 transitions. [2020-01-16 18:00:21,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:21,714 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:21,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:21,714 INFO L426 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:21,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:21,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1738042574, now seen corresponding path program 571 times [2020-01-16 18:00:21,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:21,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465127214] [2020-01-16 18:00:21,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:22,253 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 18:00:22,385 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:22,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-01-16 18:00:22,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465127214] [2020-01-16 18:00:22,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:22,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:22,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074465073] [2020-01-16 18:00:22,394 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:22,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:22,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:22,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:22,394 INFO L87 Difference]: Start difference. First operand 3117 states and 15535 transitions. Second operand 12 states. [2020-01-16 18:00:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:22,652 INFO L93 Difference]: Finished difference Result 6020 states and 26810 transitions. [2020-01-16 18:00:22,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:22,653 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:22,668 INFO L225 Difference]: With dead ends: 6020 [2020-01-16 18:00:22,668 INFO L226 Difference]: Without dead ends: 6003 [2020-01-16 18:00:22,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-01-16 18:00:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3130. [2020-01-16 18:00:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 18:00:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15572 transitions. [2020-01-16 18:00:22,892 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15572 transitions. Word has length 31 [2020-01-16 18:00:22,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:22,893 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15572 transitions. [2020-01-16 18:00:22,893 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:22,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15572 transitions. [2020-01-16 18:00:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:22,898 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:22,898 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:22,898 INFO L426 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:22,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash 893071122, now seen corresponding path program 572 times [2020-01-16 18:00:22,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:22,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788361976] [2020-01-16 18:00:22,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:23,433 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:23,564 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:23,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788361976] [2020-01-16 18:00:23,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:23,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:23,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146103194] [2020-01-16 18:00:23,574 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:23,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:23,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:23,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:23,575 INFO L87 Difference]: Start difference. First operand 3130 states and 15572 transitions. Second operand 12 states. [2020-01-16 18:00:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:23,789 INFO L93 Difference]: Finished difference Result 6021 states and 26806 transitions. [2020-01-16 18:00:23,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:23,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:23,805 INFO L225 Difference]: With dead ends: 6021 [2020-01-16 18:00:23,805 INFO L226 Difference]: Without dead ends: 5997 [2020-01-16 18:00:23,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-01-16 18:00:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3124. [2020-01-16 18:00:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 18:00:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15555 transitions. [2020-01-16 18:00:24,032 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15555 transitions. Word has length 31 [2020-01-16 18:00:24,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:24,032 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15555 transitions. [2020-01-16 18:00:24,032 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15555 transitions. [2020-01-16 18:00:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:24,037 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:24,038 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:24,038 INFO L426 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:24,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1101575720, now seen corresponding path program 573 times [2020-01-16 18:00:24,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:24,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82790683] [2020-01-16 18:00:24,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:24,576 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 18:00:24,707 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:24,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82790683] [2020-01-16 18:00:24,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:24,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:24,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67882946] [2020-01-16 18:00:24,717 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:24,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:24,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:24,717 INFO L87 Difference]: Start difference. First operand 3124 states and 15555 transitions. Second operand 12 states. [2020-01-16 18:00:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:24,970 INFO L93 Difference]: Finished difference Result 6025 states and 26813 transitions. [2020-01-16 18:00:24,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:24,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:24,986 INFO L225 Difference]: With dead ends: 6025 [2020-01-16 18:00:24,986 INFO L226 Difference]: Without dead ends: 6008 [2020-01-16 18:00:24,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-01-16 18:00:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3131. [2020-01-16 18:00:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-01-16 18:00:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15568 transitions. [2020-01-16 18:00:25,207 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15568 transitions. Word has length 31 [2020-01-16 18:00:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:25,207 INFO L478 AbstractCegarLoop]: Abstraction has 3131 states and 15568 transitions. [2020-01-16 18:00:25,207 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15568 transitions. [2020-01-16 18:00:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:25,212 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:25,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:25,212 INFO L426 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:25,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1010852910, now seen corresponding path program 574 times [2020-01-16 18:00:25,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:25,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525619489] [2020-01-16 18:00:25,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:25,804 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-01-16 18:00:25,935 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:25,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525619489] [2020-01-16 18:00:25,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:25,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:25,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515111666] [2020-01-16 18:00:25,945 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:25,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:25,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:25,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:25,945 INFO L87 Difference]: Start difference. First operand 3131 states and 15568 transitions. Second operand 12 states. [2020-01-16 18:00:26,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:26,130 INFO L93 Difference]: Finished difference Result 6030 states and 26816 transitions. [2020-01-16 18:00:26,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:26,131 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:26,145 INFO L225 Difference]: With dead ends: 6030 [2020-01-16 18:00:26,146 INFO L226 Difference]: Without dead ends: 6001 [2020-01-16 18:00:26,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-01-16 18:00:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3124. [2020-01-16 18:00:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-01-16 18:00:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15548 transitions. [2020-01-16 18:00:26,372 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15548 transitions. Word has length 31 [2020-01-16 18:00:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:26,372 INFO L478 AbstractCegarLoop]: Abstraction has 3124 states and 15548 transitions. [2020-01-16 18:00:26,372 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15548 transitions. [2020-01-16 18:00:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:26,378 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:26,378 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:26,378 INFO L426 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:26,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:26,378 INFO L82 PathProgramCache]: Analyzing trace with hash -167706968, now seen corresponding path program 575 times [2020-01-16 18:00:26,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:26,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220700933] [2020-01-16 18:00:26,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:26,916 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:27,041 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:27,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220700933] [2020-01-16 18:00:27,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:27,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:27,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359823821] [2020-01-16 18:00:27,051 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:27,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:27,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:27,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:27,051 INFO L87 Difference]: Start difference. First operand 3124 states and 15548 transitions. Second operand 12 states. [2020-01-16 18:00:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:27,286 INFO L93 Difference]: Finished difference Result 6028 states and 26813 transitions. [2020-01-16 18:00:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:27,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:27,301 INFO L225 Difference]: With dead ends: 6028 [2020-01-16 18:00:27,301 INFO L226 Difference]: Without dead ends: 6010 [2020-01-16 18:00:27,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-01-16 18:00:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3132. [2020-01-16 18:00:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-01-16 18:00:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15563 transitions. [2020-01-16 18:00:27,520 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15563 transitions. Word has length 31 [2020-01-16 18:00:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:27,520 INFO L478 AbstractCegarLoop]: Abstraction has 3132 states and 15563 transitions. [2020-01-16 18:00:27,521 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15563 transitions. [2020-01-16 18:00:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:27,526 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:27,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:27,526 INFO L426 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:27,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:27,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1435164146, now seen corresponding path program 576 times [2020-01-16 18:00:27,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:27,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484007829] [2020-01-16 18:00:27,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:28,066 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-01-16 18:00:28,196 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:28,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484007829] [2020-01-16 18:00:28,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:28,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:28,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725984990] [2020-01-16 18:00:28,205 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:28,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:28,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:28,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:28,206 INFO L87 Difference]: Start difference. First operand 3132 states and 15563 transitions. Second operand 12 states. [2020-01-16 18:00:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:28,424 INFO L93 Difference]: Finished difference Result 6032 states and 26813 transitions. [2020-01-16 18:00:28,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:28,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:28,440 INFO L225 Difference]: With dead ends: 6032 [2020-01-16 18:00:28,440 INFO L226 Difference]: Without dead ends: 5988 [2020-01-16 18:00:28,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-01-16 18:00:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3110. [2020-01-16 18:00:28,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-01-16 18:00:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15516 transitions. [2020-01-16 18:00:28,666 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15516 transitions. Word has length 31 [2020-01-16 18:00:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:28,666 INFO L478 AbstractCegarLoop]: Abstraction has 3110 states and 15516 transitions. [2020-01-16 18:00:28,667 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15516 transitions. [2020-01-16 18:00:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:28,672 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:28,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:28,672 INFO L426 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:28,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1744708478, now seen corresponding path program 577 times [2020-01-16 18:00:28,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:28,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296997820] [2020-01-16 18:00:28,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:29,222 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:29,350 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 18:00:29,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-01-16 18:00:29,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296997820] [2020-01-16 18:00:29,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:29,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:29,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377605538] [2020-01-16 18:00:29,360 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:29,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:29,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:29,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:29,360 INFO L87 Difference]: Start difference. First operand 3110 states and 15516 transitions. Second operand 12 states. [2020-01-16 18:00:29,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:29,578 INFO L93 Difference]: Finished difference Result 5989 states and 26739 transitions. [2020-01-16 18:00:29,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:29,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:29,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:29,593 INFO L225 Difference]: With dead ends: 5989 [2020-01-16 18:00:29,593 INFO L226 Difference]: Without dead ends: 5973 [2020-01-16 18:00:29,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-01-16 18:00:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3126. [2020-01-16 18:00:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 18:00:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15572 transitions. [2020-01-16 18:00:29,813 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15572 transitions. Word has length 31 [2020-01-16 18:00:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:29,813 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15572 transitions. [2020-01-16 18:00:29,813 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15572 transitions. [2020-01-16 18:00:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:29,818 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:29,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, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:29,818 INFO L426 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:29,819 INFO L82 PathProgramCache]: Analyzing trace with hash 54765574, now seen corresponding path program 578 times [2020-01-16 18:00:29,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:29,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327408426] [2020-01-16 18:00:29,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:30,485 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:30,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-01-16 18:00:30,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327408426] [2020-01-16 18:00:30,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:30,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:30,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883373466] [2020-01-16 18:00:30,495 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:30,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:30,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:30,495 INFO L87 Difference]: Start difference. First operand 3126 states and 15572 transitions. Second operand 12 states. [2020-01-16 18:00:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:30,716 INFO L93 Difference]: Finished difference Result 5990 states and 26736 transitions. [2020-01-16 18:00:30,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:30,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:30,730 INFO L225 Difference]: With dead ends: 5990 [2020-01-16 18:00:30,731 INFO L226 Difference]: Without dead ends: 5968 [2020-01-16 18:00:30,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:30,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-01-16 18:00:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-01-16 18:00:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 18:00:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15558 transitions. [2020-01-16 18:00:30,958 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15558 transitions. Word has length 31 [2020-01-16 18:00:30,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:30,958 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15558 transitions. [2020-01-16 18:00:30,958 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:30,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15558 transitions. [2020-01-16 18:00:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:30,964 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:30,964 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:30,964 INFO L426 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:30,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1320397242, now seen corresponding path program 579 times [2020-01-16 18:00:30,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:30,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460206745] [2020-01-16 18:00:30,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:31,512 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:31,645 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 18:00:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:31,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460206745] [2020-01-16 18:00:31,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:31,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:31,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632663806] [2020-01-16 18:00:31,654 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:31,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:31,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:31,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:31,655 INFO L87 Difference]: Start difference. First operand 3121 states and 15558 transitions. Second operand 12 states. [2020-01-16 18:00:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:31,915 INFO L93 Difference]: Finished difference Result 5990 states and 26736 transitions. [2020-01-16 18:00:31,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:31,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:31,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:31,930 INFO L225 Difference]: With dead ends: 5990 [2020-01-16 18:00:31,930 INFO L226 Difference]: Without dead ends: 5974 [2020-01-16 18:00:31,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-01-16 18:00:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3126. [2020-01-16 18:00:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-01-16 18:00:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15567 transitions. [2020-01-16 18:00:32,152 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15567 transitions. Word has length 31 [2020-01-16 18:00:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:32,152 INFO L478 AbstractCegarLoop]: Abstraction has 3126 states and 15567 transitions. [2020-01-16 18:00:32,152 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15567 transitions. [2020-01-16 18:00:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:32,157 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:32,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:32,157 INFO L426 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:32,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:32,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1214517114, now seen corresponding path program 580 times [2020-01-16 18:00:32,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:32,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312056937] [2020-01-16 18:00:32,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:32,697 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 18:00:32,828 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 18:00:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:32,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312056937] [2020-01-16 18:00:32,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:32,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:32,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008542464] [2020-01-16 18:00:32,837 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:32,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:32,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:32,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:32,838 INFO L87 Difference]: Start difference. First operand 3126 states and 15567 transitions. Second operand 12 states. [2020-01-16 18:00:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:33,097 INFO L93 Difference]: Finished difference Result 5992 states and 26735 transitions. [2020-01-16 18:00:33,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:33,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:33,113 INFO L225 Difference]: With dead ends: 5992 [2020-01-16 18:00:33,113 INFO L226 Difference]: Without dead ends: 5969 [2020-01-16 18:00:33,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-01-16 18:00:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-01-16 18:00:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-01-16 18:00:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15553 transitions. [2020-01-16 18:00:33,338 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15553 transitions. Word has length 31 [2020-01-16 18:00:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:33,338 INFO L478 AbstractCegarLoop]: Abstraction has 3121 states and 15553 transitions. [2020-01-16 18:00:33,338 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15553 transitions. [2020-01-16 18:00:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:33,343 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:33,343 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:33,343 INFO L426 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:33,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1218168134, now seen corresponding path program 581 times [2020-01-16 18:00:33,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:33,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88823775] [2020-01-16 18:00:33,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:34,027 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:34,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-01-16 18:00:34,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88823775] [2020-01-16 18:00:34,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:34,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:34,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812520722] [2020-01-16 18:00:34,037 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:34,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:34,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:34,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:34,037 INFO L87 Difference]: Start difference. First operand 3121 states and 15553 transitions. Second operand 12 states. [2020-01-16 18:00:34,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:34,256 INFO L93 Difference]: Finished difference Result 5993 states and 26738 transitions. [2020-01-16 18:00:34,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:34,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:34,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:34,271 INFO L225 Difference]: With dead ends: 5993 [2020-01-16 18:00:34,271 INFO L226 Difference]: Without dead ends: 5976 [2020-01-16 18:00:34,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:34,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-01-16 18:00:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3127. [2020-01-16 18:00:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 18:00:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15564 transitions. [2020-01-16 18:00:34,491 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15564 transitions. Word has length 31 [2020-01-16 18:00:34,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:34,491 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15564 transitions. [2020-01-16 18:00:34,491 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15564 transitions. [2020-01-16 18:00:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:34,496 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:34,496 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:34,496 INFO L426 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:34,496 INFO L82 PathProgramCache]: Analyzing trace with hash -2063139586, now seen corresponding path program 582 times [2020-01-16 18:00:34,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:34,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934698947] [2020-01-16 18:00:34,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:35,084 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:35,217 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:35,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934698947] [2020-01-16 18:00:35,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:35,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:35,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058881824] [2020-01-16 18:00:35,226 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:35,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:35,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:35,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:35,226 INFO L87 Difference]: Start difference. First operand 3127 states and 15564 transitions. Second operand 12 states. [2020-01-16 18:00:35,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:35,491 INFO L93 Difference]: Finished difference Result 5994 states and 26734 transitions. [2020-01-16 18:00:35,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:35,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:35,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:35,505 INFO L225 Difference]: With dead ends: 5994 [2020-01-16 18:00:35,506 INFO L226 Difference]: Without dead ends: 5965 [2020-01-16 18:00:35,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:35,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5965 states. [2020-01-16 18:00:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5965 to 3116. [2020-01-16 18:00:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-01-16 18:00:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15539 transitions. [2020-01-16 18:00:35,728 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15539 transitions. Word has length 31 [2020-01-16 18:00:35,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:35,728 INFO L478 AbstractCegarLoop]: Abstraction has 3116 states and 15539 transitions. [2020-01-16 18:00:35,728 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15539 transitions. [2020-01-16 18:00:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:35,734 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:35,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:35,734 INFO L426 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:35,734 INFO L82 PathProgramCache]: Analyzing trace with hash -805894812, now seen corresponding path program 583 times [2020-01-16 18:00:35,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:35,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993885725] [2020-01-16 18:00:35,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:36,261 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:36,391 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 18:00:36,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-01-16 18:00:36,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993885725] [2020-01-16 18:00:36,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:36,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:36,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111418570] [2020-01-16 18:00:36,401 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:36,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:36,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:36,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:36,401 INFO L87 Difference]: Start difference. First operand 3116 states and 15539 transitions. Second operand 12 states. [2020-01-16 18:00:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:36,663 INFO L93 Difference]: Finished difference Result 5996 states and 26748 transitions. [2020-01-16 18:00:36,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:36,663 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:36,677 INFO L225 Difference]: With dead ends: 5996 [2020-01-16 18:00:36,678 INFO L226 Difference]: Without dead ends: 5980 [2020-01-16 18:00:36,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-01-16 18:00:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3127. [2020-01-16 18:00:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 18:00:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15570 transitions. [2020-01-16 18:00:36,904 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15570 transitions. Word has length 31 [2020-01-16 18:00:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:36,905 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15570 transitions. [2020-01-16 18:00:36,905 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15570 transitions. [2020-01-16 18:00:36,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:36,910 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:36,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, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:36,910 INFO L426 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:36,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:36,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1799129580, now seen corresponding path program 584 times [2020-01-16 18:00:36,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:36,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108623598] [2020-01-16 18:00:36,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:37,562 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:37,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-01-16 18:00:37,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108623598] [2020-01-16 18:00:37,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:37,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:37,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017305933] [2020-01-16 18:00:37,571 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:37,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:37,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:37,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:37,571 INFO L87 Difference]: Start difference. First operand 3127 states and 15570 transitions. Second operand 12 states. [2020-01-16 18:00:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:37,796 INFO L93 Difference]: Finished difference Result 5997 states and 26745 transitions. [2020-01-16 18:00:37,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:37,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:37,812 INFO L225 Difference]: With dead ends: 5997 [2020-01-16 18:00:37,812 INFO L226 Difference]: Without dead ends: 5975 [2020-01-16 18:00:37,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-01-16 18:00:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3122. [2020-01-16 18:00:38,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 18:00:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15556 transitions. [2020-01-16 18:00:38,031 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15556 transitions. Word has length 31 [2020-01-16 18:00:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:38,031 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15556 transitions. [2020-01-16 18:00:38,031 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15556 transitions. [2020-01-16 18:00:38,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:38,036 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:38,036 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:38,036 INFO L426 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:38,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:38,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1866672902, now seen corresponding path program 585 times [2020-01-16 18:00:38,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:38,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460225982] [2020-01-16 18:00:38,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:38,550 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:38,679 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 18:00: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-01-16 18:00:38,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460225982] [2020-01-16 18:00:38,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:38,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:38,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87737868] [2020-01-16 18:00:38,689 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:38,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:38,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:38,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:38,689 INFO L87 Difference]: Start difference. First operand 3122 states and 15556 transitions. Second operand 12 states. [2020-01-16 18:00:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:38,915 INFO L93 Difference]: Finished difference Result 6002 states and 26754 transitions. [2020-01-16 18:00:38,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:38,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:38,931 INFO L225 Difference]: With dead ends: 6002 [2020-01-16 18:00:38,931 INFO L226 Difference]: Without dead ends: 5986 [2020-01-16 18:00:38,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2020-01-16 18:00:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 3128. [2020-01-16 18:00:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 18:00:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15567 transitions. [2020-01-16 18:00:39,159 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15567 transitions. Word has length 31 [2020-01-16 18:00:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:39,159 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15567 transitions. [2020-01-16 18:00:39,159 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15567 transitions. [2020-01-16 18:00:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:39,164 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:39,164 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:39,164 INFO L426 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:39,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:39,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1374077140, now seen corresponding path program 586 times [2020-01-16 18:00:39,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:39,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977696881] [2020-01-16 18:00:39,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:39,692 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2020-01-16 18:00:39,819 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-01-16 18:00:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:39,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977696881] [2020-01-16 18:00:39,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:39,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:39,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511323283] [2020-01-16 18:00:39,828 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:39,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:39,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:39,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:39,829 INFO L87 Difference]: Start difference. First operand 3128 states and 15567 transitions. Second operand 12 states. [2020-01-16 18:00:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:40,016 INFO L93 Difference]: Finished difference Result 6008 states and 26760 transitions. [2020-01-16 18:00:40,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:40,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:40,030 INFO L225 Difference]: With dead ends: 6008 [2020-01-16 18:00:40,031 INFO L226 Difference]: Without dead ends: 5980 [2020-01-16 18:00:40,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-01-16 18:00:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3122. [2020-01-16 18:00:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 18:00:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15550 transitions. [2020-01-16 18:00:40,253 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15550 transitions. Word has length 31 [2020-01-16 18:00:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:40,253 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15550 transitions. [2020-01-16 18:00:40,253 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15550 transitions. [2020-01-16 18:00:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:40,259 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:40,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:40,259 INFO L426 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:40,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:40,259 INFO L82 PathProgramCache]: Analyzing trace with hash -110270982, now seen corresponding path program 587 times [2020-01-16 18:00:40,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:40,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513548963] [2020-01-16 18:00:40,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:40,921 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:40,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513548963] [2020-01-16 18:00:40,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:40,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:40,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822395029] [2020-01-16 18:00:40,931 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:40,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:40,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:40,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:40,931 INFO L87 Difference]: Start difference. First operand 3122 states and 15550 transitions. Second operand 12 states. [2020-01-16 18:00:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:41,229 INFO L93 Difference]: Finished difference Result 6005 states and 26755 transitions. [2020-01-16 18:00:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:41,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:41,247 INFO L225 Difference]: With dead ends: 6005 [2020-01-16 18:00:41,247 INFO L226 Difference]: Without dead ends: 5988 [2020-01-16 18:00:41,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:41,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-01-16 18:00:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3129. [2020-01-16 18:00:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 18:00:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15563 transitions. [2020-01-16 18:00:41,471 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15563 transitions. Word has length 31 [2020-01-16 18:00:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:41,472 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15563 transitions. [2020-01-16 18:00:41,472 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15563 transitions. [2020-01-16 18:00:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:41,477 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:41,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:41,477 INFO L426 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:41,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:41,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2072267684, now seen corresponding path program 588 times [2020-01-16 18:00:41,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:41,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21804813] [2020-01-16 18:00:41,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:42,023 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-01-16 18:00:42,153 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:42,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21804813] [2020-01-16 18:00:42,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:42,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:42,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58629357] [2020-01-16 18:00:42,162 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:42,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:42,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:42,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:42,162 INFO L87 Difference]: Start difference. First operand 3129 states and 15563 transitions. Second operand 12 states. [2020-01-16 18:00:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:42,380 INFO L93 Difference]: Finished difference Result 6010 states and 26758 transitions. [2020-01-16 18:00:42,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:42,381 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:42,395 INFO L225 Difference]: With dead ends: 6010 [2020-01-16 18:00:42,396 INFO L226 Difference]: Without dead ends: 5975 [2020-01-16 18:00:42,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-01-16 18:00:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3116. [2020-01-16 18:00:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-01-16 18:00:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15533 transitions. [2020-01-16 18:00:42,617 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15533 transitions. Word has length 31 [2020-01-16 18:00:42,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:42,617 INFO L478 AbstractCegarLoop]: Abstraction has 3116 states and 15533 transitions. [2020-01-16 18:00:42,617 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15533 transitions. [2020-01-16 18:00:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:42,622 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:42,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:42,622 INFO L426 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:42,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:42,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1498952476, now seen corresponding path program 589 times [2020-01-16 18:00:42,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:42,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438793842] [2020-01-16 18:00:42,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:43,156 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:43,285 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 18:00:43,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-01-16 18:00:43,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438793842] [2020-01-16 18:00:43,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:43,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:43,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080265387] [2020-01-16 18:00:43,294 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:43,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:43,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:43,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:43,295 INFO L87 Difference]: Start difference. First operand 3116 states and 15533 transitions. Second operand 12 states. [2020-01-16 18:00:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:43,551 INFO L93 Difference]: Finished difference Result 5999 states and 26749 transitions. [2020-01-16 18:00:43,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:43,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:43,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:43,567 INFO L225 Difference]: With dead ends: 5999 [2020-01-16 18:00:43,567 INFO L226 Difference]: Without dead ends: 5983 [2020-01-16 18:00:43,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-01-16 18:00:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3127. [2020-01-16 18:00:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-01-16 18:00:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15564 transitions. [2020-01-16 18:00:43,850 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15564 transitions. Word has length 31 [2020-01-16 18:00:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:43,850 INFO L478 AbstractCegarLoop]: Abstraction has 3127 states and 15564 transitions. [2020-01-16 18:00:43,850 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15564 transitions. [2020-01-16 18:00:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:43,855 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:43,855 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:43,855 INFO L426 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:43,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:43,856 INFO L82 PathProgramCache]: Analyzing trace with hash 261100464, now seen corresponding path program 590 times [2020-01-16 18:00:43,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:43,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343212740] [2020-01-16 18:00:43,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:44,386 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 18:00:44,513 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 18:00:44,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:44,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343212740] [2020-01-16 18:00:44,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:44,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:44,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303964510] [2020-01-16 18:00:44,522 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:44,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:44,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:44,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:44,522 INFO L87 Difference]: Start difference. First operand 3127 states and 15564 transitions. Second operand 12 states. [2020-01-16 18:00:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:44,827 INFO L93 Difference]: Finished difference Result 6001 states and 26748 transitions. [2020-01-16 18:00:44,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:44,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:44,841 INFO L225 Difference]: With dead ends: 6001 [2020-01-16 18:00:44,842 INFO L226 Difference]: Without dead ends: 5978 [2020-01-16 18:00:44,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-01-16 18:00:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3122. [2020-01-16 18:00:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 18:00:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15550 transitions. [2020-01-16 18:00:45,063 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15550 transitions. Word has length 31 [2020-01-16 18:00:45,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:45,063 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15550 transitions. [2020-01-16 18:00:45,063 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:45,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15550 transitions. [2020-01-16 18:00:45,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:45,068 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:45,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:45,068 INFO L426 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:45,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:45,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2135419330, now seen corresponding path program 591 times [2020-01-16 18:00:45,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:45,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418759679] [2020-01-16 18:00:45,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:45,586 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:45,718 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 18:00:45,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-01-16 18:00:45,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418759679] [2020-01-16 18:00:45,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:45,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:45,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642039553] [2020-01-16 18:00:45,727 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:45,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:45,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:45,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:45,728 INFO L87 Difference]: Start difference. First operand 3122 states and 15550 transitions. Second operand 12 states. [2020-01-16 18:00:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:46,041 INFO L93 Difference]: Finished difference Result 6004 states and 26753 transitions. [2020-01-16 18:00:46,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:46,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:46,056 INFO L225 Difference]: With dead ends: 6004 [2020-01-16 18:00:46,056 INFO L226 Difference]: Without dead ends: 5988 [2020-01-16 18:00:46,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-01-16 18:00:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3128. [2020-01-16 18:00:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-01-16 18:00:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15561 transitions. [2020-01-16 18:00:46,276 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15561 transitions. Word has length 31 [2020-01-16 18:00:46,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:46,276 INFO L478 AbstractCegarLoop]: Abstraction has 3128 states and 15561 transitions. [2020-01-16 18:00:46,277 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:46,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15561 transitions. [2020-01-16 18:00:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:46,282 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:46,282 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:46,282 INFO L426 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:46,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:46,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1642823568, now seen corresponding path program 592 times [2020-01-16 18:00:46,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:46,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530970923] [2020-01-16 18:00:46,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:46,802 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 18:00:46,934 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 18:00:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:46,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530970923] [2020-01-16 18:00:46,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:46,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:46,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158717951] [2020-01-16 18:00:46,943 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:46,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:46,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:46,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:46,944 INFO L87 Difference]: Start difference. First operand 3128 states and 15561 transitions. Second operand 12 states. [2020-01-16 18:00:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:47,139 INFO L93 Difference]: Finished difference Result 6010 states and 26759 transitions. [2020-01-16 18:00:47,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:47,140 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:47,155 INFO L225 Difference]: With dead ends: 6010 [2020-01-16 18:00:47,155 INFO L226 Difference]: Without dead ends: 5982 [2020-01-16 18:00:47,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-01-16 18:00:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3122. [2020-01-16 18:00:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-01-16 18:00:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15544 transitions. [2020-01-16 18:00:47,380 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15544 transitions. Word has length 31 [2020-01-16 18:00:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:47,380 INFO L478 AbstractCegarLoop]: Abstraction has 3122 states and 15544 transitions. [2020-01-16 18:00:47,380 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15544 transitions. [2020-01-16 18:00:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:47,385 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:47,385 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:47,385 INFO L426 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:47,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1648300098, now seen corresponding path program 593 times [2020-01-16 18:00:47,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:47,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130631485] [2020-01-16 18:00:47,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:47,918 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 18:00:48,043 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 18:00:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:48,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130631485] [2020-01-16 18:00:48,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:48,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:48,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755946882] [2020-01-16 18:00:48,053 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:48,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:48,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:48,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:48,054 INFO L87 Difference]: Start difference. First operand 3122 states and 15544 transitions. Second operand 12 states. [2020-01-16 18:00:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:48,293 INFO L93 Difference]: Finished difference Result 6010 states and 26761 transitions. [2020-01-16 18:00:48,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:48,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:48,308 INFO L225 Difference]: With dead ends: 6010 [2020-01-16 18:00:48,309 INFO L226 Difference]: Without dead ends: 5992 [2020-01-16 18:00:48,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:48,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-01-16 18:00:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3130. [2020-01-16 18:00:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 18:00:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15559 transitions. [2020-01-16 18:00:48,527 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15559 transitions. Word has length 31 [2020-01-16 18:00:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:48,527 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15559 transitions. [2020-01-16 18:00:48,527 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15559 transitions. [2020-01-16 18:00:48,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:48,532 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:48,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:48,532 INFO L426 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:48,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:48,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1379210020, now seen corresponding path program 594 times [2020-01-16 18:00:48,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:48,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094987544] [2020-01-16 18:00:48,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:49,078 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-01-16 18:00:49,209 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-01-16 18:00:49,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-01-16 18:00:49,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094987544] [2020-01-16 18:00:49,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:49,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:49,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041473089] [2020-01-16 18:00:49,218 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:49,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:49,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:49,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:49,218 INFO L87 Difference]: Start difference. First operand 3130 states and 15559 transitions. Second operand 12 states. [2020-01-16 18:00:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:49,406 INFO L93 Difference]: Finished difference Result 6014 states and 26761 transitions. [2020-01-16 18:00:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:49,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:49,420 INFO L225 Difference]: With dead ends: 6014 [2020-01-16 18:00:49,421 INFO L226 Difference]: Without dead ends: 5978 [2020-01-16 18:00:49,421 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-01-16 18:00:49,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3116. [2020-01-16 18:00:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-01-16 18:00:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15527 transitions. [2020-01-16 18:00:49,647 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15527 transitions. Word has length 31 [2020-01-16 18:00:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:49,647 INFO L478 AbstractCegarLoop]: Abstraction has 3116 states and 15527 transitions. [2020-01-16 18:00:49,647 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15527 transitions. [2020-01-16 18:00:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:49,654 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:49,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:49,655 INFO L426 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:49,655 INFO L82 PathProgramCache]: Analyzing trace with hash -280043412, now seen corresponding path program 595 times [2020-01-16 18:00:49,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:49,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133412204] [2020-01-16 18:00:49,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:50,202 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-01-16 18:00:50,333 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:50,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133412204] [2020-01-16 18:00:50,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:50,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:50,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230639637] [2020-01-16 18:00:50,343 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:50,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:50,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:50,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:50,344 INFO L87 Difference]: Start difference. First operand 3116 states and 15527 transitions. Second operand 12 states. [2020-01-16 18:00:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:50,583 INFO L93 Difference]: Finished difference Result 6006 states and 26762 transitions. [2020-01-16 18:00:50,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:50,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:50,599 INFO L225 Difference]: With dead ends: 6006 [2020-01-16 18:00:50,599 INFO L226 Difference]: Without dead ends: 5989 [2020-01-16 18:00:50,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-01-16 18:00:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3129. [2020-01-16 18:00:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-01-16 18:00:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15564 transitions. [2020-01-16 18:00:50,825 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15564 transitions. Word has length 31 [2020-01-16 18:00:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:50,825 INFO L478 AbstractCegarLoop]: Abstraction has 3129 states and 15564 transitions. [2020-01-16 18:00:50,825 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15564 transitions. [2020-01-16 18:00:50,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:50,830 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:50,830 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:50,830 INFO L426 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:50,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:50,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1125014864, now seen corresponding path program 596 times [2020-01-16 18:00:50,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:50,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186436903] [2020-01-16 18:00:50,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:51,385 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-01-16 18:00:51,516 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:51,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186436903] [2020-01-16 18:00:51,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:51,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:51,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859469472] [2020-01-16 18:00:51,525 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:51,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:51,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:51,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:51,525 INFO L87 Difference]: Start difference. First operand 3129 states and 15564 transitions. Second operand 12 states. [2020-01-16 18:00:51,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:51,746 INFO L93 Difference]: Finished difference Result 6007 states and 26758 transitions. [2020-01-16 18:00:51,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:51,747 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:51,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:51,760 INFO L225 Difference]: With dead ends: 6007 [2020-01-16 18:00:51,760 INFO L226 Difference]: Without dead ends: 5983 [2020-01-16 18:00:51,761 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-01-16 18:00:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3123. [2020-01-16 18:00:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 18:00:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15547 transitions. [2020-01-16 18:00:51,985 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15547 transitions. Word has length 31 [2020-01-16 18:00:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:51,985 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15547 transitions. [2020-01-16 18:00:51,986 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15547 transitions. [2020-01-16 18:00:51,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:51,991 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:51,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:51,991 INFO L426 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:51,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:51,991 INFO L82 PathProgramCache]: Analyzing trace with hash -916510266, now seen corresponding path program 597 times [2020-01-16 18:00:51,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:51,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247687133] [2020-01-16 18:00:51,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:52,653 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:52,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247687133] [2020-01-16 18:00:52,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:52,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:52,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015410118] [2020-01-16 18:00:52,708 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:52,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:52,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:52,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:52,709 INFO L87 Difference]: Start difference. First operand 3123 states and 15547 transitions. Second operand 12 states. [2020-01-16 18:00:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:52,976 INFO L93 Difference]: Finished difference Result 6011 states and 26765 transitions. [2020-01-16 18:00:52,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:52,976 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:52,992 INFO L225 Difference]: With dead ends: 6011 [2020-01-16 18:00:52,992 INFO L226 Difference]: Without dead ends: 5994 [2020-01-16 18:00:52,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-01-16 18:00:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3130. [2020-01-16 18:00:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-01-16 18:00:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15560 transitions. [2020-01-16 18:00:53,217 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15560 transitions. Word has length 31 [2020-01-16 18:00:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:53,217 INFO L478 AbstractCegarLoop]: Abstraction has 3130 states and 15560 transitions. [2020-01-16 18:00:53,218 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15560 transitions. [2020-01-16 18:00:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:53,223 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:53,223 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:53,223 INFO L426 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:53,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1266028400, now seen corresponding path program 598 times [2020-01-16 18:00:53,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:53,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693461383] [2020-01-16 18:00:53,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-01-16 18:00:53,742 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-01-16 18:00:53,873 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-01-16 18:00:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-01-16 18:00:53,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693461383] [2020-01-16 18:00:53,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-01-16 18:00:53,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-01-16 18:00:53,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215526599] [2020-01-16 18:00:53,884 INFO L458 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-01-16 18:00:53,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-01-16 18:00:53,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-01-16 18:00:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-01-16 18:00:53,884 INFO L87 Difference]: Start difference. First operand 3130 states and 15560 transitions. Second operand 12 states. [2020-01-16 18:00:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-01-16 18:00:54,134 INFO L93 Difference]: Finished difference Result 6016 states and 26768 transitions. [2020-01-16 18:00:54,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-01-16 18:00:54,135 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-01-16 18:00:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-01-16 18:00:54,150 INFO L225 Difference]: With dead ends: 6016 [2020-01-16 18:00:54,150 INFO L226 Difference]: Without dead ends: 5987 [2020-01-16 18:00:54,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-01-16 18:00:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-01-16 18:00:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3123. [2020-01-16 18:00:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-01-16 18:00:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15540 transitions. [2020-01-16 18:00:54,375 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15540 transitions. Word has length 31 [2020-01-16 18:00:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-01-16 18:00:54,375 INFO L478 AbstractCegarLoop]: Abstraction has 3123 states and 15540 transitions. [2020-01-16 18:00:54,375 INFO L479 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-01-16 18:00:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15540 transitions. [2020-01-16 18:00:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-01-16 18:00:54,380 INFO L407 BasicCegarLoop]: Found error trace [2020-01-16 18:00:54,380 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-01-16 18:00:54,380 INFO L426 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-01-16 18:00:54,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-01-16 18:00:54,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2109174342, now seen corresponding path program 599 times [2020-01-16 18:00:54,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-01-16 18:00:54,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608604582] [2020-01-16 18:00:54,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-01-16 18:00:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2020-01-16 18:00:54,504 WARN L209 SmtUtils]: Removed 1 from assertion stack [2020-01-16 18:00:54,504 WARN L543 AbstractCegarLoop]: Verification canceled [2020-01-16 18:00:54,507 WARN L227 ceAbstractionStarter]: Timeout [2020-01-16 18:00:54,508 INFO L202 PluginConnector]: Adding new model example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.01 06:00:54 BasicIcfg [2020-01-16 18:00:54,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-01-16 18:00:54,509 INFO L168 Benchmark]: Toolchain (without parser) took 772279.41 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 120.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2020-01-16 18:00:54,509 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.41 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-01-16 18:00:54,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.18 ms. Allocated memory is still 138.9 MB. Free memory was 120.7 MB in the beginning and 119.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-01-16 18:00:54,510 INFO L168 Benchmark]: Boogie Preprocessor took 25.61 ms. Allocated memory is still 138.9 MB. Free memory was 119.0 MB in the beginning and 117.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-01-16 18:00:54,510 INFO L168 Benchmark]: RCFGBuilder took 363.14 ms. Allocated memory is still 138.9 MB. Free memory was 117.7 MB in the beginning and 103.4 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-01-16 18:00:54,510 INFO L168 Benchmark]: TraceAbstraction took 771847.89 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 103.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2020-01-16 18:00:54,510 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 1.41 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.18 ms. Allocated memory is still 138.9 MB. Free memory was 120.7 MB in the beginning and 119.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.61 ms. Allocated memory is still 138.9 MB. Free memory was 119.0 MB in the beginning and 117.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.14 ms. Allocated memory is still 138.9 MB. Free memory was 117.7 MB in the beginning and 103.4 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 771847.89 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 103.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.1s, 84 ProgramPointsBefore, 72 ProgramPointsAfterwards, 143 TransitionsBefore, 132 TransitionsAfterwards, 3780 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 990 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1035 CheckedPairsTotal, 11 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 30 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 771.4s, OverallIterations: 608, TraceHistogramMax: 1, AutomataDifference: 167.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 22.5s, HoareTripleCheckerStatistics: 92171 SDtfs, 138002 SDslu, 259254 SDs, 0 SdLazy, 69215 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 69.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7203 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 6587 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4784 ImplicationChecksByTransitivity, 440.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60074occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 160.5s AutomataMinimizationTime, 607 MinimizatonAttempts, 1722894 StatesRemovedByMinimization, 598 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 405.5s InterpolantComputationTime, 18817 NumberOfCodeBlocks, 18817 NumberOfCodeBlocksAsserted, 607 NumberOfCheckSat, 18210 ConstructedInterpolants, 0 QuantifiedInterpolants, 22663260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 607 InterpolantComputations, 607 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