/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:25:58,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:25:58,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:25:58,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:25:58,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:25:58,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:25:58,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:25:58,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:25:58,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:25:58,429 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:25:58,430 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:25:58,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:25:58,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:25:58,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:25:58,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:25:58,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:25:58,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:25:58,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:25:58,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:25:58,449 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:25:58,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:25:58,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:25:58,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:25:58,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:25:58,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:25:58,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:25:58,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:25:58,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:25:58,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:25:58,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:25:58,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:25:58,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:25:58,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:25:58,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:25:58,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:25:58,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:25:58,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:25:58,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:25:58,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:25:58,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:25:58,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:25:58,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2020-02-10 20:25:58,496 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:25:58,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:25:58,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:25:58,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:25:58,498 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:25:58,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:25:58,499 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:25:58,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:25:58,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:25:58,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:25:58,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:25:58,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:25:58,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:25:58,500 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:25:58,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:25:58,500 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:25:58,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:25:58,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:25:58,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:25:58,501 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:25:58,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:25:58,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:25:58,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:25:58,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:25:58,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:25:58,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:25:58,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:25:58,503 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-02-10 20:25:58,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:25:58,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:25:58,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:25:58,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:25:58,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:25:58,791 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:25:58,792 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:25:58,793 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_11.bpl [2020-02-10 20:25:58,793 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_11.bpl' [2020-02-10 20:25:58,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:25:58,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:25:58,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:25:58,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:25:58,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:25:58,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/1) ... [2020-02-10 20:25:58,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/1) ... [2020-02-10 20:25:58,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:25:58,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:25:58,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:25:58,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:25:58,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/1) ... [2020-02-10 20:25:58,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/1) ... [2020-02-10 20:25:58,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/1) ... [2020-02-10 20:25:58,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/1) ... [2020-02-10 20:25:58,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/1) ... [2020-02-10 20:25:58,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/1) ... [2020-02-10 20:25:58,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/1) ... [2020-02-10 20:25:58,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:25:58,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:25:58,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:25:58,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:25:58,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:25:58,961 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:25:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:25:58,962 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:25:58,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:25:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:25:58,962 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:25:58,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:25:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:25:58,963 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:25:58,963 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 20:25:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 20:25:58,963 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 20:25:58,964 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:25:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:25:58,964 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:25:58,964 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_9 given in one single declaration [2020-02-10 20:25:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure set_9 [2020-02-10 20:25:58,965 INFO L138 BoogieDeclarations]: Found implementation of procedure set_9 [2020-02-10 20:25:58,965 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:25:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:25:58,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:25:58,965 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 20:25:58,966 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 20:25:58,966 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 20:25:58,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 20:25:58,966 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 20:25:58,966 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 20:25:58,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_10 given in one single declaration [2020-02-10 20:25:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure set_10 [2020-02-10 20:25:58,967 INFO L138 BoogieDeclarations]: Found implementation of procedure set_10 [2020-02-10 20:25:58,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-02-10 20:25:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-02-10 20:25:58,968 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-02-10 20:25:58,968 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_8 given in one single declaration [2020-02-10 20:25:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure set_8 [2020-02-10 20:25:58,968 INFO L138 BoogieDeclarations]: Found implementation of procedure set_8 [2020-02-10 20:25:58,970 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 20:25:59,252 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:25:59,252 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:25:59,271 INFO L202 PluginConnector]: Adding new model example_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:25:59 BoogieIcfgContainer [2020-02-10 20:25:59,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:25:59,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:25:59,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:25:59,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:25:59,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/2) ... [2020-02-10 20:25:59,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c92a47d and model type example_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 08:25:59, skipping insertion in model container [2020-02-10 20:25:59,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:25:59" (2/2) ... [2020-02-10 20:25:59,282 INFO L109 eAbstractionObserver]: Analyzing ICFG example_11.bpl [2020-02-10 20:25:59,293 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:25:59,293 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:25:59,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:25:59,301 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:25:59,580 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-02-10 20:25:59,609 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:25:59,609 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:25:59,609 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:25:59,609 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:25:59,610 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:25:59,610 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:25:59,610 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:25:59,610 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:25:59,634 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 168 transitions [2020-02-10 20:25:59,636 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 92 places, 168 transitions [2020-02-10 20:26:10,193 INFO L129 PetriNetUnfolder]: 9217/11300 cut-off events. [2020-02-10 20:26:10,194 INFO L130 PetriNetUnfolder]: For 11264/11264 co-relation queries the response was YES. [2020-02-10 20:26:10,347 INFO L76 FinitePrefix]: Finished finitePrefix Result has 22598 conditions, 11300 events. 9217/11300 cut-off events. For 11264/11264 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 45887 event pairs. 0/11299 useless extension candidates. Maximal degree in co-relation 10292. Up to 2772 conditions per place. [2020-02-10 20:26:10,610 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 92 places, 168 transitions [2020-02-10 20:26:20,724 INFO L129 PetriNetUnfolder]: 9217/11300 cut-off events. [2020-02-10 20:26:20,725 INFO L130 PetriNetUnfolder]: For 11264/11264 co-relation queries the response was YES. [2020-02-10 20:26:20,904 INFO L76 FinitePrefix]: Finished finitePrefix Result has 22598 conditions, 11300 events. 9217/11300 cut-off events. For 11264/11264 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 45887 event pairs. 0/11299 useless extension candidates. Maximal degree in co-relation 10292. Up to 2772 conditions per place. [2020-02-10 20:26:21,088 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5060 [2020-02-10 20:26:21,089 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-02-10 20:26:21,318 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1375 [2020-02-10 20:26:21,318 INFO L214 etLargeBlockEncoding]: Total number of compositions: 12 [2020-02-10 20:26:21,322 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 156 transitions [2020-02-10 20:28:03,282 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 179196 states. [2020-02-10 20:28:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 179196 states. [2020-02-10 20:28:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:28:04,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:04,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, 1, 1, 1] [2020-02-10 20:28:04,011 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:28:04,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:04,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1136777304, now seen corresponding path program 1 times [2020-02-10 20:28:04,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:04,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605719405] [2020-02-10 20:28:04,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:04,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605719405] [2020-02-10 20:28:04,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:04,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:28:04,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098088858] [2020-02-10 20:28:04,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:28:04,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:04,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:28:04,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:28:04,237 INFO L87 Difference]: Start difference. First operand 179196 states. Second operand 3 states. [2020-02-10 20:28:11,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:11,203 INFO L93 Difference]: Finished difference Result 146172 states and 1021320 transitions. [2020-02-10 20:28:11,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:28:11,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:28:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:12,360 INFO L225 Difference]: With dead ends: 146172 [2020-02-10 20:28:12,361 INFO L226 Difference]: Without dead ends: 146171 [2020-02-10 20:28:12,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:28:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146171 states. [2020-02-10 20:28:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146171 to 146171. [2020-02-10 20:28:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146171 states. [2020-02-10 20:28:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146171 states to 146171 states and 1021319 transitions. [2020-02-10 20:28:24,595 INFO L78 Accepts]: Start accepts. Automaton has 146171 states and 1021319 transitions. Word has length 34 [2020-02-10 20:28:24,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:24,596 INFO L479 AbstractCegarLoop]: Abstraction has 146171 states and 1021319 transitions. [2020-02-10 20:28:24,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:28:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 146171 states and 1021319 transitions. [2020-02-10 20:28:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:28:33,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:33,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, 1, 1, 1] [2020-02-10 20:28:33,577 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:28:33,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:33,578 INFO L82 PathProgramCache]: Analyzing trace with hash -356386054, now seen corresponding path program 1 times [2020-02-10 20:28:33,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:33,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49735976] [2020-02-10 20:28:33,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:33,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49735976] [2020-02-10 20:28:33,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:33,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:28:33,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247768209] [2020-02-10 20:28:33,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:28:33,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:28:33,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:28:33,630 INFO L87 Difference]: Start difference. First operand 146171 states and 1021319 transitions. Second operand 3 states. [2020-02-10 20:28:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:36,021 INFO L93 Difference]: Finished difference Result 145147 states and 1010567 transitions. [2020-02-10 20:28:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:28:36,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:28:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:36,781 INFO L225 Difference]: With dead ends: 145147 [2020-02-10 20:28:36,781 INFO L226 Difference]: Without dead ends: 145147 [2020-02-10 20:28:36,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:28:49,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145147 states. [2020-02-10 20:28:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145147 to 145147. [2020-02-10 20:28:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145147 states. [2020-02-10 20:28:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145147 states to 145147 states and 1010567 transitions. [2020-02-10 20:28:53,949 INFO L78 Accepts]: Start accepts. Automaton has 145147 states and 1010567 transitions. Word has length 34 [2020-02-10 20:28:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:53,950 INFO L479 AbstractCegarLoop]: Abstraction has 145147 states and 1010567 transitions. [2020-02-10 20:28:53,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:28:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 145147 states and 1010567 transitions. [2020-02-10 20:29:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:29:02,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:02,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:02,616 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:29:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:02,617 INFO L82 PathProgramCache]: Analyzing trace with hash 935006680, now seen corresponding path program 1 times [2020-02-10 20:29:02,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:02,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539691078] [2020-02-10 20:29:02,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:02,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539691078] [2020-02-10 20:29:02,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:02,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:29:02,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144666554] [2020-02-10 20:29:02,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:29:02,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:02,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:29:02,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:29:02,658 INFO L87 Difference]: Start difference. First operand 145147 states and 1010567 transitions. Second operand 3 states. [2020-02-10 20:29:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:04,383 INFO L93 Difference]: Finished difference Result 139515 states and 956551 transitions. [2020-02-10 20:29:04,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:29:04,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:29:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:05,017 INFO L225 Difference]: With dead ends: 139515 [2020-02-10 20:29:05,017 INFO L226 Difference]: Without dead ends: 139515 [2020-02-10 20:29:05,017 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:29:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139515 states. [2020-02-10 20:29:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139515 to 139515. [2020-02-10 20:29:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139515 states. [2020-02-10 20:29:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139515 states to 139515 states and 956551 transitions. [2020-02-10 20:29:21,780 INFO L78 Accepts]: Start accepts. Automaton has 139515 states and 956551 transitions. Word has length 34 [2020-02-10 20:29:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:21,780 INFO L479 AbstractCegarLoop]: Abstraction has 139515 states and 956551 transitions. [2020-02-10 20:29:21,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:29:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 139515 states and 956551 transitions. [2020-02-10 20:29:22,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:29:22,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:22,158 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:22,158 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:29:22,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:22,159 INFO L82 PathProgramCache]: Analyzing trace with hash -457460980, now seen corresponding path program 1 times [2020-02-10 20:29:22,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:22,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312280744] [2020-02-10 20:29:22,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:22,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312280744] [2020-02-10 20:29:22,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:22,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:29:22,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549966981] [2020-02-10 20:29:22,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:29:22,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:29:22,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:29:22,198 INFO L87 Difference]: Start difference. First operand 139515 states and 956551 transitions. Second operand 3 states. [2020-02-10 20:29:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:29,232 INFO L93 Difference]: Finished difference Result 88603 states and 587879 transitions. [2020-02-10 20:29:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:29:29,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:29:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:29,568 INFO L225 Difference]: With dead ends: 88603 [2020-02-10 20:29:29,568 INFO L226 Difference]: Without dead ends: 88603 [2020-02-10 20:29:29,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:29:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88603 states. [2020-02-10 20:29:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88603 to 88603. [2020-02-10 20:29:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88603 states. [2020-02-10 20:29:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88603 states to 88603 states and 587879 transitions. [2020-02-10 20:29:36,251 INFO L78 Accepts]: Start accepts. Automaton has 88603 states and 587879 transitions. Word has length 34 [2020-02-10 20:29:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:36,252 INFO L479 AbstractCegarLoop]: Abstraction has 88603 states and 587879 transitions. [2020-02-10 20:29:36,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:29:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 88603 states and 587879 transitions. [2020-02-10 20:29:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:29:36,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:36,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, 1, 1, 1] [2020-02-10 20:29:36,492 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:29:36,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:36,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2006703282, now seen corresponding path program 1 times [2020-02-10 20:29:36,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:36,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887219152] [2020-02-10 20:29:36,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:36,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887219152] [2020-02-10 20:29:36,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:36,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:29:36,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904699747] [2020-02-10 20:29:36,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:29:36,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:36,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:29:36,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:29:36,528 INFO L87 Difference]: Start difference. First operand 88603 states and 587879 transitions. Second operand 3 states. [2020-02-10 20:29:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:37,079 INFO L93 Difference]: Finished difference Result 76827 states and 490855 transitions. [2020-02-10 20:29:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:29:37,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:29:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:37,419 INFO L225 Difference]: With dead ends: 76827 [2020-02-10 20:29:37,419 INFO L226 Difference]: Without dead ends: 76827 [2020-02-10 20:29:37,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:29:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76827 states. [2020-02-10 20:29:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76827 to 76827. [2020-02-10 20:29:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76827 states. [2020-02-10 20:29:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76827 states to 76827 states and 490855 transitions. [2020-02-10 20:29:49,498 INFO L78 Accepts]: Start accepts. Automaton has 76827 states and 490855 transitions. Word has length 34 [2020-02-10 20:29:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:49,499 INFO L479 AbstractCegarLoop]: Abstraction has 76827 states and 490855 transitions. [2020-02-10 20:29:49,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:29:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 76827 states and 490855 transitions. [2020-02-10 20:29:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:29:49,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:49,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, 1, 1, 1] [2020-02-10 20:29:49,696 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:29:49,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:49,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1312454640, now seen corresponding path program 1 times [2020-02-10 20:29:49,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:49,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382421499] [2020-02-10 20:29:49,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:49,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382421499] [2020-02-10 20:29:49,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:49,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:29:49,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233417751] [2020-02-10 20:29:49,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:29:49,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:49,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:29:49,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:29:49,742 INFO L87 Difference]: Start difference. First operand 76827 states and 490855 transitions. Second operand 3 states. [2020-02-10 20:29:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:50,078 INFO L93 Difference]: Finished difference Result 46747 states and 286439 transitions. [2020-02-10 20:29:50,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:29:50,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:29:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:50,235 INFO L225 Difference]: With dead ends: 46747 [2020-02-10 20:29:50,236 INFO L226 Difference]: Without dead ends: 46747 [2020-02-10 20:29:50,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:29:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46747 states. [2020-02-10 20:29:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46747 to 46747. [2020-02-10 20:29:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46747 states. [2020-02-10 20:29:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46747 states to 46747 states and 286439 transitions. [2020-02-10 20:29:57,547 INFO L78 Accepts]: Start accepts. Automaton has 46747 states and 286439 transitions. Word has length 34 [2020-02-10 20:29:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:57,547 INFO L479 AbstractCegarLoop]: Abstraction has 46747 states and 286439 transitions. [2020-02-10 20:29:57,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:29:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 46747 states and 286439 transitions. [2020-02-10 20:29:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:29:57,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:57,642 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:57,642 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:29:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1656741828, now seen corresponding path program 1 times [2020-02-10 20:29:57,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:57,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344732418] [2020-02-10 20:29:57,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:57,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344732418] [2020-02-10 20:29:57,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:57,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:29:57,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119562249] [2020-02-10 20:29:57,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:29:57,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:57,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:29:57,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:29:57,678 INFO L87 Difference]: Start difference. First operand 46747 states and 286439 transitions. Second operand 3 states. [2020-02-10 20:29:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:58,369 INFO L93 Difference]: Finished difference Result 28571 states and 167207 transitions. [2020-02-10 20:29:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:29:58,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:29:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:58,501 INFO L225 Difference]: With dead ends: 28571 [2020-02-10 20:29:58,502 INFO L226 Difference]: Without dead ends: 28571 [2020-02-10 20:29:58,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:29:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28571 states. [2020-02-10 20:30:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28571 to 28571. [2020-02-10 20:30:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28571 states. [2020-02-10 20:30:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28571 states to 28571 states and 167207 transitions. [2020-02-10 20:30:00,104 INFO L78 Accepts]: Start accepts. Automaton has 28571 states and 167207 transitions. Word has length 34 [2020-02-10 20:30:00,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:00,104 INFO L479 AbstractCegarLoop]: Abstraction has 28571 states and 167207 transitions. [2020-02-10 20:30:00,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:30:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 28571 states and 167207 transitions. [2020-02-10 20:30:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:00,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:00,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, 1, 1, 1] [2020-02-10 20:30:00,760 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:00,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:00,761 INFO L82 PathProgramCache]: Analyzing trace with hash 654666270, now seen corresponding path program 1 times [2020-02-10 20:30:00,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:00,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378297701] [2020-02-10 20:30:00,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:00,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378297701] [2020-02-10 20:30:00,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:00,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:30:00,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55479792] [2020-02-10 20:30:00,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:30:00,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:00,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:30:00,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:30:00,820 INFO L87 Difference]: Start difference. First operand 28571 states and 167207 transitions. Second operand 3 states. [2020-02-10 20:30:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:00,971 INFO L93 Difference]: Finished difference Result 18139 states and 100871 transitions. [2020-02-10 20:30:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:30:00,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:30:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:01,023 INFO L225 Difference]: With dead ends: 18139 [2020-02-10 20:30:01,023 INFO L226 Difference]: Without dead ends: 18139 [2020-02-10 20:30:01,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:30:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18139 states. [2020-02-10 20:30:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18139 to 18139. [2020-02-10 20:30:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18139 states. [2020-02-10 20:30:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18139 states to 18139 states and 100871 transitions. [2020-02-10 20:30:02,108 INFO L78 Accepts]: Start accepts. Automaton has 18139 states and 100871 transitions. Word has length 34 [2020-02-10 20:30:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:02,108 INFO L479 AbstractCegarLoop]: Abstraction has 18139 states and 100871 transitions. [2020-02-10 20:30:02,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:30:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18139 states and 100871 transitions. [2020-02-10 20:30:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:02,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:02,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:02,142 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:02,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:02,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1250911260, now seen corresponding path program 1 times [2020-02-10 20:30:02,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:02,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783414246] [2020-02-10 20:30:02,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:02,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783414246] [2020-02-10 20:30:02,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:02,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:30:02,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779841316] [2020-02-10 20:30:02,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:30:02,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:02,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:30:02,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:30:02,184 INFO L87 Difference]: Start difference. First operand 18139 states and 100871 transitions. Second operand 3 states. [2020-02-10 20:30:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:02,269 INFO L93 Difference]: Finished difference Result 10215 states and 56299 transitions. [2020-02-10 20:30:02,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:30:02,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:30:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:02,299 INFO L225 Difference]: With dead ends: 10215 [2020-02-10 20:30:02,300 INFO L226 Difference]: Without dead ends: 10215 [2020-02-10 20:30:02,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:30:02,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states. [2020-02-10 20:30:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 10215. [2020-02-10 20:30:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10215 states. [2020-02-10 20:30:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10215 states to 10215 states and 56299 transitions. [2020-02-10 20:30:03,216 INFO L78 Accepts]: Start accepts. Automaton has 10215 states and 56299 transitions. Word has length 34 [2020-02-10 20:30:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:03,217 INFO L479 AbstractCegarLoop]: Abstraction has 10215 states and 56299 transitions. [2020-02-10 20:30:03,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:30:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10215 states and 56299 transitions. [2020-02-10 20:30:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:03,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:03,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, 1, 1, 1] [2020-02-10 20:30:03,237 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:03,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:03,238 INFO L82 PathProgramCache]: Analyzing trace with hash -953380640, now seen corresponding path program 1 times [2020-02-10 20:30:03,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:03,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550610244] [2020-02-10 20:30:03,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:03,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550610244] [2020-02-10 20:30:03,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:03,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:30:03,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970091394] [2020-02-10 20:30:03,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:30:03,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:03,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:30:03,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:30:03,263 INFO L87 Difference]: Start difference. First operand 10215 states and 56299 transitions. Second operand 3 states. [2020-02-10 20:30:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:03,312 INFO L93 Difference]: Finished difference Result 6143 states and 33793 transitions. [2020-02-10 20:30:03,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:30:03,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-02-10 20:30:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:03,330 INFO L225 Difference]: With dead ends: 6143 [2020-02-10 20:30:03,331 INFO L226 Difference]: Without dead ends: 6143 [2020-02-10 20:30:03,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:30:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2020-02-10 20:30:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 6143. [2020-02-10 20:30:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6143 states. [2020-02-10 20:30:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6143 states to 6143 states and 33793 transitions. [2020-02-10 20:30:03,858 INFO L78 Accepts]: Start accepts. Automaton has 6143 states and 33793 transitions. Word has length 34 [2020-02-10 20:30:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:03,858 INFO L479 AbstractCegarLoop]: Abstraction has 6143 states and 33793 transitions. [2020-02-10 20:30:03,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:30:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 6143 states and 33793 transitions. [2020-02-10 20:30:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:03,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:03,872 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:03,873 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1707014504, now seen corresponding path program 1 times [2020-02-10 20:30:03,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:03,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472631527] [2020-02-10 20:30:03,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:04,591 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2020-02-10 20:30:04,756 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:30:04,949 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:30:05,121 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:30:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:05,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472631527] [2020-02-10 20:30:05,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:05,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:05,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114123007] [2020-02-10 20:30:05,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:05,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:05,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:05,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:05,141 INFO L87 Difference]: Start difference. First operand 6143 states and 33793 transitions. Second operand 13 states. [2020-02-10 20:30:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:05,499 INFO L93 Difference]: Finished difference Result 11891 states and 58611 transitions. [2020-02-10 20:30:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:05,500 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:05,529 INFO L225 Difference]: With dead ends: 11891 [2020-02-10 20:30:05,529 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 20:30:05,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 20:30:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6225. [2020-02-10 20:30:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:30:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34181 transitions. [2020-02-10 20:30:06,347 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34181 transitions. Word has length 34 [2020-02-10 20:30:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:06,348 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34181 transitions. [2020-02-10 20:30:06,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:06,348 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34181 transitions. [2020-02-10 20:30:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:06,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:06,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, 1, 1, 1] [2020-02-10 20:30:06,364 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:06,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:06,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1070547650, now seen corresponding path program 2 times [2020-02-10 20:30:06,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:06,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177383558] [2020-02-10 20:30:06,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:07,107 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:30:07,278 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:30:07,446 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:30:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:07,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177383558] [2020-02-10 20:30:07,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:07,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:07,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172751252] [2020-02-10 20:30:07,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:07,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:07,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:07,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:07,464 INFO L87 Difference]: Start difference. First operand 6225 states and 34181 transitions. Second operand 13 states. [2020-02-10 20:30:07,821 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 20:30:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:07,850 INFO L93 Difference]: Finished difference Result 11889 states and 58597 transitions. [2020-02-10 20:30:07,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:07,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:07,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:07,881 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 20:30:07,881 INFO L226 Difference]: Without dead ends: 11855 [2020-02-10 20:30:07,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2020-02-10 20:30:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 6213. [2020-02-10 20:30:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:30:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34151 transitions. [2020-02-10 20:30:08,528 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34151 transitions. Word has length 34 [2020-02-10 20:30:08,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:08,528 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34151 transitions. [2020-02-10 20:30:08,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34151 transitions. [2020-02-10 20:30:08,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:08,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:08,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:08,540 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:08,540 INFO L82 PathProgramCache]: Analyzing trace with hash -824698088, now seen corresponding path program 3 times [2020-02-10 20:30:08,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:08,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478393937] [2020-02-10 20:30:08,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:09,157 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:30:09,343 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:30:09,516 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:30:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:09,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478393937] [2020-02-10 20:30:09,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:09,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:09,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569000313] [2020-02-10 20:30:09,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:09,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:09,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:09,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:09,532 INFO L87 Difference]: Start difference. First operand 6213 states and 34151 transitions. Second operand 13 states. [2020-02-10 20:30:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:09,968 INFO L93 Difference]: Finished difference Result 11879 states and 58577 transitions. [2020-02-10 20:30:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:09,969 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:10,009 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 20:30:10,010 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 20:30:10,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 20:30:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6221. [2020-02-10 20:30:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:30:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34166 transitions. [2020-02-10 20:30:10,739 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34166 transitions. Word has length 34 [2020-02-10 20:30:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:10,740 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34166 transitions. [2020-02-10 20:30:10,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34166 transitions. [2020-02-10 20:30:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:10,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:10,751 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:10,751 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:10,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:10,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1809634372, now seen corresponding path program 4 times [2020-02-10 20:30:10,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:10,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072431459] [2020-02-10 20:30:10,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:11,559 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:30:11,709 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:30:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:11,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072431459] [2020-02-10 20:30:11,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:11,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:11,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266654806] [2020-02-10 20:30:11,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:11,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:11,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:11,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:11,722 INFO L87 Difference]: Start difference. First operand 6221 states and 34166 transitions. Second operand 13 states. [2020-02-10 20:30:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:12,045 INFO L93 Difference]: Finished difference Result 11884 states and 58579 transitions. [2020-02-10 20:30:12,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:12,045 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:12,074 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 20:30:12,075 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:30:12,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:30:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6213. [2020-02-10 20:30:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:30:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34143 transitions. [2020-02-10 20:30:12,689 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34143 transitions. Word has length 34 [2020-02-10 20:30:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:12,689 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34143 transitions. [2020-02-10 20:30:12,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34143 transitions. [2020-02-10 20:30:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:12,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:12,700 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:12,701 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:12,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:12,701 INFO L82 PathProgramCache]: Analyzing trace with hash 919665918, now seen corresponding path program 5 times [2020-02-10 20:30:12,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:12,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814968263] [2020-02-10 20:30:12,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:13,505 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:30:13,671 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:30:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:13,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814968263] [2020-02-10 20:30:13,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:13,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:13,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482618832] [2020-02-10 20:30:13,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:13,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:13,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:13,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:13,687 INFO L87 Difference]: Start difference. First operand 6213 states and 34143 transitions. Second operand 13 states. [2020-02-10 20:30:14,123 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 20:30:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:14,149 INFO L93 Difference]: Finished difference Result 11876 states and 58564 transitions. [2020-02-10 20:30:14,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:14,149 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:14,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:14,180 INFO L225 Difference]: With dead ends: 11876 [2020-02-10 20:30:14,180 INFO L226 Difference]: Without dead ends: 11857 [2020-02-10 20:30:14,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:14,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2020-02-10 20:30:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 6220. [2020-02-10 20:30:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:30:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34156 transitions. [2020-02-10 20:30:14,788 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34156 transitions. Word has length 34 [2020-02-10 20:30:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:14,789 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34156 transitions. [2020-02-10 20:30:14,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34156 transitions. [2020-02-10 20:30:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:14,800 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:14,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, 1, 1, 1] [2020-02-10 20:30:14,800 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:14,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:14,800 INFO L82 PathProgramCache]: Analyzing trace with hash 711203164, now seen corresponding path program 6 times [2020-02-10 20:30:14,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:14,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514135758] [2020-02-10 20:30:14,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:15,591 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:30:15,785 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:30:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:15,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514135758] [2020-02-10 20:30:15,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:15,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:15,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672978260] [2020-02-10 20:30:15,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:15,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:15,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:15,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:15,808 INFO L87 Difference]: Start difference. First operand 6220 states and 34156 transitions. Second operand 13 states. [2020-02-10 20:30:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:16,263 INFO L93 Difference]: Finished difference Result 11879 states and 58563 transitions. [2020-02-10 20:30:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:16,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:16,297 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 20:30:16,297 INFO L226 Difference]: Without dead ends: 11841 [2020-02-10 20:30:16,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-02-10 20:30:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 6204. [2020-02-10 20:30:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 20:30:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34119 transitions. [2020-02-10 20:30:16,921 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34119 transitions. Word has length 34 [2020-02-10 20:30:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:16,921 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34119 transitions. [2020-02-10 20:30:16,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34119 transitions. [2020-02-10 20:30:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:16,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:16,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, 1, 1, 1] [2020-02-10 20:30:16,932 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:16,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash 2028412534, now seen corresponding path program 7 times [2020-02-10 20:30:16,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:16,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748427196] [2020-02-10 20:30:16,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:17,564 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:30:17,848 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:30:18,027 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:30:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:18,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748427196] [2020-02-10 20:30:18,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:18,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:18,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313806695] [2020-02-10 20:30:18,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:18,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:18,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:18,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:18,043 INFO L87 Difference]: Start difference. First operand 6204 states and 34119 transitions. Second operand 13 states. [2020-02-10 20:30:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:18,304 INFO L93 Difference]: Finished difference Result 11900 states and 58627 transitions. [2020-02-10 20:30:18,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:18,304 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:18,332 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 20:30:18,332 INFO L226 Difference]: Without dead ends: 11876 [2020-02-10 20:30:18,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:18,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11876 states. [2020-02-10 20:30:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11876 to 6228. [2020-02-10 20:30:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 20:30:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34181 transitions. [2020-02-10 20:30:18,943 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34181 transitions. Word has length 34 [2020-02-10 20:30:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:18,944 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34181 transitions. [2020-02-10 20:30:18,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34181 transitions. [2020-02-10 20:30:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:18,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:18,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, 1, 1, 1] [2020-02-10 20:30:18,955 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:18,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:18,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1391945680, now seen corresponding path program 8 times [2020-02-10 20:30:18,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:18,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347223325] [2020-02-10 20:30:18,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:19,582 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:30:19,732 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:30:19,899 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:30:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:19,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347223325] [2020-02-10 20:30:19,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:19,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:19,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797764263] [2020-02-10 20:30:19,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:19,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:19,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:19,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:19,911 INFO L87 Difference]: Start difference. First operand 6228 states and 34181 transitions. Second operand 13 states. [2020-02-10 20:30:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:20,242 INFO L93 Difference]: Finished difference Result 11898 states and 58613 transitions. [2020-02-10 20:30:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:20,243 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:20,272 INFO L225 Difference]: With dead ends: 11898 [2020-02-10 20:30:20,272 INFO L226 Difference]: Without dead ends: 11864 [2020-02-10 20:30:20,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11864 states. [2020-02-10 20:30:20,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11864 to 6216. [2020-02-10 20:30:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:30:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34149 transitions. [2020-02-10 20:30:20,885 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34149 transitions. Word has length 34 [2020-02-10 20:30:20,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:20,885 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34149 transitions. [2020-02-10 20:30:20,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34149 transitions. [2020-02-10 20:30:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:20,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:20,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:20,897 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1338535332, now seen corresponding path program 9 times [2020-02-10 20:30:20,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:20,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158138266] [2020-02-10 20:30:20,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:21,254 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-02-10 20:30:21,740 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:30:21,911 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:30:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:21,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158138266] [2020-02-10 20:30:21,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:21,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:21,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123221890] [2020-02-10 20:30:21,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:21,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:21,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:21,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:21,925 INFO L87 Difference]: Start difference. First operand 6216 states and 34149 transitions. Second operand 13 states. [2020-02-10 20:30:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:22,203 INFO L93 Difference]: Finished difference Result 11897 states and 58610 transitions. [2020-02-10 20:30:22,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:22,204 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:22,235 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 20:30:22,236 INFO L226 Difference]: Without dead ends: 11873 [2020-02-10 20:30:22,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:22,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11873 states. [2020-02-10 20:30:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11873 to 6226. [2020-02-10 20:30:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6226 states. [2020-02-10 20:30:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6226 states to 6226 states and 34167 transitions. [2020-02-10 20:30:22,848 INFO L78 Accepts]: Start accepts. Automaton has 6226 states and 34167 transitions. Word has length 34 [2020-02-10 20:30:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:22,848 INFO L479 AbstractCegarLoop]: Abstraction has 6226 states and 34167 transitions. [2020-02-10 20:30:22,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 6226 states and 34167 transitions. [2020-02-10 20:30:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:22,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:22,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, 1, 1, 1] [2020-02-10 20:30:22,859 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:22,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1259187020, now seen corresponding path program 10 times [2020-02-10 20:30:22,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:22,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007666278] [2020-02-10 20:30:22,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:23,655 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:30:23,804 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:30:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:23,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007666278] [2020-02-10 20:30:23,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:23,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:23,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571556986] [2020-02-10 20:30:23,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:23,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:23,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:23,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:23,817 INFO L87 Difference]: Start difference. First operand 6226 states and 34167 transitions. Second operand 13 states. [2020-02-10 20:30:24,115 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 20:30:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:24,144 INFO L93 Difference]: Finished difference Result 11894 states and 58595 transitions. [2020-02-10 20:30:24,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:24,145 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:24,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:24,174 INFO L225 Difference]: With dead ends: 11894 [2020-02-10 20:30:24,175 INFO L226 Difference]: Without dead ends: 11863 [2020-02-10 20:30:24,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11863 states. [2020-02-10 20:30:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11863 to 6216. [2020-02-10 20:30:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:30:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34139 transitions. [2020-02-10 20:30:24,790 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34139 transitions. Word has length 34 [2020-02-10 20:30:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:24,790 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34139 transitions. [2020-02-10 20:30:24,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34139 transitions. [2020-02-10 20:30:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:24,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:24,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, 1, 1, 1] [2020-02-10 20:30:24,897 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:24,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash -230638180, now seen corresponding path program 11 times [2020-02-10 20:30:24,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:24,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677836251] [2020-02-10 20:30:24,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:25,488 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:30:25,634 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:30:25,787 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:30:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:25,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677836251] [2020-02-10 20:30:25,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:25,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:25,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356991374] [2020-02-10 20:30:25,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:25,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:25,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:25,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:25,799 INFO L87 Difference]: Start difference. First operand 6216 states and 34139 transitions. Second operand 13 states. [2020-02-10 20:30:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:26,111 INFO L93 Difference]: Finished difference Result 11892 states and 58592 transitions. [2020-02-10 20:30:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:26,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:26,143 INFO L225 Difference]: With dead ends: 11892 [2020-02-10 20:30:26,143 INFO L226 Difference]: Without dead ends: 11870 [2020-02-10 20:30:26,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2020-02-10 20:30:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 6225. [2020-02-10 20:30:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:30:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34156 transitions. [2020-02-10 20:30:26,754 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34156 transitions. Word has length 34 [2020-02-10 20:30:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:26,754 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34156 transitions. [2020-02-10 20:30:26,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34156 transitions. [2020-02-10 20:30:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:26,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:26,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:26,766 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:26,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1291416270, now seen corresponding path program 12 times [2020-02-10 20:30:26,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:26,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213189421] [2020-02-10 20:30:26,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:27,225 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2020-02-10 20:30:27,349 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:30:27,501 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:30:27,647 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:30:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:27,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213189421] [2020-02-10 20:30:27,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:27,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:27,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741061392] [2020-02-10 20:30:27,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:27,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:27,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:27,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:27,660 INFO L87 Difference]: Start difference. First operand 6225 states and 34156 transitions. Second operand 13 states. [2020-02-10 20:30:28,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:28,085 INFO L93 Difference]: Finished difference Result 11891 states and 58581 transitions. [2020-02-10 20:30:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:28,089 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:28,120 INFO L225 Difference]: With dead ends: 11891 [2020-02-10 20:30:28,120 INFO L226 Difference]: Without dead ends: 11849 [2020-02-10 20:30:28,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2020-02-10 20:30:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 6204. [2020-02-10 20:30:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 20:30:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34109 transitions. [2020-02-10 20:30:28,839 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34109 transitions. Word has length 34 [2020-02-10 20:30:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:28,839 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34109 transitions. [2020-02-10 20:30:28,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34109 transitions. [2020-02-10 20:30:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:28,850 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:28,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, 1, 1, 1] [2020-02-10 20:30:28,850 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:28,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:28,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2120866830, now seen corresponding path program 13 times [2020-02-10 20:30:28,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:28,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693561330] [2020-02-10 20:30:28,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:29,406 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:30:29,565 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:30:29,720 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:30:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:29,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693561330] [2020-02-10 20:30:29,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:29,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:29,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233989239] [2020-02-10 20:30:29,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:29,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:29,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:29,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:29,733 INFO L87 Difference]: Start difference. First operand 6204 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:30:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:30,051 INFO L93 Difference]: Finished difference Result 11875 states and 58559 transitions. [2020-02-10 20:30:30,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:30,052 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:30,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:30,081 INFO L225 Difference]: With dead ends: 11875 [2020-02-10 20:30:30,081 INFO L226 Difference]: Without dead ends: 11856 [2020-02-10 20:30:30,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11856 states. [2020-02-10 20:30:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11856 to 6220. [2020-02-10 20:30:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:30:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34154 transitions. [2020-02-10 20:30:30,690 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34154 transitions. Word has length 34 [2020-02-10 20:30:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:30,691 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34154 transitions. [2020-02-10 20:30:30,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34154 transitions. [2020-02-10 20:30:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:30,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:30,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:30,702 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:30,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1189164182, now seen corresponding path program 14 times [2020-02-10 20:30:30,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:30,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704640063] [2020-02-10 20:30:30,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:31,265 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:30:31,413 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:30:31,563 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:30:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:31,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704640063] [2020-02-10 20:30:31,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:31,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:31,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8558305] [2020-02-10 20:30:31,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:31,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:31,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:31,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:31,575 INFO L87 Difference]: Start difference. First operand 6220 states and 34154 transitions. Second operand 13 states. [2020-02-10 20:30:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:31,865 INFO L93 Difference]: Finished difference Result 11880 states and 58561 transitions. [2020-02-10 20:30:31,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:31,866 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:31,896 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 20:30:31,896 INFO L226 Difference]: Without dead ends: 11848 [2020-02-10 20:30:31,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2020-02-10 20:30:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 6212. [2020-02-10 20:30:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:30:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34131 transitions. [2020-02-10 20:30:32,598 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34131 transitions. Word has length 34 [2020-02-10 20:30:32,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:32,598 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34131 transitions. [2020-02-10 20:30:32,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34131 transitions. [2020-02-10 20:30:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:32,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:32,610 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:32,610 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:32,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1099114754, now seen corresponding path program 15 times [2020-02-10 20:30:32,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:32,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968519835] [2020-02-10 20:30:32,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:33,321 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:30:33,474 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:30:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:33,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968519835] [2020-02-10 20:30:33,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:33,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:33,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396230438] [2020-02-10 20:30:33,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:33,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:33,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:33,487 INFO L87 Difference]: Start difference. First operand 6212 states and 34131 transitions. Second operand 13 states. [2020-02-10 20:30:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:33,836 INFO L93 Difference]: Finished difference Result 11871 states and 58544 transitions. [2020-02-10 20:30:33,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:33,837 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:33,866 INFO L225 Difference]: With dead ends: 11871 [2020-02-10 20:30:33,867 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:30:33,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:30:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6219. [2020-02-10 20:30:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:30:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34144 transitions. [2020-02-10 20:30:34,477 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34144 transitions. Word has length 34 [2020-02-10 20:30:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:34,477 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34144 transitions. [2020-02-10 20:30:34,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34144 transitions. [2020-02-10 20:30:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:34,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:34,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:34,488 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:34,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1779692234, now seen corresponding path program 16 times [2020-02-10 20:30:34,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:34,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978917510] [2020-02-10 20:30:34,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:35,269 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:30:35,422 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:30:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:35,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978917510] [2020-02-10 20:30:35,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:35,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:35,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011866601] [2020-02-10 20:30:35,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:35,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:35,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:35,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:35,434 INFO L87 Difference]: Start difference. First operand 6219 states and 34144 transitions. Second operand 13 states. [2020-02-10 20:30:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:35,787 INFO L93 Difference]: Finished difference Result 11873 states and 58541 transitions. [2020-02-10 20:30:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:35,788 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:35,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:35,822 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 20:30:35,822 INFO L226 Difference]: Without dead ends: 11845 [2020-02-10 20:30:35,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2020-02-10 20:30:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 6212. [2020-02-10 20:30:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:30:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34124 transitions. [2020-02-10 20:30:36,523 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34124 transitions. Word has length 34 [2020-02-10 20:30:36,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:36,524 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34124 transitions. [2020-02-10 20:30:36,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34124 transitions. [2020-02-10 20:30:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:36,535 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:36,535 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:36,535 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2140460770, now seen corresponding path program 17 times [2020-02-10 20:30:36,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:36,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698840158] [2020-02-10 20:30:36,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:37,096 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:30:37,245 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:30:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:37,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698840158] [2020-02-10 20:30:37,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:37,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:37,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423632842] [2020-02-10 20:30:37,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:37,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:37,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:37,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:37,388 INFO L87 Difference]: Start difference. First operand 6212 states and 34124 transitions. Second operand 13 states. [2020-02-10 20:30:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:37,723 INFO L93 Difference]: Finished difference Result 11884 states and 58563 transitions. [2020-02-10 20:30:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:37,723 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:37,752 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 20:30:37,753 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 20:30:37,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:38,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 20:30:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6222. [2020-02-10 20:30:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:30:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34142 transitions. [2020-02-10 20:30:38,363 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34142 transitions. Word has length 34 [2020-02-10 20:30:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:38,363 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34142 transitions. [2020-02-10 20:30:38,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34142 transitions. [2020-02-10 20:30:38,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:38,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:38,374 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:38,374 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:38,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:38,374 INFO L82 PathProgramCache]: Analyzing trace with hash 887244786, now seen corresponding path program 18 times [2020-02-10 20:30:38,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:38,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942097840] [2020-02-10 20:30:38,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:38,967 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:30:39,112 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:30:39,259 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:30:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:39,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942097840] [2020-02-10 20:30:39,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:39,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:39,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838332074] [2020-02-10 20:30:39,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:39,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:39,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:39,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:39,272 INFO L87 Difference]: Start difference. First operand 6222 states and 34142 transitions. Second operand 13 states. [2020-02-10 20:30:39,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:39,602 INFO L93 Difference]: Finished difference Result 11881 states and 58548 transitions. [2020-02-10 20:30:39,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:39,602 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:39,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:39,631 INFO L225 Difference]: With dead ends: 11881 [2020-02-10 20:30:39,631 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 20:30:39,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 20:30:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6204. [2020-02-10 20:30:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 20:30:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34101 transitions. [2020-02-10 20:30:40,333 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34101 transitions. Word has length 34 [2020-02-10 20:30:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:40,333 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34101 transitions. [2020-02-10 20:30:40,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34101 transitions. [2020-02-10 20:30:40,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:40,345 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:40,345 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:40,345 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:40,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2135793486, now seen corresponding path program 19 times [2020-02-10 20:30:40,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:40,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999121739] [2020-02-10 20:30:40,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:41,036 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:30:41,188 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:30:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:41,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999121739] [2020-02-10 20:30:41,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:41,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:41,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224989026] [2020-02-10 20:30:41,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:41,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:41,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:41,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:41,200 INFO L87 Difference]: Start difference. First operand 6204 states and 34101 transitions. Second operand 13 states. [2020-02-10 20:30:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:41,521 INFO L93 Difference]: Finished difference Result 11867 states and 58536 transitions. [2020-02-10 20:30:41,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:41,522 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:41,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:41,551 INFO L225 Difference]: With dead ends: 11867 [2020-02-10 20:30:41,551 INFO L226 Difference]: Without dead ends: 11848 [2020-02-10 20:30:41,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2020-02-10 20:30:42,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 6218. [2020-02-10 20:30:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:30:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34141 transitions. [2020-02-10 20:30:42,162 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34141 transitions. Word has length 34 [2020-02-10 20:30:42,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:42,163 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34141 transitions. [2020-02-10 20:30:42,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34141 transitions. [2020-02-10 20:30:42,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:42,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:42,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, 1, 1, 1] [2020-02-10 20:30:42,174 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:42,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:42,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1950711056, now seen corresponding path program 20 times [2020-02-10 20:30:42,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:42,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434310822] [2020-02-10 20:30:42,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:42,895 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:30:43,043 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:30:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:43,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434310822] [2020-02-10 20:30:43,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:43,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:43,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608704817] [2020-02-10 20:30:43,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:43,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:43,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:43,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:43,055 INFO L87 Difference]: Start difference. First operand 6218 states and 34141 transitions. Second operand 13 states. [2020-02-10 20:30:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:43,410 INFO L93 Difference]: Finished difference Result 11870 states and 58535 transitions. [2020-02-10 20:30:43,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:43,410 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:43,440 INFO L225 Difference]: With dead ends: 11870 [2020-02-10 20:30:43,440 INFO L226 Difference]: Without dead ends: 11841 [2020-02-10 20:30:43,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-02-10 20:30:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 6211. [2020-02-10 20:30:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:30:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34121 transitions. [2020-02-10 20:30:44,142 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34121 transitions. Word has length 34 [2020-02-10 20:30:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:44,142 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34121 transitions. [2020-02-10 20:30:44,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34121 transitions. [2020-02-10 20:30:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:44,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:44,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:44,154 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:44,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:44,154 INFO L82 PathProgramCache]: Analyzing trace with hash -660175908, now seen corresponding path program 21 times [2020-02-10 20:30:44,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:44,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899113428] [2020-02-10 20:30:44,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:44,824 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:30:44,973 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:30:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:44,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899113428] [2020-02-10 20:30:44,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:44,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:44,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867560615] [2020-02-10 20:30:44,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:44,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:44,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:44,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:44,986 INFO L87 Difference]: Start difference. First operand 6211 states and 34121 transitions. Second operand 13 states. [2020-02-10 20:30:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:45,332 INFO L93 Difference]: Finished difference Result 11866 states and 58527 transitions. [2020-02-10 20:30:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:45,333 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:45,362 INFO L225 Difference]: With dead ends: 11866 [2020-02-10 20:30:45,362 INFO L226 Difference]: Without dead ends: 11847 [2020-02-10 20:30:45,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11847 states. [2020-02-10 20:30:45,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11847 to 6218. [2020-02-10 20:30:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:30:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34134 transitions. [2020-02-10 20:30:45,974 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34134 transitions. Word has length 34 [2020-02-10 20:30:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:45,975 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34134 transitions. [2020-02-10 20:30:45,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:45,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34134 transitions. [2020-02-10 20:30:45,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:45,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:45,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, 1, 1, 1] [2020-02-10 20:30:45,986 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:45,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:45,986 INFO L82 PathProgramCache]: Analyzing trace with hash 755984400, now seen corresponding path program 22 times [2020-02-10 20:30:45,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:45,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058750503] [2020-02-10 20:30:45,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:46,873 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:30:47,076 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:30:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:47,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058750503] [2020-02-10 20:30:47,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:47,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:47,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799766082] [2020-02-10 20:30:47,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:47,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:47,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:47,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:47,092 INFO L87 Difference]: Start difference. First operand 6218 states and 34134 transitions. Second operand 13 states. [2020-02-10 20:30:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:47,529 INFO L93 Difference]: Finished difference Result 11868 states and 58524 transitions. [2020-02-10 20:30:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:47,530 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:47,559 INFO L225 Difference]: With dead ends: 11868 [2020-02-10 20:30:47,559 INFO L226 Difference]: Without dead ends: 11840 [2020-02-10 20:30:47,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11840 states. [2020-02-10 20:30:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11840 to 6211. [2020-02-10 20:30:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:30:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34114 transitions. [2020-02-10 20:30:48,259 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34114 transitions. Word has length 34 [2020-02-10 20:30:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:48,259 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34114 transitions. [2020-02-10 20:30:48,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34114 transitions. [2020-02-10 20:30:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:48,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:48,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:48,270 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:48,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1392959652, now seen corresponding path program 23 times [2020-02-10 20:30:48,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:48,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812007184] [2020-02-10 20:30:48,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:48,863 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:30:49,013 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:30:49,166 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:30:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:49,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812007184] [2020-02-10 20:30:49,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:49,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:49,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859558630] [2020-02-10 20:30:49,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:49,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:49,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:49,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:49,179 INFO L87 Difference]: Start difference. First operand 6211 states and 34114 transitions. Second operand 13 states. [2020-02-10 20:30:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:49,579 INFO L93 Difference]: Finished difference Result 11874 states and 58538 transitions. [2020-02-10 20:30:49,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:49,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:49,608 INFO L225 Difference]: With dead ends: 11874 [2020-02-10 20:30:49,608 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:30:49,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:30:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6220. [2020-02-10 20:30:50,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:30:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34131 transitions. [2020-02-10 20:30:50,218 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34131 transitions. Word has length 34 [2020-02-10 20:30:50,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:50,219 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34131 transitions. [2020-02-10 20:30:50,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34131 transitions. [2020-02-10 20:30:50,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:50,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:50,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, 1, 1, 1] [2020-02-10 20:30:50,230 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:50,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:50,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1411393678, now seen corresponding path program 24 times [2020-02-10 20:30:50,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:50,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883090766] [2020-02-10 20:30:50,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:51,030 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:30:51,174 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:30:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:51,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883090766] [2020-02-10 20:30:51,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:51,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:51,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412121138] [2020-02-10 20:30:51,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:51,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:51,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:51,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:51,187 INFO L87 Difference]: Start difference. First operand 6220 states and 34131 transitions. Second operand 13 states. [2020-02-10 20:30:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:51,541 INFO L93 Difference]: Finished difference Result 11873 states and 58527 transitions. [2020-02-10 20:30:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:51,542 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:51,571 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 20:30:51,571 INFO L226 Difference]: Without dead ends: 11826 [2020-02-10 20:30:51,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2020-02-10 20:30:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 6194. [2020-02-10 20:30:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6194 states. [2020-02-10 20:30:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 34076 transitions. [2020-02-10 20:30:52,267 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 34076 transitions. Word has length 34 [2020-02-10 20:30:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:52,268 INFO L479 AbstractCegarLoop]: Abstraction has 6194 states and 34076 transitions. [2020-02-10 20:30:52,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 34076 transitions. [2020-02-10 20:30:52,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:52,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:52,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, 1, 1, 1] [2020-02-10 20:30:52,279 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:52,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:52,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1529260104, now seen corresponding path program 25 times [2020-02-10 20:30:52,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:52,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307555139] [2020-02-10 20:30:52,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:52,889 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:30:53,033 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:30:53,183 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:30:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:53,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307555139] [2020-02-10 20:30:53,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:53,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:53,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85422177] [2020-02-10 20:30:53,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:53,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:53,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:53,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:53,195 INFO L87 Difference]: Start difference. First operand 6194 states and 34076 transitions. Second operand 13 states. [2020-02-10 20:30:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:53,529 INFO L93 Difference]: Finished difference Result 11873 states and 58547 transitions. [2020-02-10 20:30:53,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:53,530 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:53,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:53,560 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 20:30:53,560 INFO L226 Difference]: Without dead ends: 11849 [2020-02-10 20:30:53,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:54,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2020-02-10 20:30:54,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 6223. [2020-02-10 20:30:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:30:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34165 transitions. [2020-02-10 20:30:54,184 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34165 transitions. Word has length 34 [2020-02-10 20:30:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:54,185 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34165 transitions. [2020-02-10 20:30:54,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34165 transitions. [2020-02-10 20:30:54,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:54,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:54,195 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:54,195 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:54,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:54,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2129240338, now seen corresponding path program 26 times [2020-02-10 20:30:54,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:54,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203680596] [2020-02-10 20:30:54,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:54,774 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:30:54,933 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:30:55,097 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:30:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:55,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203680596] [2020-02-10 20:30:55,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:55,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:55,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788648428] [2020-02-10 20:30:55,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:55,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:55,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:55,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:55,110 INFO L87 Difference]: Start difference. First operand 6223 states and 34165 transitions. Second operand 13 states. [2020-02-10 20:30:55,585 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 20:30:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:55,614 INFO L93 Difference]: Finished difference Result 11871 states and 58533 transitions. [2020-02-10 20:30:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:55,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:55,644 INFO L225 Difference]: With dead ends: 11871 [2020-02-10 20:30:55,644 INFO L226 Difference]: Without dead ends: 11837 [2020-02-10 20:30:55,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2020-02-10 20:30:56,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 6211. [2020-02-10 20:30:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:30:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34135 transitions. [2020-02-10 20:30:56,339 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34135 transitions. Word has length 34 [2020-02-10 20:30:56,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:56,340 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34135 transitions. [2020-02-10 20:30:56,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34135 transitions. [2020-02-10 20:30:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:56,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:56,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, 1, 1, 1] [2020-02-10 20:30:56,351 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:56,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:56,351 INFO L82 PathProgramCache]: Analyzing trace with hash 233994600, now seen corresponding path program 27 times [2020-02-10 20:30:56,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:56,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70169522] [2020-02-10 20:30:56,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:56,926 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:30:57,074 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:30:57,222 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:30:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:57,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70169522] [2020-02-10 20:30:57,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:57,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:57,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515594211] [2020-02-10 20:30:57,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:57,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:57,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:57,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:57,235 INFO L87 Difference]: Start difference. First operand 6211 states and 34135 transitions. Second operand 13 states. [2020-02-10 20:30:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:57,735 INFO L93 Difference]: Finished difference Result 11861 states and 58513 transitions. [2020-02-10 20:30:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:57,735 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:57,764 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 20:30:57,765 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 20:30:57,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:30:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 20:30:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6219. [2020-02-10 20:30:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:30:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34150 transitions. [2020-02-10 20:30:58,381 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34150 transitions. Word has length 34 [2020-02-10 20:30:58,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:58,381 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34150 transitions. [2020-02-10 20:30:58,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:30:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34150 transitions. [2020-02-10 20:30:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:30:58,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:58,393 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:58,393 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:30:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash -750941684, now seen corresponding path program 28 times [2020-02-10 20:30:58,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:58,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117019427] [2020-02-10 20:30:58,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:58,963 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:30:59,138 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:30:59,289 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:30:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:59,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117019427] [2020-02-10 20:30:59,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:59,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:30:59,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166639248] [2020-02-10 20:30:59,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:30:59,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:59,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:30:59,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:59,301 INFO L87 Difference]: Start difference. First operand 6219 states and 34150 transitions. Second operand 13 states. [2020-02-10 20:30:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:59,673 INFO L93 Difference]: Finished difference Result 11866 states and 58515 transitions. [2020-02-10 20:30:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:30:59,674 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:30:59,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:59,703 INFO L225 Difference]: With dead ends: 11866 [2020-02-10 20:30:59,703 INFO L226 Difference]: Without dead ends: 11834 [2020-02-10 20:30:59,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:00,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11834 states. [2020-02-10 20:31:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11834 to 6211. [2020-02-10 20:31:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:31:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34127 transitions. [2020-02-10 20:31:00,400 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34127 transitions. Word has length 34 [2020-02-10 20:31:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:00,400 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34127 transitions. [2020-02-10 20:31:00,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34127 transitions. [2020-02-10 20:31:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:00,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:00,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:00,411 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:00,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:00,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1978358606, now seen corresponding path program 29 times [2020-02-10 20:31:00,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:00,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715857970] [2020-02-10 20:31:00,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:00,973 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-02-10 20:31:01,116 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:31:01,267 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:01,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715857970] [2020-02-10 20:31:01,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:01,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:01,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396079186] [2020-02-10 20:31:01,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:01,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:01,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:01,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:01,279 INFO L87 Difference]: Start difference. First operand 6211 states and 34127 transitions. Second operand 13 states. [2020-02-10 20:31:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:01,585 INFO L93 Difference]: Finished difference Result 11858 states and 58500 transitions. [2020-02-10 20:31:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:01,586 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:01,616 INFO L225 Difference]: With dead ends: 11858 [2020-02-10 20:31:01,616 INFO L226 Difference]: Without dead ends: 11839 [2020-02-10 20:31:01,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:02,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11839 states. [2020-02-10 20:31:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11839 to 6218. [2020-02-10 20:31:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:31:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34140 transitions. [2020-02-10 20:31:02,240 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34140 transitions. Word has length 34 [2020-02-10 20:31:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:02,240 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34140 transitions. [2020-02-10 20:31:02,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34140 transitions. [2020-02-10 20:31:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:02,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:02,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, 1, 1, 1] [2020-02-10 20:31:02,251 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:02,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:02,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1769895852, now seen corresponding path program 30 times [2020-02-10 20:31:02,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:02,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577492895] [2020-02-10 20:31:02,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:02,938 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:31:03,092 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:03,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577492895] [2020-02-10 20:31:03,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:03,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:03,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737751322] [2020-02-10 20:31:03,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:03,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:03,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:03,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:03,105 INFO L87 Difference]: Start difference. First operand 6218 states and 34140 transitions. Second operand 13 states. [2020-02-10 20:31:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:03,400 INFO L93 Difference]: Finished difference Result 11861 states and 58499 transitions. [2020-02-10 20:31:03,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:03,401 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:03,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:03,430 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 20:31:03,430 INFO L226 Difference]: Without dead ends: 11823 [2020-02-10 20:31:03,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11823 states. [2020-02-10 20:31:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11823 to 6202. [2020-02-10 20:31:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6202 states. [2020-02-10 20:31:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6202 states to 6202 states and 34104 transitions. [2020-02-10 20:31:04,142 INFO L78 Accepts]: Start accepts. Automaton has 6202 states and 34104 transitions. Word has length 34 [2020-02-10 20:31:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:04,142 INFO L479 AbstractCegarLoop]: Abstraction has 6202 states and 34104 transitions. [2020-02-10 20:31:04,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 6202 states and 34104 transitions. [2020-02-10 20:31:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:04,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:04,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:04,153 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:04,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1935056908, now seen corresponding path program 31 times [2020-02-10 20:31:04,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:04,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038109245] [2020-02-10 20:31:04,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:04,730 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:31:04,886 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:31:05,034 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:05,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038109245] [2020-02-10 20:31:05,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:05,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:05,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741596737] [2020-02-10 20:31:05,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:05,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:05,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:05,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:05,046 INFO L87 Difference]: Start difference. First operand 6202 states and 34104 transitions. Second operand 13 states. [2020-02-10 20:31:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:05,319 INFO L93 Difference]: Finished difference Result 11869 states and 58527 transitions. [2020-02-10 20:31:05,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:05,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:05,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:05,348 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 20:31:05,348 INFO L226 Difference]: Without dead ends: 11845 [2020-02-10 20:31:05,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2020-02-10 20:31:05,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 6222. [2020-02-10 20:31:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:31:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34153 transitions. [2020-02-10 20:31:05,962 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34153 transitions. Word has length 34 [2020-02-10 20:31:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:05,962 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34153 transitions. [2020-02-10 20:31:05,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34153 transitions. [2020-02-10 20:31:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:05,973 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:05,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, 1, 1, 1] [2020-02-10 20:31:05,973 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:05,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:05,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1723443534, now seen corresponding path program 32 times [2020-02-10 20:31:05,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:05,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010247569] [2020-02-10 20:31:05,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:06,545 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:31:06,688 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:31:06,841 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:06,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010247569] [2020-02-10 20:31:06,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:06,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:06,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793451208] [2020-02-10 20:31:06,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:06,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:06,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:06,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:06,855 INFO L87 Difference]: Start difference. First operand 6222 states and 34153 transitions. Second operand 13 states. [2020-02-10 20:31:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:07,154 INFO L93 Difference]: Finished difference Result 11867 states and 58513 transitions. [2020-02-10 20:31:07,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:07,154 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:07,182 INFO L225 Difference]: With dead ends: 11867 [2020-02-10 20:31:07,183 INFO L226 Difference]: Without dead ends: 11833 [2020-02-10 20:31:07,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2020-02-10 20:31:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 6210. [2020-02-10 20:31:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 20:31:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34124 transitions. [2020-02-10 20:31:07,789 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34124 transitions. Word has length 34 [2020-02-10 20:31:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:07,789 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34124 transitions. [2020-02-10 20:31:07,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34124 transitions. [2020-02-10 20:31:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:07,800 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:07,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, 1, 1, 1] [2020-02-10 20:31:07,800 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:07,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1134213844, now seen corresponding path program 33 times [2020-02-10 20:31:07,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:07,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961100355] [2020-02-10 20:31:07,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:08,593 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:31:08,746 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:08,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961100355] [2020-02-10 20:31:08,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:08,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:08,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510085005] [2020-02-10 20:31:08,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:08,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:08,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:08,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:08,759 INFO L87 Difference]: Start difference. First operand 6210 states and 34124 transitions. Second operand 13 states. [2020-02-10 20:31:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:09,016 INFO L93 Difference]: Finished difference Result 11860 states and 58498 transitions. [2020-02-10 20:31:09,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:09,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:09,046 INFO L225 Difference]: With dead ends: 11860 [2020-02-10 20:31:09,046 INFO L226 Difference]: Without dead ends: 11836 [2020-02-10 20:31:09,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2020-02-10 20:31:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 6217. [2020-02-10 20:31:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:31:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34136 transitions. [2020-02-10 20:31:09,662 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34136 transitions. Word has length 34 [2020-02-10 20:31:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:09,662 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34136 transitions. [2020-02-10 20:31:09,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34136 transitions. [2020-02-10 20:31:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:09,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:09,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:09,674 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:09,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:09,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1346369462, now seen corresponding path program 34 times [2020-02-10 20:31:09,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:09,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766963922] [2020-02-10 20:31:09,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:10,376 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:31:10,528 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:10,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766963922] [2020-02-10 20:31:10,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:10,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:10,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245193033] [2020-02-10 20:31:10,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:10,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:10,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:10,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:10,541 INFO L87 Difference]: Start difference. First operand 6217 states and 34136 transitions. Second operand 13 states. [2020-02-10 20:31:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:10,849 INFO L93 Difference]: Finished difference Result 11854 states and 58480 transitions. [2020-02-10 20:31:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:10,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:10,879 INFO L225 Difference]: With dead ends: 11854 [2020-02-10 20:31:10,879 INFO L226 Difference]: Without dead ends: 11829 [2020-02-10 20:31:10,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11829 states. [2020-02-10 20:31:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11829 to 6210. [2020-02-10 20:31:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 20:31:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34117 transitions. [2020-02-10 20:31:11,486 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34117 transitions. Word has length 34 [2020-02-10 20:31:11,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:11,486 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34117 transitions. [2020-02-10 20:31:11,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34117 transitions. [2020-02-10 20:31:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:11,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:11,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:11,497 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:11,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash 397994544, now seen corresponding path program 35 times [2020-02-10 20:31:11,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:11,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974874943] [2020-02-10 20:31:11,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:11,944 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-02-10 20:31:12,298 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:31:12,445 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:12,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974874943] [2020-02-10 20:31:12,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:12,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:12,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598446196] [2020-02-10 20:31:12,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:12,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:12,457 INFO L87 Difference]: Start difference. First operand 6210 states and 34117 transitions. Second operand 13 states. [2020-02-10 20:31:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:12,760 INFO L93 Difference]: Finished difference Result 11851 states and 58475 transitions. [2020-02-10 20:31:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:12,761 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:12,791 INFO L225 Difference]: With dead ends: 11851 [2020-02-10 20:31:12,791 INFO L226 Difference]: Without dead ends: 11833 [2020-02-10 20:31:12,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2020-02-10 20:31:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 6216. [2020-02-10 20:31:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:31:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34128 transitions. [2020-02-10 20:31:13,404 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34128 transitions. Word has length 34 [2020-02-10 20:31:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:13,405 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34128 transitions. [2020-02-10 20:31:13,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34128 transitions. [2020-02-10 20:31:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:13,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:13,416 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:13,416 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:13,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:13,416 INFO L82 PathProgramCache]: Analyzing trace with hash -26316692, now seen corresponding path program 36 times [2020-02-10 20:31:13,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:13,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092436738] [2020-02-10 20:31:13,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:14,105 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:31:14,256 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:14,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-02-10 20:31:14,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092436738] [2020-02-10 20:31:14,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:14,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:14,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171039177] [2020-02-10 20:31:14,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:14,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:14,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:14,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:14,269 INFO L87 Difference]: Start difference. First operand 6216 states and 34128 transitions. Second operand 13 states. [2020-02-10 20:31:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:14,563 INFO L93 Difference]: Finished difference Result 11855 states and 58477 transitions. [2020-02-10 20:31:14,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:14,564 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:14,594 INFO L225 Difference]: With dead ends: 11855 [2020-02-10 20:31:14,595 INFO L226 Difference]: Without dead ends: 11819 [2020-02-10 20:31:14,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11819 states. [2020-02-10 20:31:15,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11819 to 6202. [2020-02-10 20:31:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6202 states. [2020-02-10 20:31:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6202 states to 6202 states and 34096 transitions. [2020-02-10 20:31:15,204 INFO L78 Accepts]: Start accepts. Automaton has 6202 states and 34096 transitions. Word has length 34 [2020-02-10 20:31:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:15,204 INFO L479 AbstractCegarLoop]: Abstraction has 6202 states and 34096 transitions. [2020-02-10 20:31:15,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 6202 states and 34096 transitions. [2020-02-10 20:31:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:15,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:15,215 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:15,215 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:15,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:15,215 INFO L82 PathProgramCache]: Analyzing trace with hash -709674192, now seen corresponding path program 37 times [2020-02-10 20:31:15,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:15,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907205592] [2020-02-10 20:31:15,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:15,789 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:31:15,933 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:31:16,184 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:16,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907205592] [2020-02-10 20:31:16,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:16,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:16,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117623368] [2020-02-10 20:31:16,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:16,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:16,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:16,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:16,197 INFO L87 Difference]: Start difference. First operand 6202 states and 34096 transitions. Second operand 13 states. [2020-02-10 20:31:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:16,519 INFO L93 Difference]: Finished difference Result 11849 states and 58476 transitions. [2020-02-10 20:31:16,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:16,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:16,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:16,549 INFO L225 Difference]: With dead ends: 11849 [2020-02-10 20:31:16,549 INFO L226 Difference]: Without dead ends: 11830 [2020-02-10 20:31:16,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11830 states. [2020-02-10 20:31:17,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11830 to 6217. [2020-02-10 20:31:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:31:17,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34137 transitions. [2020-02-10 20:31:17,170 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34137 transitions. Word has length 34 [2020-02-10 20:31:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:17,170 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34137 transitions. [2020-02-10 20:31:17,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34137 transitions. [2020-02-10 20:31:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:17,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:17,181 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:17,182 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:17,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1694610476, now seen corresponding path program 38 times [2020-02-10 20:31:17,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:17,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333264305] [2020-02-10 20:31:17,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:17,740 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:31:17,885 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:31:18,032 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:18,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333264305] [2020-02-10 20:31:18,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:18,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:18,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766063439] [2020-02-10 20:31:18,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:18,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:18,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:18,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:18,044 INFO L87 Difference]: Start difference. First operand 6217 states and 34137 transitions. Second operand 13 states. [2020-02-10 20:31:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:18,382 INFO L93 Difference]: Finished difference Result 11854 states and 58478 transitions. [2020-02-10 20:31:18,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:18,382 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:18,411 INFO L225 Difference]: With dead ends: 11854 [2020-02-10 20:31:18,412 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:31:18,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:31:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6209. [2020-02-10 20:31:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:31:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34115 transitions. [2020-02-10 20:31:19,021 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34115 transitions. Word has length 34 [2020-02-10 20:31:19,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:19,021 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34115 transitions. [2020-02-10 20:31:19,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:19,021 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34115 transitions. [2020-02-10 20:31:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:19,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:19,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:19,032 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:19,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:19,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1303436242, now seen corresponding path program 39 times [2020-02-10 20:31:19,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:19,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581307816] [2020-02-10 20:31:19,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:19,603 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:31:19,745 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:31:19,895 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:19,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581307816] [2020-02-10 20:31:19,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:19,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:19,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302085794] [2020-02-10 20:31:19,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:19,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:19,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:19,908 INFO L87 Difference]: Start difference. First operand 6209 states and 34115 transitions. Second operand 13 states. [2020-02-10 20:31:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:20,544 INFO L93 Difference]: Finished difference Result 11841 states and 58453 transitions. [2020-02-10 20:31:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:20,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:20,597 INFO L225 Difference]: With dead ends: 11841 [2020-02-10 20:31:20,597 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:31:20,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:31:21,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6215. [2020-02-10 20:31:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:31:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34126 transitions. [2020-02-10 20:31:21,296 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34126 transitions. Word has length 34 [2020-02-10 20:31:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:21,296 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34126 transitions. [2020-02-10 20:31:21,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34126 transitions. [2020-02-10 20:31:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:21,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:21,308 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:21,308 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:21,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:21,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1912086904, now seen corresponding path program 40 times [2020-02-10 20:31:21,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:21,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670008603] [2020-02-10 20:31:21,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:21,861 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:31:22,004 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:31:22,152 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:22,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670008603] [2020-02-10 20:31:22,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:22,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:22,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418531425] [2020-02-10 20:31:22,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:22,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:22,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:22,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:22,164 INFO L87 Difference]: Start difference. First operand 6215 states and 34126 transitions. Second operand 13 states. [2020-02-10 20:31:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:22,503 INFO L93 Difference]: Finished difference Result 11840 states and 58445 transitions. [2020-02-10 20:31:22,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:22,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:22,533 INFO L225 Difference]: With dead ends: 11840 [2020-02-10 20:31:22,533 INFO L226 Difference]: Without dead ends: 11816 [2020-02-10 20:31:22,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:23,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2020-02-10 20:31:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 6209. [2020-02-10 20:31:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:31:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34109 transitions. [2020-02-10 20:31:23,140 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34109 transitions. Word has length 34 [2020-02-10 20:31:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:23,141 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34109 transitions. [2020-02-10 20:31:23,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34109 transitions. [2020-02-10 20:31:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:23,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:23,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, 1, 1, 1] [2020-02-10 20:31:23,152 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash -6309138, now seen corresponding path program 41 times [2020-02-10 20:31:23,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:23,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219762172] [2020-02-10 20:31:23,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:23,872 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:31:24,020 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:24,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219762172] [2020-02-10 20:31:24,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:24,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:24,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77277105] [2020-02-10 20:31:24,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:24,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:24,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:24,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:24,032 INFO L87 Difference]: Start difference. First operand 6209 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:31:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:24,301 INFO L93 Difference]: Finished difference Result 11852 states and 58467 transitions. [2020-02-10 20:31:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:24,302 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:24,331 INFO L225 Difference]: With dead ends: 11852 [2020-02-10 20:31:24,331 INFO L226 Difference]: Without dead ends: 11828 [2020-02-10 20:31:24,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2020-02-10 20:31:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 6216. [2020-02-10 20:31:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:31:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34121 transitions. [2020-02-10 20:31:25,026 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34121 transitions. Word has length 34 [2020-02-10 20:31:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:25,026 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34121 transitions. [2020-02-10 20:31:25,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34121 transitions. [2020-02-10 20:31:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:25,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:25,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, 1, 1, 1] [2020-02-10 20:31:25,038 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:25,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash 267269468, now seen corresponding path program 42 times [2020-02-10 20:31:25,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:25,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536628766] [2020-02-10 20:31:25,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:25,765 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:31:25,915 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:25,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536628766] [2020-02-10 20:31:25,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:25,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:25,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315506530] [2020-02-10 20:31:25,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:25,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:25,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:25,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:25,927 INFO L87 Difference]: Start difference. First operand 6216 states and 34121 transitions. Second operand 13 states. [2020-02-10 20:31:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:26,253 INFO L93 Difference]: Finished difference Result 11846 states and 58449 transitions. [2020-02-10 20:31:26,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:26,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:26,283 INFO L225 Difference]: With dead ends: 11846 [2020-02-10 20:31:26,283 INFO L226 Difference]: Without dead ends: 11814 [2020-02-10 20:31:26,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11814 states. [2020-02-10 20:31:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11814 to 6202. [2020-02-10 20:31:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6202 states. [2020-02-10 20:31:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6202 states to 6202 states and 34089 transitions. [2020-02-10 20:31:26,893 INFO L78 Accepts]: Start accepts. Automaton has 6202 states and 34089 transitions. Word has length 34 [2020-02-10 20:31:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:26,893 INFO L479 AbstractCegarLoop]: Abstraction has 6202 states and 34089 transitions. [2020-02-10 20:31:26,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6202 states and 34089 transitions. [2020-02-10 20:31:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:26,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:26,904 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:26,905 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -455854420, now seen corresponding path program 43 times [2020-02-10 20:31:26,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:26,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468606710] [2020-02-10 20:31:26,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:27,451 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:31:27,615 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:31:27,765 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:27,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468606710] [2020-02-10 20:31:27,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:27,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:27,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028276292] [2020-02-10 20:31:27,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:27,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:27,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:27,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:27,777 INFO L87 Difference]: Start difference. First operand 6202 states and 34089 transitions. Second operand 13 states. [2020-02-10 20:31:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:28,140 INFO L93 Difference]: Finished difference Result 11836 states and 58443 transitions. [2020-02-10 20:31:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:28,141 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:28,172 INFO L225 Difference]: With dead ends: 11836 [2020-02-10 20:31:28,172 INFO L226 Difference]: Without dead ends: 11817 [2020-02-10 20:31:28,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11817 states. [2020-02-10 20:31:28,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11817 to 6214. [2020-02-10 20:31:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:31:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34123 transitions. [2020-02-10 20:31:28,865 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34123 transitions. Word has length 34 [2020-02-10 20:31:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:28,865 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34123 transitions. [2020-02-10 20:31:28,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34123 transitions. [2020-02-10 20:31:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:28,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:28,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:28,876 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:28,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:28,877 INFO L82 PathProgramCache]: Analyzing trace with hash 152796242, now seen corresponding path program 44 times [2020-02-10 20:31:28,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:28,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561270946] [2020-02-10 20:31:28,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:29,431 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:31:29,577 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:31:29,726 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:29,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561270946] [2020-02-10 20:31:29,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:29,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:29,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610748620] [2020-02-10 20:31:29,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:29,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:29,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:29,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:29,739 INFO L87 Difference]: Start difference. First operand 6214 states and 34123 transitions. Second operand 13 states. [2020-02-10 20:31:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:30,069 INFO L93 Difference]: Finished difference Result 11835 states and 58435 transitions. [2020-02-10 20:31:30,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:30,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:30,100 INFO L225 Difference]: With dead ends: 11835 [2020-02-10 20:31:30,100 INFO L226 Difference]: Without dead ends: 11811 [2020-02-10 20:31:30,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11811 states. [2020-02-10 20:31:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11811 to 6208. [2020-02-10 20:31:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:31:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34106 transitions. [2020-02-10 20:31:30,705 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34106 transitions. Word has length 34 [2020-02-10 20:31:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:30,705 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34106 transitions. [2020-02-10 20:31:30,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34106 transitions. [2020-02-10 20:31:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:30,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:30,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, 1, 1, 1] [2020-02-10 20:31:30,716 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:30,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:30,717 INFO L82 PathProgramCache]: Analyzing trace with hash -724600848, now seen corresponding path program 45 times [2020-02-10 20:31:30,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:30,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813422568] [2020-02-10 20:31:30,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:31,396 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:31:31,547 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:31,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813422568] [2020-02-10 20:31:31,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:31,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:31,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254750442] [2020-02-10 20:31:31,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:31,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:31,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:31,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:31,559 INFO L87 Difference]: Start difference. First operand 6208 states and 34106 transitions. Second operand 13 states. [2020-02-10 20:31:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:31,912 INFO L93 Difference]: Finished difference Result 11841 states and 58448 transitions. [2020-02-10 20:31:31,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:31,913 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:31,942 INFO L225 Difference]: With dead ends: 11841 [2020-02-10 20:31:31,942 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:31:31,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:31:32,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6215. [2020-02-10 20:31:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:31:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34119 transitions. [2020-02-10 20:31:32,656 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34119 transitions. Word has length 34 [2020-02-10 20:31:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:32,657 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34119 transitions. [2020-02-10 20:31:32,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34119 transitions. [2020-02-10 20:31:32,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:32,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:32,668 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:32,668 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:32,668 INFO L82 PathProgramCache]: Analyzing trace with hash -933063602, now seen corresponding path program 46 times [2020-02-10 20:31:32,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:32,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541562228] [2020-02-10 20:31:32,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:33,367 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:31:33,517 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:33,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541562228] [2020-02-10 20:31:33,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:33,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:33,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997775582] [2020-02-10 20:31:33,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:33,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:33,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:33,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:33,529 INFO L87 Difference]: Start difference. First operand 6215 states and 34119 transitions. Second operand 13 states. [2020-02-10 20:31:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:33,941 INFO L93 Difference]: Finished difference Result 11844 states and 58447 transitions. [2020-02-10 20:31:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:33,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:33,972 INFO L225 Difference]: With dead ends: 11844 [2020-02-10 20:31:33,972 INFO L226 Difference]: Without dead ends: 11815 [2020-02-10 20:31:33,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:34,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2020-02-10 20:31:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 6208. [2020-02-10 20:31:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:31:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34100 transitions. [2020-02-10 20:31:34,580 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34100 transitions. Word has length 34 [2020-02-10 20:31:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:34,580 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34100 transitions. [2020-02-10 20:31:34,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34100 transitions. [2020-02-10 20:31:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:34,591 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:34,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, 1, 1, 1] [2020-02-10 20:31:34,591 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:34,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:34,591 INFO L82 PathProgramCache]: Analyzing trace with hash -136936970, now seen corresponding path program 47 times [2020-02-10 20:31:34,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:34,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440619185] [2020-02-10 20:31:34,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:35,287 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:31:35,439 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:35,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440619185] [2020-02-10 20:31:35,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:35,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:35,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862614747] [2020-02-10 20:31:35,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:35,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:35,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:35,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:35,450 INFO L87 Difference]: Start difference. First operand 6208 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:31:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:35,777 INFO L93 Difference]: Finished difference Result 11838 states and 58435 transitions. [2020-02-10 20:31:35,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:35,778 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:35,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:35,808 INFO L225 Difference]: With dead ends: 11838 [2020-02-10 20:31:35,808 INFO L226 Difference]: Without dead ends: 11820 [2020-02-10 20:31:35,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11820 states. [2020-02-10 20:31:36,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11820 to 6214. [2020-02-10 20:31:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:31:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34111 transitions. [2020-02-10 20:31:36,413 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34111 transitions. Word has length 34 [2020-02-10 20:31:36,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:36,413 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34111 transitions. [2020-02-10 20:31:36,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34111 transitions. [2020-02-10 20:31:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:36,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:36,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, 1, 1, 1] [2020-02-10 20:31:36,425 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:36,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:36,425 INFO L82 PathProgramCache]: Analyzing trace with hash 755237736, now seen corresponding path program 48 times [2020-02-10 20:31:36,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:36,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347836090] [2020-02-10 20:31:36,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:36,761 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-02-10 20:31:37,205 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:31:37,352 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31: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-02-10 20:31:37,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347836090] [2020-02-10 20:31:37,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:37,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:37,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021050252] [2020-02-10 20:31:37,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:37,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:37,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:37,364 INFO L87 Difference]: Start difference. First operand 6214 states and 34111 transitions. Second operand 13 states. [2020-02-10 20:31:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:37,849 INFO L93 Difference]: Finished difference Result 11842 states and 58437 transitions. [2020-02-10 20:31:37,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:37,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:37,879 INFO L225 Difference]: With dead ends: 11842 [2020-02-10 20:31:37,880 INFO L226 Difference]: Without dead ends: 11800 [2020-02-10 20:31:37,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11800 states. [2020-02-10 20:31:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11800 to 6194. [2020-02-10 20:31:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6194 states. [2020-02-10 20:31:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 34068 transitions. [2020-02-10 20:31:38,487 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 34068 transitions. Word has length 34 [2020-02-10 20:31:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:38,487 INFO L479 AbstractCegarLoop]: Abstraction has 6194 states and 34068 transitions. [2020-02-10 20:31:38,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 34068 transitions. [2020-02-10 20:31:38,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:38,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:38,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:38,498 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:38,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash -561652570, now seen corresponding path program 49 times [2020-02-10 20:31:38,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:38,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366148275] [2020-02-10 20:31:38,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:39,060 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:31:39,216 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:31:39,370 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:39,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366148275] [2020-02-10 20:31:39,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:39,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:39,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843500772] [2020-02-10 20:31:39,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:39,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:39,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:39,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:39,385 INFO L87 Difference]: Start difference. First operand 6194 states and 34068 transitions. Second operand 13 states. [2020-02-10 20:31:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:39,823 INFO L93 Difference]: Finished difference Result 11879 states and 58554 transitions. [2020-02-10 20:31:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:39,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:39,857 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 20:31:39,858 INFO L226 Difference]: Without dead ends: 11855 [2020-02-10 20:31:39,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:40,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2020-02-10 20:31:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 6223. [2020-02-10 20:31:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:31:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34155 transitions. [2020-02-10 20:31:40,464 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34155 transitions. Word has length 34 [2020-02-10 20:31:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:40,464 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34155 transitions. [2020-02-10 20:31:40,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34155 transitions. [2020-02-10 20:31:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:40,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:40,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, 1, 1, 1] [2020-02-10 20:31:40,475 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:40,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1198119424, now seen corresponding path program 50 times [2020-02-10 20:31:40,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:40,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922348427] [2020-02-10 20:31:40,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:41,030 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:31:41,271 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:31:41,425 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:41,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922348427] [2020-02-10 20:31:41,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:41,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:41,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7509688] [2020-02-10 20:31:41,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:41,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:41,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:41,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:41,438 INFO L87 Difference]: Start difference. First operand 6223 states and 34155 transitions. Second operand 13 states. [2020-02-10 20:31:41,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:41,784 INFO L93 Difference]: Finished difference Result 11877 states and 58540 transitions. [2020-02-10 20:31:41,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:41,785 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:41,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:41,815 INFO L225 Difference]: With dead ends: 11877 [2020-02-10 20:31:41,815 INFO L226 Difference]: Without dead ends: 11843 [2020-02-10 20:31:41,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2020-02-10 20:31:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 6211. [2020-02-10 20:31:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:31:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34126 transitions. [2020-02-10 20:31:42,427 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34126 transitions. Word has length 34 [2020-02-10 20:31:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:42,428 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34126 transitions. [2020-02-10 20:31:42,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34126 transitions. [2020-02-10 20:31:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:42,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:42,439 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:42,439 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:42,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:42,439 INFO L82 PathProgramCache]: Analyzing trace with hash 239190494, now seen corresponding path program 51 times [2020-02-10 20:31:42,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:42,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143815133] [2020-02-10 20:31:42,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:43,133 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:31:43,279 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:43,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143815133] [2020-02-10 20:31:43,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:43,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:43,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907805745] [2020-02-10 20:31:43,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:43,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:43,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:43,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:43,292 INFO L87 Difference]: Start difference. First operand 6211 states and 34126 transitions. Second operand 13 states. [2020-02-10 20:31:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:43,526 INFO L93 Difference]: Finished difference Result 11870 states and 58525 transitions. [2020-02-10 20:31:43,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:43,527 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:43,556 INFO L225 Difference]: With dead ends: 11870 [2020-02-10 20:31:43,556 INFO L226 Difference]: Without dead ends: 11846 [2020-02-10 20:31:43,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11846 states. [2020-02-10 20:31:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11846 to 6218. [2020-02-10 20:31:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:31:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34138 transitions. [2020-02-10 20:31:44,166 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34138 transitions. Word has length 34 [2020-02-10 20:31:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:44,166 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34138 transitions. [2020-02-10 20:31:44,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34138 transitions. [2020-02-10 20:31:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:44,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:44,178 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:44,178 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:44,178 INFO L82 PathProgramCache]: Analyzing trace with hash 27034876, now seen corresponding path program 52 times [2020-02-10 20:31:44,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:44,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947644471] [2020-02-10 20:31:44,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:44,897 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:31:45,046 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:45,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947644471] [2020-02-10 20:31:45,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:45,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:45,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807387849] [2020-02-10 20:31:45,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:45,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:45,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:45,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:45,059 INFO L87 Difference]: Start difference. First operand 6218 states and 34138 transitions. Second operand 13 states. [2020-02-10 20:31:45,397 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2020-02-10 20:31:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:45,426 INFO L93 Difference]: Finished difference Result 11864 states and 58507 transitions. [2020-02-10 20:31:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:45,427 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:45,457 INFO L225 Difference]: With dead ends: 11864 [2020-02-10 20:31:45,457 INFO L226 Difference]: Without dead ends: 11839 [2020-02-10 20:31:45,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11839 states. [2020-02-10 20:31:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11839 to 6211. [2020-02-10 20:31:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:31:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34119 transitions. [2020-02-10 20:31:46,063 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34119 transitions. Word has length 34 [2020-02-10 20:31:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:46,063 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34119 transitions. [2020-02-10 20:31:46,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34119 transitions. [2020-02-10 20:31:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:46,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:46,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, 1, 1, 1] [2020-02-10 20:31:46,074 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:46,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1771398882, now seen corresponding path program 53 times [2020-02-10 20:31:46,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:46,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741848804] [2020-02-10 20:31:46,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:46,756 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:31:46,910 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:46,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741848804] [2020-02-10 20:31:46,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:46,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:46,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238833168] [2020-02-10 20:31:46,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:46,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:46,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:46,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:46,923 INFO L87 Difference]: Start difference. First operand 6211 states and 34119 transitions. Second operand 13 states. [2020-02-10 20:31:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:47,226 INFO L93 Difference]: Finished difference Result 11861 states and 58502 transitions. [2020-02-10 20:31:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:47,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:47,255 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 20:31:47,255 INFO L226 Difference]: Without dead ends: 11843 [2020-02-10 20:31:47,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2020-02-10 20:31:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 6217. [2020-02-10 20:31:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:31:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34130 transitions. [2020-02-10 20:31:47,868 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34130 transitions. Word has length 34 [2020-02-10 20:31:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:47,868 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34130 transitions. [2020-02-10 20:31:47,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34130 transitions. [2020-02-10 20:31:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:47,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:47,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:47,881 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:47,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1347087646, now seen corresponding path program 54 times [2020-02-10 20:31:47,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:47,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389805915] [2020-02-10 20:31:47,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:48,569 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:31:48,716 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:48,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389805915] [2020-02-10 20:31:48,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:48,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:48,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960306729] [2020-02-10 20:31:48,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:48,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:48,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:48,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:48,729 INFO L87 Difference]: Start difference. First operand 6217 states and 34130 transitions. Second operand 13 states. [2020-02-10 20:31:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:49,123 INFO L93 Difference]: Finished difference Result 11865 states and 58504 transitions. [2020-02-10 20:31:49,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:49,123 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:49,153 INFO L225 Difference]: With dead ends: 11865 [2020-02-10 20:31:49,153 INFO L226 Difference]: Without dead ends: 11829 [2020-02-10 20:31:49,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:49,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11829 states. [2020-02-10 20:31:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11829 to 6203. [2020-02-10 20:31:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6203 states. [2020-02-10 20:31:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 34098 transitions. [2020-02-10 20:31:49,853 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 34098 transitions. Word has length 34 [2020-02-10 20:31:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:49,854 INFO L479 AbstractCegarLoop]: Abstraction has 6203 states and 34098 transitions. [2020-02-10 20:31:49,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 34098 transitions. [2020-02-10 20:31:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:49,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:49,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:49,866 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:49,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:49,866 INFO L82 PathProgramCache]: Analyzing trace with hash 165542264, now seen corresponding path program 55 times [2020-02-10 20:31:49,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:49,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593275973] [2020-02-10 20:31:49,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:50,410 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:31:50,558 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:31:50,711 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:31:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:50,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593275973] [2020-02-10 20:31:50,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:50,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:50,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358393754] [2020-02-10 20:31:50,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:50,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:50,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:50,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:50,724 INFO L87 Difference]: Start difference. First operand 6203 states and 34098 transitions. Second operand 13 states. [2020-02-10 20:31:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:50,991 INFO L93 Difference]: Finished difference Result 11892 states and 58583 transitions. [2020-02-10 20:31:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:50,992 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:50,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:51,022 INFO L225 Difference]: With dead ends: 11892 [2020-02-10 20:31:51,022 INFO L226 Difference]: Without dead ends: 11868 [2020-02-10 20:31:51,023 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2020-02-10 20:31:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 6227. [2020-02-10 20:31:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2020-02-10 20:31:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 34160 transitions. [2020-02-10 20:31:51,631 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 34160 transitions. Word has length 34 [2020-02-10 20:31:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:51,632 INFO L479 AbstractCegarLoop]: Abstraction has 6227 states and 34160 transitions. [2020-02-10 20:31:51,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 34160 transitions. [2020-02-10 20:31:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:51,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:51,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, 1, 1, 1] [2020-02-10 20:31:51,643 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:51,643 INFO L82 PathProgramCache]: Analyzing trace with hash -470924590, now seen corresponding path program 56 times [2020-02-10 20:31:51,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:51,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069835427] [2020-02-10 20:31:51,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:52,227 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:31:52,375 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:31:52,526 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:52,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069835427] [2020-02-10 20:31:52,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:52,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:52,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061861607] [2020-02-10 20:31:52,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:52,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:52,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:52,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:52,539 INFO L87 Difference]: Start difference. First operand 6227 states and 34160 transitions. Second operand 13 states. [2020-02-10 20:31:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:52,838 INFO L93 Difference]: Finished difference Result 11890 states and 58569 transitions. [2020-02-10 20:31:52,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:52,838 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:52,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:52,868 INFO L225 Difference]: With dead ends: 11890 [2020-02-10 20:31:52,868 INFO L226 Difference]: Without dead ends: 11856 [2020-02-10 20:31:52,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11856 states. [2020-02-10 20:31:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11856 to 6215. [2020-02-10 20:31:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:31:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34128 transitions. [2020-02-10 20:31:53,479 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34128 transitions. Word has length 34 [2020-02-10 20:31:53,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:53,479 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34128 transitions. [2020-02-10 20:31:53,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:53,479 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34128 transitions. [2020-02-10 20:31:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:53,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:53,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:53,584 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:53,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:53,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1093561694, now seen corresponding path program 57 times [2020-02-10 20:31:53,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:53,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341860458] [2020-02-10 20:31:53,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:54,133 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:31:54,283 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:31:54,427 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:31:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:54,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341860458] [2020-02-10 20:31:54,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:54,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:54,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194301785] [2020-02-10 20:31:54,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:54,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:54,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:54,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:54,440 INFO L87 Difference]: Start difference. First operand 6215 states and 34128 transitions. Second operand 13 states. [2020-02-10 20:31:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:54,710 INFO L93 Difference]: Finished difference Result 11889 states and 58566 transitions. [2020-02-10 20:31:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:54,710 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:54,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:54,740 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 20:31:54,740 INFO L226 Difference]: Without dead ends: 11865 [2020-02-10 20:31:54,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:55,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11865 states. [2020-02-10 20:31:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11865 to 6225. [2020-02-10 20:31:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:31:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34146 transitions. [2020-02-10 20:31:55,350 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34146 transitions. Word has length 34 [2020-02-10 20:31:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:55,350 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34146 transitions. [2020-02-10 20:31:55,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34146 transitions. [2020-02-10 20:31:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:55,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:55,361 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:55,361 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:55,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:55,362 INFO L82 PathProgramCache]: Analyzing trace with hash -603683250, now seen corresponding path program 58 times [2020-02-10 20:31:55,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:55,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107687007] [2020-02-10 20:31:55,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:55,925 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:31:56,067 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:31:56,214 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:31:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:56,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107687007] [2020-02-10 20:31:56,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:56,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:56,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161057318] [2020-02-10 20:31:56,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:56,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:56,227 INFO L87 Difference]: Start difference. First operand 6225 states and 34146 transitions. Second operand 13 states. [2020-02-10 20:31:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:56,533 INFO L93 Difference]: Finished difference Result 11886 states and 58551 transitions. [2020-02-10 20:31:56,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:56,533 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:56,563 INFO L225 Difference]: With dead ends: 11886 [2020-02-10 20:31:56,563 INFO L226 Difference]: Without dead ends: 11855 [2020-02-10 20:31:56,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11855 states. [2020-02-10 20:31:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11855 to 6215. [2020-02-10 20:31:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:31:57,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34118 transitions. [2020-02-10 20:31:57,176 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34118 transitions. Word has length 34 [2020-02-10 20:31:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:57,176 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34118 transitions. [2020-02-10 20:31:57,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34118 transitions. [2020-02-10 20:31:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:57,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:57,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:57,187 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:57,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:57,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2093508450, now seen corresponding path program 59 times [2020-02-10 20:31:57,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:57,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078303194] [2020-02-10 20:31:57,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:57,748 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:31:57,891 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:31:58,138 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:31:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:58,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078303194] [2020-02-10 20:31:58,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:58,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:31:58,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759742952] [2020-02-10 20:31:58,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:31:58,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:58,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:31:58,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:58,150 INFO L87 Difference]: Start difference. First operand 6215 states and 34118 transitions. Second operand 13 states. [2020-02-10 20:31:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:58,581 INFO L93 Difference]: Finished difference Result 11884 states and 58548 transitions. [2020-02-10 20:31:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:31:58,582 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:31:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:58,611 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 20:31:58,612 INFO L226 Difference]: Without dead ends: 11862 [2020-02-10 20:31:58,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:31:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2020-02-10 20:31:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 6224. [2020-02-10 20:31:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2020-02-10 20:31:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 34135 transitions. [2020-02-10 20:31:59,220 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 34135 transitions. Word has length 34 [2020-02-10 20:31:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:59,221 INFO L479 AbstractCegarLoop]: Abstraction has 6224 states and 34135 transitions. [2020-02-10 20:31:59,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:31:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 34135 transitions. [2020-02-10 20:31:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:31:59,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:59,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:59,232 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:31:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1140680756, now seen corresponding path program 60 times [2020-02-10 20:31:59,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:59,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426637531] [2020-02-10 20:31:59,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:59,789 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:31:59,932 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:32:00,085 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:32:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:00,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426637531] [2020-02-10 20:32:00,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:00,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:00,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773285768] [2020-02-10 20:32:00,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:00,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:00,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:00,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:00,097 INFO L87 Difference]: Start difference. First operand 6224 states and 34135 transitions. Second operand 13 states. [2020-02-10 20:32:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:00,418 INFO L93 Difference]: Finished difference Result 11883 states and 58537 transitions. [2020-02-10 20:32:00,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:00,419 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:00,449 INFO L225 Difference]: With dead ends: 11883 [2020-02-10 20:32:00,449 INFO L226 Difference]: Without dead ends: 11841 [2020-02-10 20:32:00,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-02-10 20:32:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 6203. [2020-02-10 20:32:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6203 states. [2020-02-10 20:32:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 34089 transitions. [2020-02-10 20:32:01,064 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 34089 transitions. Word has length 34 [2020-02-10 20:32:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:01,064 INFO L479 AbstractCegarLoop]: Abstraction has 6203 states and 34089 transitions. [2020-02-10 20:32:01,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 34089 transitions. [2020-02-10 20:32:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:01,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:01,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, 1, 1, 1] [2020-02-10 20:32:01,075 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:01,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:01,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1056978248, now seen corresponding path program 61 times [2020-02-10 20:32:01,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:01,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053265608] [2020-02-10 20:32:01,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:01,755 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:32:01,902 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:01,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053265608] [2020-02-10 20:32:01,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:01,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:01,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68421321] [2020-02-10 20:32:01,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:01,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:01,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:01,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:01,914 INFO L87 Difference]: Start difference. First operand 6203 states and 34089 transitions. Second operand 13 states. [2020-02-10 20:32:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:02,172 INFO L93 Difference]: Finished difference Result 11866 states and 58508 transitions. [2020-02-10 20:32:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:02,172 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:02,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:02,202 INFO L225 Difference]: With dead ends: 11866 [2020-02-10 20:32:02,202 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 20:32:02,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 20:32:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6217. [2020-02-10 20:32:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:32:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34127 transitions. [2020-02-10 20:32:02,892 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34127 transitions. Word has length 34 [2020-02-10 20:32:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:02,893 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34127 transitions. [2020-02-10 20:32:02,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34127 transitions. [2020-02-10 20:32:02,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:02,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:02,904 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:02,904 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:02,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:02,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1269133866, now seen corresponding path program 62 times [2020-02-10 20:32:02,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:02,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439249001] [2020-02-10 20:32:02,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:03,622 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:03,770 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:03,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439249001] [2020-02-10 20:32:03,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:03,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:03,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517359432] [2020-02-10 20:32:03,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:03,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:03,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:03,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:03,783 INFO L87 Difference]: Start difference. First operand 6217 states and 34127 transitions. Second operand 13 states. [2020-02-10 20:32:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:04,084 INFO L93 Difference]: Finished difference Result 11860 states and 58490 transitions. [2020-02-10 20:32:04,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:04,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:04,113 INFO L225 Difference]: With dead ends: 11860 [2020-02-10 20:32:04,113 INFO L226 Difference]: Without dead ends: 11835 [2020-02-10 20:32:04,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:04,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11835 states. [2020-02-10 20:32:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11835 to 6210. [2020-02-10 20:32:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 20:32:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34108 transitions. [2020-02-10 20:32:04,727 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34108 transitions. Word has length 34 [2020-02-10 20:32:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:04,727 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34108 transitions. [2020-02-10 20:32:04,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34108 transitions. [2020-02-10 20:32:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:04,738 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:04,738 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:04,738 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:04,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash 149892902, now seen corresponding path program 63 times [2020-02-10 20:32:04,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:04,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564333652] [2020-02-10 20:32:04,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:05,270 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:32:05,421 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:32:05,576 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:05,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564333652] [2020-02-10 20:32:05,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:05,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:05,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558714700] [2020-02-10 20:32:05,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:05,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:05,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:05,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:05,589 INFO L87 Difference]: Start difference. First operand 6210 states and 34108 transitions. Second operand 13 states. [2020-02-10 20:32:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:05,898 INFO L93 Difference]: Finished difference Result 11872 states and 58516 transitions. [2020-02-10 20:32:05,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:05,899 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:05,929 INFO L225 Difference]: With dead ends: 11872 [2020-02-10 20:32:05,929 INFO L226 Difference]: Without dead ends: 11848 [2020-02-10 20:32:05,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2020-02-10 20:32:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 6220. [2020-02-10 20:32:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:32:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34126 transitions. [2020-02-10 20:32:06,642 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34126 transitions. Word has length 34 [2020-02-10 20:32:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:06,642 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34126 transitions. [2020-02-10 20:32:06,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34126 transitions. [2020-02-10 20:32:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:06,653 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:06,653 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:06,653 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:06,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1547352042, now seen corresponding path program 64 times [2020-02-10 20:32:06,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:06,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548132633] [2020-02-10 20:32:06,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:07,204 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:32:07,351 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:32:07,494 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:07,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-02-10 20:32:07,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548132633] [2020-02-10 20:32:07,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:07,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:07,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971607299] [2020-02-10 20:32:07,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:07,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:07,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:07,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:07,506 INFO L87 Difference]: Start difference. First operand 6220 states and 34126 transitions. Second operand 13 states. [2020-02-10 20:32:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:07,844 INFO L93 Difference]: Finished difference Result 11869 states and 58501 transitions. [2020-02-10 20:32:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:07,845 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:07,873 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 20:32:07,874 INFO L226 Difference]: Without dead ends: 11838 [2020-02-10 20:32:07,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:08,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11838 states. [2020-02-10 20:32:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11838 to 6210. [2020-02-10 20:32:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 20:32:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34101 transitions. [2020-02-10 20:32:08,486 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34101 transitions. Word has length 34 [2020-02-10 20:32:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:08,486 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34101 transitions. [2020-02-10 20:32:08,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34101 transitions. [2020-02-10 20:32:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:08,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:08,497 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:08,497 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:08,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1950847718, now seen corresponding path program 65 times [2020-02-10 20:32:08,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:08,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797575629] [2020-02-10 20:32:08,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:09,163 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:09,314 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:09,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797575629] [2020-02-10 20:32:09,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:09,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:09,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040295730] [2020-02-10 20:32:09,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:09,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:09,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:09,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:09,326 INFO L87 Difference]: Start difference. First operand 6210 states and 34101 transitions. Second operand 13 states. [2020-02-10 20:32:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:09,663 INFO L93 Difference]: Finished difference Result 11856 states and 58476 transitions. [2020-02-10 20:32:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:09,664 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:09,693 INFO L225 Difference]: With dead ends: 11856 [2020-02-10 20:32:09,694 INFO L226 Difference]: Without dead ends: 11838 [2020-02-10 20:32:09,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11838 states. [2020-02-10 20:32:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11838 to 6216. [2020-02-10 20:32:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:32:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34112 transitions. [2020-02-10 20:32:10,299 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34112 transitions. Word has length 34 [2020-02-10 20:32:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:10,300 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34112 transitions. [2020-02-10 20:32:10,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34112 transitions. [2020-02-10 20:32:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:10,311 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:10,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, 1, 1, 1] [2020-02-10 20:32:10,311 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:10,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:10,312 INFO L82 PathProgramCache]: Analyzing trace with hash 465758392, now seen corresponding path program 66 times [2020-02-10 20:32:10,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:10,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253957901] [2020-02-10 20:32:10,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:10,939 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2020-02-10 20:32:11,088 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:32:11,235 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:11,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253957901] [2020-02-10 20:32:11,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:11,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:11,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182905163] [2020-02-10 20:32:11,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:11,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:11,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:11,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:11,247 INFO L87 Difference]: Start difference. First operand 6216 states and 34112 transitions. Second operand 13 states. [2020-02-10 20:32:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:11,605 INFO L93 Difference]: Finished difference Result 11859 states and 58476 transitions. [2020-02-10 20:32:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:11,606 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:11,636 INFO L225 Difference]: With dead ends: 11859 [2020-02-10 20:32:11,636 INFO L226 Difference]: Without dead ends: 11825 [2020-02-10 20:32:11,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:12,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11825 states. [2020-02-10 20:32:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11825 to 6203. [2020-02-10 20:32:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6203 states. [2020-02-10 20:32:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 34082 transitions. [2020-02-10 20:32:12,251 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 34082 transitions. Word has length 34 [2020-02-10 20:32:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:12,251 INFO L479 AbstractCegarLoop]: Abstraction has 6203 states and 34082 transitions. [2020-02-10 20:32:12,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 34082 transitions. [2020-02-10 20:32:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:12,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:12,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, 1, 1, 1] [2020-02-10 20:32:12,262 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:12,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1284060522, now seen corresponding path program 67 times [2020-02-10 20:32:12,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:12,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315355584] [2020-02-10 20:32:12,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:13,030 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:32:13,179 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:32:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:13,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315355584] [2020-02-10 20:32:13,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:13,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:13,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741062669] [2020-02-10 20:32:13,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:13,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:13,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:13,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:13,191 INFO L87 Difference]: Start difference. First operand 6203 states and 34082 transitions. Second operand 13 states. [2020-02-10 20:32:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:13,533 INFO L93 Difference]: Finished difference Result 11852 states and 58475 transitions. [2020-02-10 20:32:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:13,533 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:13,572 INFO L225 Difference]: With dead ends: 11852 [2020-02-10 20:32:13,572 INFO L226 Difference]: Without dead ends: 11834 [2020-02-10 20:32:13,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:14,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11834 states. [2020-02-10 20:32:14,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11834 to 6215. [2020-02-10 20:32:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:32:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34116 transitions. [2020-02-10 20:32:14,179 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34116 transitions. Word has length 34 [2020-02-10 20:32:14,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:14,179 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34116 transitions. [2020-02-10 20:32:14,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34116 transitions. [2020-02-10 20:32:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:14,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:14,190 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:14,190 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:14,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1708371758, now seen corresponding path program 68 times [2020-02-10 20:32:14,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:14,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497374255] [2020-02-10 20:32:14,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:14,948 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:15,096 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:32:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:15,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497374255] [2020-02-10 20:32:15,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:15,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:15,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211644305] [2020-02-10 20:32:15,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:15,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:15,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:15,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:15,108 INFO L87 Difference]: Start difference. First operand 6215 states and 34116 transitions. Second operand 13 states. [2020-02-10 20:32:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:15,451 INFO L93 Difference]: Finished difference Result 11856 states and 58477 transitions. [2020-02-10 20:32:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:15,452 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:15,573 INFO L225 Difference]: With dead ends: 11856 [2020-02-10 20:32:15,573 INFO L226 Difference]: Without dead ends: 11828 [2020-02-10 20:32:15,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2020-02-10 20:32:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 6209. [2020-02-10 20:32:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:32:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34099 transitions. [2020-02-10 20:32:16,174 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34099 transitions. Word has length 34 [2020-02-10 20:32:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:16,174 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34099 transitions. [2020-02-10 20:32:16,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34099 transitions. [2020-02-10 20:32:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:16,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:16,185 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:16,185 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:16,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:16,186 INFO L82 PathProgramCache]: Analyzing trace with hash 191557056, now seen corresponding path program 69 times [2020-02-10 20:32:16,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:16,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570352849] [2020-02-10 20:32:16,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:16,845 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:32:16,995 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:32:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:17,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570352849] [2020-02-10 20:32:17,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:17,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:17,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253118461] [2020-02-10 20:32:17,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:17,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:17,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:17,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:17,008 INFO L87 Difference]: Start difference. First operand 6209 states and 34099 transitions. Second operand 13 states. [2020-02-10 20:32:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:17,387 INFO L93 Difference]: Finished difference Result 11851 states and 58467 transitions. [2020-02-10 20:32:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:17,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:17,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:17,417 INFO L225 Difference]: With dead ends: 11851 [2020-02-10 20:32:17,417 INFO L226 Difference]: Without dead ends: 11833 [2020-02-10 20:32:17,417 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11833 states. [2020-02-10 20:32:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11833 to 6215. [2020-02-10 20:32:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:32:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34110 transitions. [2020-02-10 20:32:18,024 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34110 transitions. Word has length 34 [2020-02-10 20:32:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:18,024 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34110 transitions. [2020-02-10 20:32:18,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34110 transitions. [2020-02-10 20:32:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:18,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:18,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:18,036 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1293532270, now seen corresponding path program 70 times [2020-02-10 20:32:18,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:18,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211523542] [2020-02-10 20:32:18,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:18,725 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:32:18,878 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:32:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:18,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211523542] [2020-02-10 20:32:18,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:18,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:18,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667403573] [2020-02-10 20:32:18,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:18,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:18,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:18,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:18,890 INFO L87 Difference]: Start difference. First operand 6215 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:32:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:19,376 INFO L93 Difference]: Finished difference Result 11854 states and 58467 transitions. [2020-02-10 20:32:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:19,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:19,406 INFO L225 Difference]: With dead ends: 11854 [2020-02-10 20:32:19,407 INFO L226 Difference]: Without dead ends: 11827 [2020-02-10 20:32:19,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11827 states. [2020-02-10 20:32:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11827 to 6209. [2020-02-10 20:32:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:32:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34093 transitions. [2020-02-10 20:32:20,109 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34093 transitions. Word has length 34 [2020-02-10 20:32:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:20,109 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34093 transitions. [2020-02-10 20:32:20,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34093 transitions. [2020-02-10 20:32:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:20,120 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:20,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, 1, 1, 1] [2020-02-10 20:32:20,121 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:20,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:20,121 INFO L82 PathProgramCache]: Analyzing trace with hash -501500608, now seen corresponding path program 71 times [2020-02-10 20:32:20,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:20,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302728650] [2020-02-10 20:32:20,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:20,668 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:32:20,815 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:20,965 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:32:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:20,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302728650] [2020-02-10 20:32:20,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:20,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:20,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995729700] [2020-02-10 20:32:20,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:20,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:20,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:20,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:20,977 INFO L87 Difference]: Start difference. First operand 6209 states and 34093 transitions. Second operand 13 states. [2020-02-10 20:32:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:21,435 INFO L93 Difference]: Finished difference Result 11862 states and 58486 transitions. [2020-02-10 20:32:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:21,435 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:21,474 INFO L225 Difference]: With dead ends: 11862 [2020-02-10 20:32:21,474 INFO L226 Difference]: Without dead ends: 11840 [2020-02-10 20:32:21,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11840 states. [2020-02-10 20:32:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11840 to 6218. [2020-02-10 20:32:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:32:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34110 transitions. [2020-02-10 20:32:22,084 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34110 transitions. Word has length 34 [2020-02-10 20:32:22,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:22,084 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34110 transitions. [2020-02-10 20:32:22,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34110 transitions. [2020-02-10 20:32:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:22,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:22,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:22,095 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:22,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1562278698, now seen corresponding path program 72 times [2020-02-10 20:32:22,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:22,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279073310] [2020-02-10 20:32:22,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:22,640 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:32:22,785 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:32:22,933 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:32:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:22,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279073310] [2020-02-10 20:32:22,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:22,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:22,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049251483] [2020-02-10 20:32:22,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:22,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:22,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:22,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:22,945 INFO L87 Difference]: Start difference. First operand 6218 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:32:23,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:23,286 INFO L93 Difference]: Finished difference Result 11861 states and 58475 transitions. [2020-02-10 20:32:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:23,286 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:23,326 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 20:32:23,326 INFO L226 Difference]: Without dead ends: 11816 [2020-02-10 20:32:23,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:23,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2020-02-10 20:32:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 6194. [2020-02-10 20:32:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6194 states. [2020-02-10 20:32:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 34059 transitions. [2020-02-10 20:32:23,956 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 34059 transitions. Word has length 34 [2020-02-10 20:32:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:23,956 INFO L479 AbstractCegarLoop]: Abstraction has 6194 states and 34059 transitions. [2020-02-10 20:32:23,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 34059 transitions. [2020-02-10 20:32:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:23,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:23,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:23,968 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:23,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2058767766, now seen corresponding path program 73 times [2020-02-10 20:32:23,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:23,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476227111] [2020-02-10 20:32:23,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:24,491 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2020-02-10 20:32:24,623 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:32:24,778 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:24,933 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:24,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476227111] [2020-02-10 20:32:24,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:24,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:24,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828114708] [2020-02-10 20:32:24,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:24,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:24,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:24,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:24,945 INFO L87 Difference]: Start difference. First operand 6194 states and 34059 transitions. Second operand 13 states. [2020-02-10 20:32:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:25,227 INFO L93 Difference]: Finished difference Result 11843 states and 58462 transitions. [2020-02-10 20:32:25,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:25,227 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:25,256 INFO L225 Difference]: With dead ends: 11843 [2020-02-10 20:32:25,257 INFO L226 Difference]: Without dead ends: 11824 [2020-02-10 20:32:25,257 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:25,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11824 states. [2020-02-10 20:32:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11824 to 6216. [2020-02-10 20:32:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:32:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34133 transitions. [2020-02-10 20:32:25,867 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34133 transitions. Word has length 34 [2020-02-10 20:32:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:25,868 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34133 transitions. [2020-02-10 20:32:25,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34133 transitions. [2020-02-10 20:32:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:25,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:25,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:25,879 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:25,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:25,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1073831482, now seen corresponding path program 74 times [2020-02-10 20:32:25,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:25,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592332662] [2020-02-10 20:32:25,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:26,449 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:32:26,604 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:32:26,749 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:26,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592332662] [2020-02-10 20:32:26,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:26,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:26,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208811414] [2020-02-10 20:32:26,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:26,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:26,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:26,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:26,762 INFO L87 Difference]: Start difference. First operand 6216 states and 34133 transitions. Second operand 13 states. [2020-02-10 20:32:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:27,009 INFO L93 Difference]: Finished difference Result 11848 states and 58464 transitions. [2020-02-10 20:32:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:27,010 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:27,039 INFO L225 Difference]: With dead ends: 11848 [2020-02-10 20:32:27,039 INFO L226 Difference]: Without dead ends: 11816 [2020-02-10 20:32:27,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2020-02-10 20:32:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 6208. [2020-02-10 20:32:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:32:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34111 transitions. [2020-02-10 20:32:27,650 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34111 transitions. Word has length 34 [2020-02-10 20:32:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:27,650 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34111 transitions. [2020-02-10 20:32:27,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34111 transitions. [2020-02-10 20:32:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:27,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:27,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, 1, 1, 1] [2020-02-10 20:32:27,661 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:27,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:27,661 INFO L82 PathProgramCache]: Analyzing trace with hash -223089096, now seen corresponding path program 75 times [2020-02-10 20:32:27,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:27,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133776818] [2020-02-10 20:32:27,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:28,212 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:32:28,357 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:28,509 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:28,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133776818] [2020-02-10 20:32:28,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:28,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:28,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152757940] [2020-02-10 20:32:28,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:28,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:28,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:28,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:28,521 INFO L87 Difference]: Start difference. First operand 6208 states and 34111 transitions. Second operand 13 states. [2020-02-10 20:32:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:28,897 INFO L93 Difference]: Finished difference Result 11835 states and 58439 transitions. [2020-02-10 20:32:28,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:28,898 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:28,928 INFO L225 Difference]: With dead ends: 11835 [2020-02-10 20:32:28,928 INFO L226 Difference]: Without dead ends: 11816 [2020-02-10 20:32:28,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11816 states. [2020-02-10 20:32:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11816 to 6214. [2020-02-10 20:32:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:32:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34122 transitions. [2020-02-10 20:32:29,615 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34122 transitions. Word has length 34 [2020-02-10 20:32:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:29,615 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34122 transitions. [2020-02-10 20:32:29,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34122 transitions. [2020-02-10 20:32:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:29,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:29,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:29,627 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:29,628 INFO L82 PathProgramCache]: Analyzing trace with hash 385561566, now seen corresponding path program 76 times [2020-02-10 20:32:29,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:29,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630939591] [2020-02-10 20:32:29,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:30,177 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:32:30,325 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:30,474 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:30,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630939591] [2020-02-10 20:32:30,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:30,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:30,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389400026] [2020-02-10 20:32:30,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:30,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:30,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:30,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:30,487 INFO L87 Difference]: Start difference. First operand 6214 states and 34122 transitions. Second operand 13 states. [2020-02-10 20:32:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:30,789 INFO L93 Difference]: Finished difference Result 11834 states and 58431 transitions. [2020-02-10 20:32:30,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:30,790 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:30,819 INFO L225 Difference]: With dead ends: 11834 [2020-02-10 20:32:30,820 INFO L226 Difference]: Without dead ends: 11810 [2020-02-10 20:32:30,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:31,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11810 states. [2020-02-10 20:32:31,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11810 to 6208. [2020-02-10 20:32:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:32:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34105 transitions. [2020-02-10 20:32:31,432 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34105 transitions. Word has length 34 [2020-02-10 20:32:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:31,432 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34105 transitions. [2020-02-10 20:32:31,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34105 transitions. [2020-02-10 20:32:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:31,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:31,444 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:31,444 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:31,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1532834476, now seen corresponding path program 77 times [2020-02-10 20:32:31,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:31,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22623815] [2020-02-10 20:32:31,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:32,134 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:32:32,288 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:32,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22623815] [2020-02-10 20:32:32,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:32,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:32,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663934118] [2020-02-10 20:32:32,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:32,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:32,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:32,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:32,299 INFO L87 Difference]: Start difference. First operand 6208 states and 34105 transitions. Second operand 13 states. [2020-02-10 20:32:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:32,652 INFO L93 Difference]: Finished difference Result 11846 states and 58453 transitions. [2020-02-10 20:32:32,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:32,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:32,681 INFO L225 Difference]: With dead ends: 11846 [2020-02-10 20:32:32,681 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:32:32,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:32:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6215. [2020-02-10 20:32:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:32:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34117 transitions. [2020-02-10 20:32:33,417 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34117 transitions. Word has length 34 [2020-02-10 20:32:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:33,417 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34117 transitions. [2020-02-10 20:32:33,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34117 transitions. [2020-02-10 20:32:33,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:33,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:33,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, 1, 1, 1] [2020-02-10 20:32:33,428 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:33,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1259255870, now seen corresponding path program 78 times [2020-02-10 20:32:33,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:33,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38024678] [2020-02-10 20:32:33,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:34,114 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:34,264 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:34,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38024678] [2020-02-10 20:32:34,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:34,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:34,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527157031] [2020-02-10 20:32:34,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:34,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:34,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:34,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:34,276 INFO L87 Difference]: Start difference. First operand 6215 states and 34117 transitions. Second operand 13 states. [2020-02-10 20:32:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:34,623 INFO L93 Difference]: Finished difference Result 11840 states and 58435 transitions. [2020-02-10 20:32:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:34,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:34,653 INFO L225 Difference]: With dead ends: 11840 [2020-02-10 20:32:34,653 INFO L226 Difference]: Without dead ends: 11808 [2020-02-10 20:32:34,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11808 states. [2020-02-10 20:32:35,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11808 to 6201. [2020-02-10 20:32:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 20:32:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34085 transitions. [2020-02-10 20:32:35,261 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34085 transitions. Word has length 34 [2020-02-10 20:32:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:35,262 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34085 transitions. [2020-02-10 20:32:35,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34085 transitions. [2020-02-10 20:32:35,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:35,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:35,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:35,273 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:35,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:35,273 INFO L82 PathProgramCache]: Analyzing trace with hash 817067752, now seen corresponding path program 79 times [2020-02-10 20:32:35,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:35,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688158304] [2020-02-10 20:32:35,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:35,818 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:32:35,965 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:36,111 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:36,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688158304] [2020-02-10 20:32:36,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:36,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:36,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382185677] [2020-02-10 20:32:36,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:36,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:36,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:36,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:36,124 INFO L87 Difference]: Start difference. First operand 6201 states and 34085 transitions. Second operand 13 states. [2020-02-10 20:32:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:36,455 INFO L93 Difference]: Finished difference Result 11851 states and 58477 transitions. [2020-02-10 20:32:36,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:36,456 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:36,485 INFO L225 Difference]: With dead ends: 11851 [2020-02-10 20:32:36,485 INFO L226 Difference]: Without dead ends: 11832 [2020-02-10 20:32:36,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:36,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11832 states. [2020-02-10 20:32:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11832 to 6217. [2020-02-10 20:32:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:32:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34130 transitions. [2020-02-10 20:32:37,089 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34130 transitions. Word has length 34 [2020-02-10 20:32:37,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:37,089 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34130 transitions. [2020-02-10 20:32:37,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34130 transitions. [2020-02-10 20:32:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:37,099 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:37,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:37,100 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:37,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:37,100 INFO L82 PathProgramCache]: Analyzing trace with hash -167868532, now seen corresponding path program 80 times [2020-02-10 20:32:37,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:37,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759746309] [2020-02-10 20:32:37,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:37,666 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:32:37,814 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:32:37,961 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:37,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759746309] [2020-02-10 20:32:37,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:37,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:37,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92031742] [2020-02-10 20:32:37,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:37,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:37,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:37,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:37,973 INFO L87 Difference]: Start difference. First operand 6217 states and 34130 transitions. Second operand 13 states. [2020-02-10 20:32:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:38,395 INFO L93 Difference]: Finished difference Result 11856 states and 58479 transitions. [2020-02-10 20:32:38,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:38,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:38,425 INFO L225 Difference]: With dead ends: 11856 [2020-02-10 20:32:38,426 INFO L226 Difference]: Without dead ends: 11824 [2020-02-10 20:32:38,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11824 states. [2020-02-10 20:32:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11824 to 6209. [2020-02-10 20:32:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:32:39,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34107 transitions. [2020-02-10 20:32:39,035 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34107 transitions. Word has length 34 [2020-02-10 20:32:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:39,035 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34107 transitions. [2020-02-10 20:32:39,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34107 transitions. [2020-02-10 20:32:39,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:39,047 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:39,047 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:39,047 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:39,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:39,048 INFO L82 PathProgramCache]: Analyzing trace with hash -257917960, now seen corresponding path program 81 times [2020-02-10 20:32:39,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:39,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780445268] [2020-02-10 20:32:39,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:39,723 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:39,872 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:39,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780445268] [2020-02-10 20:32:39,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:39,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:39,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130957880] [2020-02-10 20:32:39,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:39,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:39,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:39,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:39,885 INFO L87 Difference]: Start difference. First operand 6209 states and 34107 transitions. Second operand 13 states. [2020-02-10 20:32:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:40,330 INFO L93 Difference]: Finished difference Result 11847 states and 58462 transitions. [2020-02-10 20:32:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:40,331 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:40,361 INFO L225 Difference]: With dead ends: 11847 [2020-02-10 20:32:40,361 INFO L226 Difference]: Without dead ends: 11828 [2020-02-10 20:32:40,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2020-02-10 20:32:40,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 6216. [2020-02-10 20:32:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:32:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34120 transitions. [2020-02-10 20:32:40,968 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34120 transitions. Word has length 34 [2020-02-10 20:32:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:40,968 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34120 transitions. [2020-02-10 20:32:40,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34120 transitions. [2020-02-10 20:32:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:40,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:40,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:40,980 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:40,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:40,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1158242348, now seen corresponding path program 82 times [2020-02-10 20:32:40,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:40,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205230490] [2020-02-10 20:32:40,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:41,701 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:32:41,849 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:41,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205230490] [2020-02-10 20:32:41,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:41,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:41,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850880719] [2020-02-10 20:32:41,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:41,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:41,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:41,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:41,861 INFO L87 Difference]: Start difference. First operand 6216 states and 34120 transitions. Second operand 13 states. [2020-02-10 20:32:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:42,200 INFO L93 Difference]: Finished difference Result 11849 states and 58459 transitions. [2020-02-10 20:32:42,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:42,200 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:42,231 INFO L225 Difference]: With dead ends: 11849 [2020-02-10 20:32:42,231 INFO L226 Difference]: Without dead ends: 11821 [2020-02-10 20:32:42,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11821 states. [2020-02-10 20:32:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11821 to 6209. [2020-02-10 20:32:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:32:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34100 transitions. [2020-02-10 20:32:42,924 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34100 transitions. Word has length 34 [2020-02-10 20:32:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:42,924 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34100 transitions. [2020-02-10 20:32:42,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:42,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34100 transitions. [2020-02-10 20:32:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:42,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:42,935 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:42,935 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:42,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:42,936 INFO L82 PathProgramCache]: Analyzing trace with hash 783428056, now seen corresponding path program 83 times [2020-02-10 20:32:42,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:42,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335651333] [2020-02-10 20:32:42,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:43,625 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:32:43,775 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:43,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335651333] [2020-02-10 20:32:43,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:43,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:43,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138286491] [2020-02-10 20:32:43,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:43,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:43,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:43,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:43,787 INFO L87 Difference]: Start difference. First operand 6209 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:32:44,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:44,077 INFO L93 Difference]: Finished difference Result 11860 states and 58481 transitions. [2020-02-10 20:32:44,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:44,077 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:44,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:44,108 INFO L225 Difference]: With dead ends: 11860 [2020-02-10 20:32:44,108 INFO L226 Difference]: Without dead ends: 11836 [2020-02-10 20:32:44,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2020-02-10 20:32:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 6219. [2020-02-10 20:32:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:32:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34118 transitions. [2020-02-10 20:32:44,721 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34118 transitions. Word has length 34 [2020-02-10 20:32:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:44,721 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34118 transitions. [2020-02-10 20:32:44,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34118 transitions. [2020-02-10 20:32:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:44,732 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:44,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:44,732 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:44,732 INFO L82 PathProgramCache]: Analyzing trace with hash -469787928, now seen corresponding path program 84 times [2020-02-10 20:32:44,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:44,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106866766] [2020-02-10 20:32:44,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:45,297 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:32:45,446 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:32:45,591 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:45,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106866766] [2020-02-10 20:32:45,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:45,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:45,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76113839] [2020-02-10 20:32:45,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:45,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:45,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:45,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:45,603 INFO L87 Difference]: Start difference. First operand 6219 states and 34118 transitions. Second operand 13 states. [2020-02-10 20:32:45,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:45,896 INFO L93 Difference]: Finished difference Result 11857 states and 58466 transitions. [2020-02-10 20:32:45,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:45,897 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:45,926 INFO L225 Difference]: With dead ends: 11857 [2020-02-10 20:32:45,926 INFO L226 Difference]: Without dead ends: 11818 [2020-02-10 20:32:45,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11818 states. [2020-02-10 20:32:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11818 to 6201. [2020-02-10 20:32:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 20:32:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34078 transitions. [2020-02-10 20:32:46,536 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34078 transitions. Word has length 34 [2020-02-10 20:32:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:46,537 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34078 transitions. [2020-02-10 20:32:46,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34078 transitions. [2020-02-10 20:32:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:46,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:46,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:46,548 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash 812092200, now seen corresponding path program 85 times [2020-02-10 20:32:46,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:46,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097360304] [2020-02-10 20:32:46,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:47,174 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:32:47,320 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:47,470 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:47,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097360304] [2020-02-10 20:32:47,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:47,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:47,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716790338] [2020-02-10 20:32:47,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:47,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:47,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:47,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:47,482 INFO L87 Difference]: Start difference. First operand 6201 states and 34078 transitions. Second operand 13 states. [2020-02-10 20:32:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:47,795 INFO L93 Difference]: Finished difference Result 11829 states and 58420 transitions. [2020-02-10 20:32:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:47,795 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:47,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:47,825 INFO L225 Difference]: With dead ends: 11829 [2020-02-10 20:32:47,825 INFO L226 Difference]: Without dead ends: 11810 [2020-02-10 20:32:47,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11810 states. [2020-02-10 20:32:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11810 to 6213. [2020-02-10 20:32:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:32:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34112 transitions. [2020-02-10 20:32:48,440 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34112 transitions. Word has length 34 [2020-02-10 20:32:48,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:48,440 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34112 transitions. [2020-02-10 20:32:48,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:48,440 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34112 transitions. [2020-02-10 20:32:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:48,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:48,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, 1, 1, 1] [2020-02-10 20:32:48,451 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:48,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:48,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1420742862, now seen corresponding path program 86 times [2020-02-10 20:32:48,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:48,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852623974] [2020-02-10 20:32:48,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:49,006 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:32:49,149 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:49,299 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:49,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852623974] [2020-02-10 20:32:49,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:49,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:49,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077456364] [2020-02-10 20:32:49,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:49,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:49,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:49,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:49,312 INFO L87 Difference]: Start difference. First operand 6213 states and 34112 transitions. Second operand 13 states. [2020-02-10 20:32:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:49,618 INFO L93 Difference]: Finished difference Result 11828 states and 58412 transitions. [2020-02-10 20:32:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:49,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:49,649 INFO L225 Difference]: With dead ends: 11828 [2020-02-10 20:32:49,649 INFO L226 Difference]: Without dead ends: 11804 [2020-02-10 20:32:49,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11804 states. [2020-02-10 20:32:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11804 to 6207. [2020-02-10 20:32:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:32:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34095 transitions. [2020-02-10 20:32:50,256 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34095 transitions. Word has length 34 [2020-02-10 20:32:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:50,256 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34095 transitions. [2020-02-10 20:32:50,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34095 transitions. [2020-02-10 20:32:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:50,267 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:50,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:50,267 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:50,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:50,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2018963350, now seen corresponding path program 87 times [2020-02-10 20:32:50,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:50,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714349898] [2020-02-10 20:32:50,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:50,942 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:51,089 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:51,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714349898] [2020-02-10 20:32:51,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:51,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:51,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086786305] [2020-02-10 20:32:51,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:51,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:51,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:51,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:51,101 INFO L87 Difference]: Start difference. First operand 6207 states and 34095 transitions. Second operand 13 states. [2020-02-10 20:32:51,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:51,410 INFO L93 Difference]: Finished difference Result 11833 states and 58423 transitions. [2020-02-10 20:32:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:51,410 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:51,440 INFO L225 Difference]: With dead ends: 11833 [2020-02-10 20:32:51,440 INFO L226 Difference]: Without dead ends: 11814 [2020-02-10 20:32:51,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11814 states. [2020-02-10 20:32:52,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11814 to 6214. [2020-02-10 20:32:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:32:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34108 transitions. [2020-02-10 20:32:52,141 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34108 transitions. Word has length 34 [2020-02-10 20:32:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:52,141 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34108 transitions. [2020-02-10 20:32:52,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34108 transitions. [2020-02-10 20:32:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:52,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:52,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:52,153 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:52,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:52,153 INFO L82 PathProgramCache]: Analyzing trace with hash -859843638, now seen corresponding path program 88 times [2020-02-10 20:32:52,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:52,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392030339] [2020-02-10 20:32:52,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:52,842 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:32:52,993 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:53,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392030339] [2020-02-10 20:32:53,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:53,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:53,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114332593] [2020-02-10 20:32:53,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:53,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:53,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:53,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:53,005 INFO L87 Difference]: Start difference. First operand 6214 states and 34108 transitions. Second operand 13 states. [2020-02-10 20:32:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:53,390 INFO L93 Difference]: Finished difference Result 11835 states and 58420 transitions. [2020-02-10 20:32:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:53,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:53,420 INFO L225 Difference]: With dead ends: 11835 [2020-02-10 20:32:53,420 INFO L226 Difference]: Without dead ends: 11807 [2020-02-10 20:32:53,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:53,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11807 states. [2020-02-10 20:32:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11807 to 6207. [2020-02-10 20:32:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:32:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34089 transitions. [2020-02-10 20:32:54,026 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34089 transitions. Word has length 34 [2020-02-10 20:32:54,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:54,026 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34089 transitions. [2020-02-10 20:32:54,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34089 transitions. [2020-02-10 20:32:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:54,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:54,037 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:54,037 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:54,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:54,038 INFO L82 PathProgramCache]: Analyzing trace with hash 526171826, now seen corresponding path program 89 times [2020-02-10 20:32:54,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:54,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4094566] [2020-02-10 20:32:54,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:54,704 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:32:54,851 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:54,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:54,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4094566] [2020-02-10 20:32:54,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:54,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:54,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492251579] [2020-02-10 20:32:54,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:54,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:54,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:54,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:54,863 INFO L87 Difference]: Start difference. First operand 6207 states and 34089 transitions. Second operand 13 states. [2020-02-10 20:32:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:55,208 INFO L93 Difference]: Finished difference Result 11830 states and 58410 transitions. [2020-02-10 20:32:55,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:55,209 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:55,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:55,237 INFO L225 Difference]: With dead ends: 11830 [2020-02-10 20:32:55,238 INFO L226 Difference]: Without dead ends: 11812 [2020-02-10 20:32:55,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11812 states. [2020-02-10 20:32:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11812 to 6213. [2020-02-10 20:32:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:32:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34100 transitions. [2020-02-10 20:32:55,850 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34100 transitions. Word has length 34 [2020-02-10 20:32:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:55,850 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34100 transitions. [2020-02-10 20:32:55,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34100 transitions. [2020-02-10 20:32:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:55,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:55,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, 1, 1, 1] [2020-02-10 20:32:55,861 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:55,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash 828457700, now seen corresponding path program 90 times [2020-02-10 20:32:55,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:55,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766111230] [2020-02-10 20:32:55,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:56,275 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2020-02-10 20:32:56,632 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:32:56,778 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:56,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766111230] [2020-02-10 20:32:56,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:56,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:56,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200193908] [2020-02-10 20:32:56,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:56,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:56,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:56,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:56,790 INFO L87 Difference]: Start difference. First operand 6213 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:32:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:57,161 INFO L93 Difference]: Finished difference Result 11833 states and 58410 transitions. [2020-02-10 20:32:57,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:57,162 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:57,192 INFO L225 Difference]: With dead ends: 11833 [2020-02-10 20:32:57,192 INFO L226 Difference]: Without dead ends: 11800 [2020-02-10 20:32:57,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11800 states. [2020-02-10 20:32:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11800 to 6201. [2020-02-10 20:32:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 20:32:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34072 transitions. [2020-02-10 20:32:57,801 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34072 transitions. Word has length 34 [2020-02-10 20:32:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:57,801 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34072 transitions. [2020-02-10 20:32:57,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34072 transitions. [2020-02-10 20:32:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:57,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:57,812 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:57,812 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash 800234480, now seen corresponding path program 91 times [2020-02-10 20:32:57,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:57,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324561408] [2020-02-10 20:32:57,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:58,499 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:32:58,652 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:32:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:58,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324561408] [2020-02-10 20:32:58,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:58,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:32:58,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982802759] [2020-02-10 20:32:58,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:32:58,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:58,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:32:58,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:58,665 INFO L87 Difference]: Start difference. First operand 6201 states and 34072 transitions. Second operand 13 states. [2020-02-10 20:32:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:59,103 INFO L93 Difference]: Finished difference Result 11850 states and 58456 transitions. [2020-02-10 20:32:59,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:32:59,103 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:32:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:59,132 INFO L225 Difference]: With dead ends: 11850 [2020-02-10 20:32:59,133 INFO L226 Difference]: Without dead ends: 11826 [2020-02-10 20:32:59,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:32:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2020-02-10 20:32:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 6215. [2020-02-10 20:32:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:32:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34110 transitions. [2020-02-10 20:32:59,743 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34110 transitions. Word has length 34 [2020-02-10 20:32:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:59,743 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34110 transitions. [2020-02-10 20:32:59,743 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:32:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34110 transitions. [2020-02-10 20:32:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:32:59,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:59,754 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:59,754 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:32:59,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1073813086, now seen corresponding path program 92 times [2020-02-10 20:32:59,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:59,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111359705] [2020-02-10 20:32:59,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:00,463 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:33:00,615 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:33:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:00,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111359705] [2020-02-10 20:33:00,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:00,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:00,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833762699] [2020-02-10 20:33:00,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:00,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:00,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:00,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:00,626 INFO L87 Difference]: Start difference. First operand 6215 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:33:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:01,042 INFO L93 Difference]: Finished difference Result 11844 states and 58438 transitions. [2020-02-10 20:33:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:01,043 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:01,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:01,072 INFO L225 Difference]: With dead ends: 11844 [2020-02-10 20:33:01,072 INFO L226 Difference]: Without dead ends: 11819 [2020-02-10 20:33:01,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:01,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11819 states. [2020-02-10 20:33:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11819 to 6208. [2020-02-10 20:33:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:33:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34091 transitions. [2020-02-10 20:33:01,759 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34091 transitions. Word has length 34 [2020-02-10 20:33:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:01,759 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34091 transitions. [2020-02-10 20:33:01,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34091 transitions. [2020-02-10 20:33:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:01,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:01,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:01,772 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:01,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:01,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1581161982, now seen corresponding path program 93 times [2020-02-10 20:33:01,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:01,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910306065] [2020-02-10 20:33:01,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:02,303 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:33:02,455 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:33:02,607 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:33:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:02,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910306065] [2020-02-10 20:33:02,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:02,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:02,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471711060] [2020-02-10 20:33:02,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:02,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:02,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:02,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:02,619 INFO L87 Difference]: Start difference. First operand 6208 states and 34091 transitions. Second operand 13 states. [2020-02-10 20:33:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:02,903 INFO L93 Difference]: Finished difference Result 11856 states and 58464 transitions. [2020-02-10 20:33:02,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:02,904 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:02,934 INFO L225 Difference]: With dead ends: 11856 [2020-02-10 20:33:02,934 INFO L226 Difference]: Without dead ends: 11832 [2020-02-10 20:33:02,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11832 states. [2020-02-10 20:33:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11832 to 6218. [2020-02-10 20:33:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:33:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34109 transitions. [2020-02-10 20:33:03,545 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34109 transitions. Word has length 34 [2020-02-10 20:33:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:03,545 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34109 transitions. [2020-02-10 20:33:03,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34109 transitions. [2020-02-10 20:33:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:03,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:03,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, 1, 1, 1] [2020-02-10 20:33:03,557 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:03,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:03,557 INFO L82 PathProgramCache]: Analyzing trace with hash 327945998, now seen corresponding path program 94 times [2020-02-10 20:33:03,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:03,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35521740] [2020-02-10 20:33:03,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:04,096 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:33:04,243 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:33:04,399 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:33:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:04,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35521740] [2020-02-10 20:33:04,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:04,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:04,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136780526] [2020-02-10 20:33:04,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:04,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:04,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:04,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:04,411 INFO L87 Difference]: Start difference. First operand 6218 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:33:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:04,716 INFO L93 Difference]: Finished difference Result 11853 states and 58449 transitions. [2020-02-10 20:33:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:04,717 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:04,746 INFO L225 Difference]: With dead ends: 11853 [2020-02-10 20:33:04,746 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:33:04,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:33:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6208. [2020-02-10 20:33:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:33:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34084 transitions. [2020-02-10 20:33:05,354 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34084 transitions. Word has length 34 [2020-02-10 20:33:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:05,354 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34084 transitions. [2020-02-10 20:33:05,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34084 transitions. [2020-02-10 20:33:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:05,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:05,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, 1, 1, 1] [2020-02-10 20:33:05,365 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:05,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1076438862, now seen corresponding path program 95 times [2020-02-10 20:33:05,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:05,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204695390] [2020-02-10 20:33:05,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:05,703 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-02-10 20:33:06,129 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:33:06,290 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:33:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:06,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204695390] [2020-02-10 20:33:06,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:06,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:06,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672908212] [2020-02-10 20:33:06,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:06,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:06,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:06,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:06,303 INFO L87 Difference]: Start difference. First operand 6208 states and 34084 transitions. Second operand 13 states. [2020-02-10 20:33:06,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:06,610 INFO L93 Difference]: Finished difference Result 11840 states and 58424 transitions. [2020-02-10 20:33:06,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:06,611 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:06,641 INFO L225 Difference]: With dead ends: 11840 [2020-02-10 20:33:06,642 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:33:06,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:33:07,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6214. [2020-02-10 20:33:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:33:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34095 transitions. [2020-02-10 20:33:07,259 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34095 transitions. Word has length 34 [2020-02-10 20:33:07,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:07,259 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34095 transitions. [2020-02-10 20:33:07,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34095 transitions. [2020-02-10 20:33:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:07,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:07,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:07,270 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:07,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:07,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1378724736, now seen corresponding path program 96 times [2020-02-10 20:33:07,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:07,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275812235] [2020-02-10 20:33:07,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:07,970 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:33:08,114 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:33:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:08,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275812235] [2020-02-10 20:33:08,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:08,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:08,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636854337] [2020-02-10 20:33:08,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:08,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:08,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:08,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:08,126 INFO L87 Difference]: Start difference. First operand 6214 states and 34095 transitions. Second operand 13 states. [2020-02-10 20:33:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:08,433 INFO L93 Difference]: Finished difference Result 11843 states and 58424 transitions. [2020-02-10 20:33:08,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:08,433 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:08,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:08,463 INFO L225 Difference]: With dead ends: 11843 [2020-02-10 20:33:08,463 INFO L226 Difference]: Without dead ends: 11802 [2020-02-10 20:33:08,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11802 states. [2020-02-10 20:33:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11802 to 6194. [2020-02-10 20:33:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6194 states. [2020-02-10 20:33:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6194 states to 6194 states and 34052 transitions. [2020-02-10 20:33:09,072 INFO L78 Accepts]: Start accepts. Automaton has 6194 states and 34052 transitions. Word has length 34 [2020-02-10 20:33:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:09,072 INFO L479 AbstractCegarLoop]: Abstraction has 6194 states and 34052 transitions. [2020-02-10 20:33:09,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 6194 states and 34052 transitions. [2020-02-10 20:33:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:09,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:09,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:09,083 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:09,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:09,083 INFO L82 PathProgramCache]: Analyzing trace with hash -685815432, now seen corresponding path program 97 times [2020-02-10 20:33:09,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:09,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409409322] [2020-02-10 20:33:09,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:09,619 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:33:09,763 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:33:09,910 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:09,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409409322] [2020-02-10 20:33:09,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:09,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:09,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513852055] [2020-02-10 20:33:09,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:09,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:09,922 INFO L87 Difference]: Start difference. First operand 6194 states and 34052 transitions. Second operand 13 states. [2020-02-10 20:33:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:10,276 INFO L93 Difference]: Finished difference Result 11821 states and 58407 transitions. [2020-02-10 20:33:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:10,277 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:10,306 INFO L225 Difference]: With dead ends: 11821 [2020-02-10 20:33:10,307 INFO L226 Difference]: Without dead ends: 11802 [2020-02-10 20:33:10,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11802 states. [2020-02-10 20:33:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11802 to 6212. [2020-02-10 20:33:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:33:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34115 transitions. [2020-02-10 20:33:10,993 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34115 transitions. Word has length 34 [2020-02-10 20:33:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:10,993 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34115 transitions. [2020-02-10 20:33:10,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34115 transitions. [2020-02-10 20:33:11,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:11,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:11,004 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:11,004 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:11,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:11,005 INFO L82 PathProgramCache]: Analyzing trace with hash -77164770, now seen corresponding path program 98 times [2020-02-10 20:33:11,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:11,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284193083] [2020-02-10 20:33:11,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:11,527 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:33:11,671 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:33:11,820 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:11,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284193083] [2020-02-10 20:33:11,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:11,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:11,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464848583] [2020-02-10 20:33:11,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:11,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:11,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:11,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:11,832 INFO L87 Difference]: Start difference. First operand 6212 states and 34115 transitions. Second operand 13 states. [2020-02-10 20:33:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:12,142 INFO L93 Difference]: Finished difference Result 11820 states and 58399 transitions. [2020-02-10 20:33:12,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:12,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:12,173 INFO L225 Difference]: With dead ends: 11820 [2020-02-10 20:33:12,173 INFO L226 Difference]: Without dead ends: 11796 [2020-02-10 20:33:12,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:12,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11796 states. [2020-02-10 20:33:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11796 to 6206. [2020-02-10 20:33:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:33:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34098 transitions. [2020-02-10 20:33:12,781 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34098 transitions. Word has length 34 [2020-02-10 20:33:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:12,781 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34098 transitions. [2020-02-10 20:33:12,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34098 transitions. [2020-02-10 20:33:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:12,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:12,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:12,792 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:12,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:12,792 INFO L82 PathProgramCache]: Analyzing trace with hash -954561860, now seen corresponding path program 99 times [2020-02-10 20:33:12,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:12,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884049172] [2020-02-10 20:33:12,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:13,328 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-02-10 20:33:13,473 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:33:13,618 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:13,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884049172] [2020-02-10 20:33:13,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:13,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:13,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603549937] [2020-02-10 20:33:13,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:13,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:13,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:13,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:13,631 INFO L87 Difference]: Start difference. First operand 6206 states and 34098 transitions. Second operand 13 states. [2020-02-10 20:33:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:13,927 INFO L93 Difference]: Finished difference Result 11826 states and 58412 transitions. [2020-02-10 20:33:13,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:13,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:13,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:13,957 INFO L225 Difference]: With dead ends: 11826 [2020-02-10 20:33:13,958 INFO L226 Difference]: Without dead ends: 11807 [2020-02-10 20:33:13,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11807 states. [2020-02-10 20:33:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11807 to 6213. [2020-02-10 20:33:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:33:14,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34111 transitions. [2020-02-10 20:33:14,567 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34111 transitions. Word has length 34 [2020-02-10 20:33:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:14,568 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34111 transitions. [2020-02-10 20:33:14,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:14,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34111 transitions. [2020-02-10 20:33:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:14,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:14,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:14,579 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:14,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:14,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1163024614, now seen corresponding path program 100 times [2020-02-10 20:33:14,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:14,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789053120] [2020-02-10 20:33:14,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:15,108 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-02-10 20:33:15,369 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:33:15,524 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:15,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789053120] [2020-02-10 20:33:15,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:15,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:15,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211206060] [2020-02-10 20:33:15,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:15,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:15,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:15,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:15,537 INFO L87 Difference]: Start difference. First operand 6213 states and 34111 transitions. Second operand 13 states. [2020-02-10 20:33:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:15,835 INFO L93 Difference]: Finished difference Result 11829 states and 58411 transitions. [2020-02-10 20:33:15,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:15,836 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:15,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:15,866 INFO L225 Difference]: With dead ends: 11829 [2020-02-10 20:33:15,866 INFO L226 Difference]: Without dead ends: 11800 [2020-02-10 20:33:15,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11800 states. [2020-02-10 20:33:16,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11800 to 6206. [2020-02-10 20:33:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:33:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34092 transitions. [2020-02-10 20:33:16,475 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34092 transitions. Word has length 34 [2020-02-10 20:33:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:16,475 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34092 transitions. [2020-02-10 20:33:16,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34092 transitions. [2020-02-10 20:33:16,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:16,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:16,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:16,487 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:16,487 INFO L82 PathProgramCache]: Analyzing trace with hash -366897982, now seen corresponding path program 101 times [2020-02-10 20:33:16,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:16,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605636897] [2020-02-10 20:33:16,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:17,139 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:33:17,284 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:17,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605636897] [2020-02-10 20:33:17,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:17,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:17,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011356269] [2020-02-10 20:33:17,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:17,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:17,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:17,294 INFO L87 Difference]: Start difference. First operand 6206 states and 34092 transitions. Second operand 13 states. [2020-02-10 20:33:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:17,588 INFO L93 Difference]: Finished difference Result 11823 states and 58399 transitions. [2020-02-10 20:33:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:17,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:17,618 INFO L225 Difference]: With dead ends: 11823 [2020-02-10 20:33:17,619 INFO L226 Difference]: Without dead ends: 11805 [2020-02-10 20:33:17,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11805 states. [2020-02-10 20:33:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11805 to 6212. [2020-02-10 20:33:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:33:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34103 transitions. [2020-02-10 20:33:18,227 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34103 transitions. Word has length 34 [2020-02-10 20:33:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:18,228 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34103 transitions. [2020-02-10 20:33:18,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34103 transitions. [2020-02-10 20:33:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:18,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:18,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, 1, 1, 1] [2020-02-10 20:33:18,239 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:18,239 INFO L82 PathProgramCache]: Analyzing trace with hash 525276724, now seen corresponding path program 102 times [2020-02-10 20:33:18,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:18,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635932132] [2020-02-10 20:33:18,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:18,921 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:33:19,074 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:19,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635932132] [2020-02-10 20:33:19,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:19,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:19,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125628125] [2020-02-10 20:33:19,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:19,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:19,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:19,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:19,085 INFO L87 Difference]: Start difference. First operand 6212 states and 34103 transitions. Second operand 13 states. [2020-02-10 20:33:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:19,402 INFO L93 Difference]: Finished difference Result 11827 states and 58401 transitions. [2020-02-10 20:33:19,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:19,402 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:19,432 INFO L225 Difference]: With dead ends: 11827 [2020-02-10 20:33:19,432 INFO L226 Difference]: Without dead ends: 11793 [2020-02-10 20:33:19,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11793 states. [2020-02-10 20:33:20,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11793 to 6200. [2020-02-10 20:33:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6200 states. [2020-02-10 20:33:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 34075 transitions. [2020-02-10 20:33:20,126 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 34075 transitions. Word has length 34 [2020-02-10 20:33:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:20,127 INFO L479 AbstractCegarLoop]: Abstraction has 6200 states and 34075 transitions. [2020-02-10 20:33:20,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 34075 transitions. [2020-02-10 20:33:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:20,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:20,138 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:20,138 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:20,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:20,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2108656526, now seen corresponding path program 103 times [2020-02-10 20:33:20,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:20,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410818455] [2020-02-10 20:33:20,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:20,961 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:33:21,110 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:33:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:21,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410818455] [2020-02-10 20:33:21,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:21,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:21,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614794100] [2020-02-10 20:33:21,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:21,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:21,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:21,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:21,122 INFO L87 Difference]: Start difference. First operand 6200 states and 34075 transitions. Second operand 13 states. [2020-02-10 20:33:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:21,535 INFO L93 Difference]: Finished difference Result 11820 states and 58399 transitions. [2020-02-10 20:33:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:21,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:21,565 INFO L225 Difference]: With dead ends: 11820 [2020-02-10 20:33:21,565 INFO L226 Difference]: Without dead ends: 11801 [2020-02-10 20:33:21,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11801 states. [2020-02-10 20:33:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11801 to 6212. [2020-02-10 20:33:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:33:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34109 transitions. [2020-02-10 20:33:22,175 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34109 transitions. Word has length 34 [2020-02-10 20:33:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:22,175 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34109 transitions. [2020-02-10 20:33:22,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:22,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34109 transitions. [2020-02-10 20:33:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:22,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:22,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:22,186 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:22,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1577660108, now seen corresponding path program 104 times [2020-02-10 20:33:22,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:22,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766359701] [2020-02-10 20:33:22,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:22,731 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:33:22,875 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:33:23,024 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:33:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:23,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766359701] [2020-02-10 20:33:23,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:23,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:23,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453608920] [2020-02-10 20:33:23,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:23,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:23,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:23,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:23,037 INFO L87 Difference]: Start difference. First operand 6212 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:33:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:23,462 INFO L93 Difference]: Finished difference Result 11819 states and 58391 transitions. [2020-02-10 20:33:23,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:23,463 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:23,493 INFO L225 Difference]: With dead ends: 11819 [2020-02-10 20:33:23,493 INFO L226 Difference]: Without dead ends: 11795 [2020-02-10 20:33:23,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11795 states. [2020-02-10 20:33:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11795 to 6206. [2020-02-10 20:33:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:33:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34092 transitions. [2020-02-10 20:33:24,100 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34092 transitions. Word has length 34 [2020-02-10 20:33:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:24,100 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34092 transitions. [2020-02-10 20:33:24,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34092 transitions. [2020-02-10 20:33:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:24,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:24,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, 1, 1, 1] [2020-02-10 20:33:24,111 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash -979439620, now seen corresponding path program 105 times [2020-02-10 20:33:24,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:24,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063775707] [2020-02-10 20:33:24,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:24,643 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 20:33:24,886 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:33:25,038 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:33:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:25,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063775707] [2020-02-10 20:33:25,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:25,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:25,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402504175] [2020-02-10 20:33:25,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:25,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:25,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:25,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:25,051 INFO L87 Difference]: Start difference. First operand 6206 states and 34092 transitions. Second operand 13 states. [2020-02-10 20:33:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:25,351 INFO L93 Difference]: Finished difference Result 11824 states and 58402 transitions. [2020-02-10 20:33:25,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:25,352 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:25,381 INFO L225 Difference]: With dead ends: 11824 [2020-02-10 20:33:25,381 INFO L226 Difference]: Without dead ends: 11805 [2020-02-10 20:33:25,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11805 states. [2020-02-10 20:33:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11805 to 6213. [2020-02-10 20:33:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:33:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34105 transitions. [2020-02-10 20:33:25,991 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34105 transitions. Word has length 34 [2020-02-10 20:33:25,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:25,991 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34105 transitions. [2020-02-10 20:33:25,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34105 transitions. [2020-02-10 20:33:26,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:26,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:26,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:26,002 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:26,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:26,003 INFO L82 PathProgramCache]: Analyzing trace with hash 436720688, now seen corresponding path program 106 times [2020-02-10 20:33:26,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:26,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083837307] [2020-02-10 20:33:26,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:26,658 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:33:26,804 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:33:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:26,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083837307] [2020-02-10 20:33:26,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:26,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:26,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965564098] [2020-02-10 20:33:26,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:26,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:26,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:26,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:26,817 INFO L87 Difference]: Start difference. First operand 6213 states and 34105 transitions. Second operand 13 states. [2020-02-10 20:33:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:27,134 INFO L93 Difference]: Finished difference Result 11826 states and 58399 transitions. [2020-02-10 20:33:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:27,134 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:27,164 INFO L225 Difference]: With dead ends: 11826 [2020-02-10 20:33:27,164 INFO L226 Difference]: Without dead ends: 11798 [2020-02-10 20:33:27,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11798 states. [2020-02-10 20:33:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11798 to 6206. [2020-02-10 20:33:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:33:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34086 transitions. [2020-02-10 20:33:27,777 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34086 transitions. Word has length 34 [2020-02-10 20:33:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:27,777 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34086 transitions. [2020-02-10 20:33:27,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34086 transitions. [2020-02-10 20:33:27,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:27,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:27,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:27,788 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:27,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:27,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1822736152, now seen corresponding path program 107 times [2020-02-10 20:33:27,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:27,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38047116] [2020-02-10 20:33:27,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:28,446 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:33:28,599 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:33:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:28,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38047116] [2020-02-10 20:33:28,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:28,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:28,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388886955] [2020-02-10 20:33:28,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:28,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:28,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:28,610 INFO L87 Difference]: Start difference. First operand 6206 states and 34086 transitions. Second operand 13 states. [2020-02-10 20:33:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:28,977 INFO L93 Difference]: Finished difference Result 11821 states and 58389 transitions. [2020-02-10 20:33:28,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:28,977 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:29,007 INFO L225 Difference]: With dead ends: 11821 [2020-02-10 20:33:29,007 INFO L226 Difference]: Without dead ends: 11803 [2020-02-10 20:33:29,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11803 states. [2020-02-10 20:33:29,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11803 to 6212. [2020-02-10 20:33:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:33:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34097 transitions. [2020-02-10 20:33:29,703 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34097 transitions. Word has length 34 [2020-02-10 20:33:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:29,703 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34097 transitions. [2020-02-10 20:33:29,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34097 transitions. [2020-02-10 20:33:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:29,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:29,715 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:29,715 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2125022026, now seen corresponding path program 108 times [2020-02-10 20:33:29,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:29,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340164871] [2020-02-10 20:33:29,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:30,389 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:33:30,540 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:33:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:30,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340164871] [2020-02-10 20:33:30,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:30,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:30,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917299248] [2020-02-10 20:33:30,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:30,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:30,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:30,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:30,553 INFO L87 Difference]: Start difference. First operand 6212 states and 34097 transitions. Second operand 13 states. [2020-02-10 20:33:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:30,955 INFO L93 Difference]: Finished difference Result 11824 states and 58389 transitions. [2020-02-10 20:33:30,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:30,956 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:30,986 INFO L225 Difference]: With dead ends: 11824 [2020-02-10 20:33:30,986 INFO L226 Difference]: Without dead ends: 11791 [2020-02-10 20:33:30,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11791 states. [2020-02-10 20:33:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11791 to 6200. [2020-02-10 20:33:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6200 states. [2020-02-10 20:33:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 34069 transitions. [2020-02-10 20:33:31,596 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 34069 transitions. Word has length 34 [2020-02-10 20:33:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:31,597 INFO L479 AbstractCegarLoop]: Abstraction has 6200 states and 34069 transitions. [2020-02-10 20:33:31,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 34069 transitions. [2020-02-10 20:33:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:31,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:31,608 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:31,608 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:31,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:31,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2098705422, now seen corresponding path program 109 times [2020-02-10 20:33:31,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:31,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028879008] [2020-02-10 20:33:31,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:32,297 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:33:32,447 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:32,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028879008] [2020-02-10 20:33:32,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:32,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:32,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761437871] [2020-02-10 20:33:32,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:32,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:32,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:32,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:32,459 INFO L87 Difference]: Start difference. First operand 6200 states and 34069 transitions. Second operand 13 states. [2020-02-10 20:33:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:32,814 INFO L93 Difference]: Finished difference Result 11834 states and 58428 transitions. [2020-02-10 20:33:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:32,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:32,844 INFO L225 Difference]: With dead ends: 11834 [2020-02-10 20:33:32,844 INFO L226 Difference]: Without dead ends: 11815 [2020-02-10 20:33:32,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2020-02-10 20:33:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 6214. [2020-02-10 20:33:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:33:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34109 transitions. [2020-02-10 20:33:33,449 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34109 transitions. Word has length 34 [2020-02-10 20:33:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:33,449 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34109 transitions. [2020-02-10 20:33:33,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34109 transitions. [2020-02-10 20:33:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:33,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:33,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, 1, 1, 1] [2020-02-10 20:33:33,460 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:33,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:33,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1890242668, now seen corresponding path program 110 times [2020-02-10 20:33:33,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:33,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566465852] [2020-02-10 20:33:33,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:34,136 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:33:34,284 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:34,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566465852] [2020-02-10 20:33:34,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:34,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:34,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6589610] [2020-02-10 20:33:34,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:34,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:34,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:34,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:34,299 INFO L87 Difference]: Start difference. First operand 6214 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:33:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:34,698 INFO L93 Difference]: Finished difference Result 11837 states and 58427 transitions. [2020-02-10 20:33:34,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:34,699 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:34,729 INFO L225 Difference]: With dead ends: 11837 [2020-02-10 20:33:34,729 INFO L226 Difference]: Without dead ends: 11808 [2020-02-10 20:33:34,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11808 states. [2020-02-10 20:33:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11808 to 6207. [2020-02-10 20:33:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:33:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34089 transitions. [2020-02-10 20:33:35,341 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34089 transitions. Word has length 34 [2020-02-10 20:33:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:35,341 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34089 transitions. [2020-02-10 20:33:35,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34089 transitions. [2020-02-10 20:33:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:35,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:35,352 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:35,352 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:35,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:35,353 INFO L82 PathProgramCache]: Analyzing trace with hash -720644296, now seen corresponding path program 111 times [2020-02-10 20:33:35,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:35,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895100592] [2020-02-10 20:33:35,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:36,029 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:33:36,177 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:33:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:36,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895100592] [2020-02-10 20:33:36,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:36,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:36,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015696414] [2020-02-10 20:33:36,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:36,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:36,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:36,190 INFO L87 Difference]: Start difference. First operand 6207 states and 34089 transitions. Second operand 13 states. [2020-02-10 20:33:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:36,597 INFO L93 Difference]: Finished difference Result 11833 states and 58419 transitions. [2020-02-10 20:33:36,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:36,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:36,627 INFO L225 Difference]: With dead ends: 11833 [2020-02-10 20:33:36,628 INFO L226 Difference]: Without dead ends: 11814 [2020-02-10 20:33:36,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11814 states. [2020-02-10 20:33:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11814 to 6214. [2020-02-10 20:33:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:33:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34102 transitions. [2020-02-10 20:33:37,235 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34102 transitions. Word has length 34 [2020-02-10 20:33:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:37,235 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34102 transitions. [2020-02-10 20:33:37,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34102 transitions. [2020-02-10 20:33:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:37,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:37,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:37,247 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:37,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:37,247 INFO L82 PathProgramCache]: Analyzing trace with hash 695516012, now seen corresponding path program 112 times [2020-02-10 20:33:37,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:37,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803140050] [2020-02-10 20:33:37,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:37,917 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:33:38,065 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:33:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:38,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803140050] [2020-02-10 20:33:38,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:38,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:38,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626698212] [2020-02-10 20:33:38,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:38,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:38,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:38,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:38,078 INFO L87 Difference]: Start difference. First operand 6214 states and 34102 transitions. Second operand 13 states. [2020-02-10 20:33:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:38,481 INFO L93 Difference]: Finished difference Result 11835 states and 58416 transitions. [2020-02-10 20:33:38,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:38,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:38,511 INFO L225 Difference]: With dead ends: 11835 [2020-02-10 20:33:38,511 INFO L226 Difference]: Without dead ends: 11807 [2020-02-10 20:33:38,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11807 states. [2020-02-10 20:33:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11807 to 6207. [2020-02-10 20:33:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:33:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34082 transitions. [2020-02-10 20:33:39,243 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34082 transitions. Word has length 34 [2020-02-10 20:33:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:39,243 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34082 transitions. [2020-02-10 20:33:39,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34082 transitions. [2020-02-10 20:33:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:39,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:39,255 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:39,255 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:39,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1453428040, now seen corresponding path program 113 times [2020-02-10 20:33:39,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:39,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537453637] [2020-02-10 20:33:39,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:39,783 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:33:39,927 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:33:40,076 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:40,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-02-10 20:33:40,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537453637] [2020-02-10 20:33:40,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:40,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:40,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25414757] [2020-02-10 20:33:40,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:40,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:40,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:40,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:40,088 INFO L87 Difference]: Start difference. First operand 6207 states and 34082 transitions. Second operand 13 states. [2020-02-10 20:33:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:40,458 INFO L93 Difference]: Finished difference Result 11841 states and 58430 transitions. [2020-02-10 20:33:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:40,459 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:40,488 INFO L225 Difference]: With dead ends: 11841 [2020-02-10 20:33:40,488 INFO L226 Difference]: Without dead ends: 11819 [2020-02-10 20:33:40,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11819 states. [2020-02-10 20:33:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11819 to 6216. [2020-02-10 20:33:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:33:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34099 transitions. [2020-02-10 20:33:41,098 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34099 transitions. Word has length 34 [2020-02-10 20:33:41,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:41,098 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34099 transitions. [2020-02-10 20:33:41,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34099 transitions. [2020-02-10 20:33:41,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:41,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:41,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:41,109 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:41,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:41,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1471862066, now seen corresponding path program 114 times [2020-02-10 20:33:41,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:41,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040847151] [2020-02-10 20:33:41,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:41,650 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:33:41,797 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:33:41,949 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:33:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:41,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040847151] [2020-02-10 20:33:41,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:41,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:41,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065576316] [2020-02-10 20:33:41,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:41,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:41,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:41,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:41,960 INFO L87 Difference]: Start difference. First operand 6216 states and 34099 transitions. Second operand 13 states. [2020-02-10 20:33:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:42,337 INFO L93 Difference]: Finished difference Result 11840 states and 58419 transitions. [2020-02-10 20:33:42,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:42,338 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:42,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:42,367 INFO L225 Difference]: With dead ends: 11840 [2020-02-10 20:33:42,367 INFO L226 Difference]: Without dead ends: 11803 [2020-02-10 20:33:42,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11803 states. [2020-02-10 20:33:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11803 to 6200. [2020-02-10 20:33:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6200 states. [2020-02-10 20:33:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 34063 transitions. [2020-02-10 20:33:42,978 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 34063 transitions. Word has length 34 [2020-02-10 20:33:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:42,978 INFO L479 AbstractCegarLoop]: Abstraction has 6200 states and 34063 transitions. [2020-02-10 20:33:42,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 34063 transitions. [2020-02-10 20:33:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:42,989 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:42,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, 1, 1, 1] [2020-02-10 20:33:42,989 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:42,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:42,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1966170974, now seen corresponding path program 115 times [2020-02-10 20:33:42,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:42,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239115104] [2020-02-10 20:33:42,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:43,648 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:33:43,803 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:43,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239115104] [2020-02-10 20:33:43,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:43,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:43,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599454601] [2020-02-10 20:33:43,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:43,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:43,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:43,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:43,814 INFO L87 Difference]: Start difference. First operand 6200 states and 34063 transitions. Second operand 13 states. [2020-02-10 20:33:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:44,113 INFO L93 Difference]: Finished difference Result 11827 states and 58403 transitions. [2020-02-10 20:33:44,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:44,114 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:44,238 INFO L225 Difference]: With dead ends: 11827 [2020-02-10 20:33:44,238 INFO L226 Difference]: Without dead ends: 11809 [2020-02-10 20:33:44,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:44,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11809 states. [2020-02-10 20:33:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11809 to 6212. [2020-02-10 20:33:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:33:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34097 transitions. [2020-02-10 20:33:44,837 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34097 transitions. Word has length 34 [2020-02-10 20:33:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:44,837 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34097 transitions. [2020-02-10 20:33:44,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34097 transitions. [2020-02-10 20:33:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:44,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:44,848 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:44,848 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:44,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:44,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1436621616, now seen corresponding path program 116 times [2020-02-10 20:33:44,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:44,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799237051] [2020-02-10 20:33:44,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:45,523 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:33:45,673 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:45,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799237051] [2020-02-10 20:33:45,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:45,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:45,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703567543] [2020-02-10 20:33:45,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:45,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:45,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:45,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:45,685 INFO L87 Difference]: Start difference. First operand 6212 states and 34097 transitions. Second operand 13 states. [2020-02-10 20:33:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:45,972 INFO L93 Difference]: Finished difference Result 11831 states and 58405 transitions. [2020-02-10 20:33:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:45,973 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:46,002 INFO L225 Difference]: With dead ends: 11831 [2020-02-10 20:33:46,002 INFO L226 Difference]: Without dead ends: 11803 [2020-02-10 20:33:46,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11803 states. [2020-02-10 20:33:46,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11803 to 6206. [2020-02-10 20:33:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:33:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34080 transitions. [2020-02-10 20:33:46,616 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34080 transitions. Word has length 34 [2020-02-10 20:33:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:46,617 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34080 transitions. [2020-02-10 20:33:46,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34080 transitions. [2020-02-10 20:33:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:46,628 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:46,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:46,628 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:46,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:46,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1430941172, now seen corresponding path program 117 times [2020-02-10 20:33:46,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:46,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673503892] [2020-02-10 20:33:46,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:47,312 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:33:47,462 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:33:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:47,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673503892] [2020-02-10 20:33:47,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:47,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:47,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158061772] [2020-02-10 20:33:47,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:47,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:47,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:47,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:47,474 INFO L87 Difference]: Start difference. First operand 6206 states and 34080 transitions. Second operand 13 states. [2020-02-10 20:33:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:47,802 INFO L93 Difference]: Finished difference Result 11826 states and 58395 transitions. [2020-02-10 20:33:47,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:47,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:47,832 INFO L225 Difference]: With dead ends: 11826 [2020-02-10 20:33:47,832 INFO L226 Difference]: Without dead ends: 11808 [2020-02-10 20:33:47,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:48,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11808 states. [2020-02-10 20:33:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11808 to 6212. [2020-02-10 20:33:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:33:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34091 transitions. [2020-02-10 20:33:48,442 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34091 transitions. Word has length 34 [2020-02-10 20:33:48,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:48,442 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34091 transitions. [2020-02-10 20:33:48,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34091 transitions. [2020-02-10 20:33:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:48,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:48,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:48,453 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:48,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1733227046, now seen corresponding path program 118 times [2020-02-10 20:33:48,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:48,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081705682] [2020-02-10 20:33:48,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:49,078 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2020-02-10 20:33:49,225 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:33:49,374 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:33:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:49,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081705682] [2020-02-10 20:33:49,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:49,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:49,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471438733] [2020-02-10 20:33:49,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:49,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:49,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:49,386 INFO L87 Difference]: Start difference. First operand 6212 states and 34091 transitions. Second operand 13 states. [2020-02-10 20:33:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:49,685 INFO L93 Difference]: Finished difference Result 11829 states and 58395 transitions. [2020-02-10 20:33:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:49,685 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:49,715 INFO L225 Difference]: With dead ends: 11829 [2020-02-10 20:33:49,715 INFO L226 Difference]: Without dead ends: 11802 [2020-02-10 20:33:49,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11802 states. [2020-02-10 20:33:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11802 to 6206. [2020-02-10 20:33:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:33:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34074 transitions. [2020-02-10 20:33:50,329 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34074 transitions. Word has length 34 [2020-02-10 20:33:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:50,330 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34074 transitions. [2020-02-10 20:33:50,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34074 transitions. [2020-02-10 20:33:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:50,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:50,341 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:50,341 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:50,341 INFO L82 PathProgramCache]: Analyzing trace with hash -655694114, now seen corresponding path program 119 times [2020-02-10 20:33:50,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:50,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053330537] [2020-02-10 20:33:50,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:50,877 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:33:51,019 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:33:51,166 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:51,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053330537] [2020-02-10 20:33:51,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:51,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:51,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819510930] [2020-02-10 20:33:51,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:51,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:51,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:51,178 INFO L87 Difference]: Start difference. First operand 6206 states and 34074 transitions. Second operand 13 states. [2020-02-10 20:33:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:51,471 INFO L93 Difference]: Finished difference Result 11837 states and 58414 transitions. [2020-02-10 20:33:51,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:51,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:51,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:51,502 INFO L225 Difference]: With dead ends: 11837 [2020-02-10 20:33:51,502 INFO L226 Difference]: Without dead ends: 11815 [2020-02-10 20:33:51,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2020-02-10 20:33:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 6215. [2020-02-10 20:33:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:33:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34091 transitions. [2020-02-10 20:33:52,111 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34091 transitions. Word has length 34 [2020-02-10 20:33:52,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:52,111 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34091 transitions. [2020-02-10 20:33:52,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34091 transitions. [2020-02-10 20:33:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:52,122 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:52,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, 1, 1, 1] [2020-02-10 20:33:52,122 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:52,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:52,123 INFO L82 PathProgramCache]: Analyzing trace with hash -674128140, now seen corresponding path program 120 times [2020-02-10 20:33:52,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:52,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104286400] [2020-02-10 20:33:52,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:52,655 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:33:52,808 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:33:52,967 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:33:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:52,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104286400] [2020-02-10 20:33:52,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:52,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:52,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572518530] [2020-02-10 20:33:52,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:52,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:52,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:52,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:52,982 INFO L87 Difference]: Start difference. First operand 6215 states and 34091 transitions. Second operand 13 states. [2020-02-10 20:33:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:53,334 INFO L93 Difference]: Finished difference Result 11836 states and 58403 transitions. [2020-02-10 20:33:53,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:53,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:53,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:53,363 INFO L225 Difference]: With dead ends: 11836 [2020-02-10 20:33:53,363 INFO L226 Difference]: Without dead ends: 11785 [2020-02-10 20:33:53,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:53,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11785 states. [2020-02-10 20:33:54,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11785 to 6185. [2020-02-10 20:33:54,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2020-02-10 20:33:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 34029 transitions. [2020-02-10 20:33:54,070 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 34029 transitions. Word has length 34 [2020-02-10 20:33:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:54,070 INFO L479 AbstractCegarLoop]: Abstraction has 6185 states and 34029 transitions. [2020-02-10 20:33:54,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 34029 transitions. [2020-02-10 20:33:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:54,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:54,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:54,081 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:54,081 INFO L82 PathProgramCache]: Analyzing trace with hash -107252240, now seen corresponding path program 121 times [2020-02-10 20:33:54,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:54,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505893974] [2020-02-10 20:33:54,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:54,637 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:33:54,786 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:33:54,934 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:33:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:54,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505893974] [2020-02-10 20:33:54,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:54,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:54,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884374546] [2020-02-10 20:33:54,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:54,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:54,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:54,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:54,951 INFO L87 Difference]: Start difference. First operand 6185 states and 34029 transitions. Second operand 13 states. [2020-02-10 20:33:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:55,258 INFO L93 Difference]: Finished difference Result 11918 states and 58698 transitions. [2020-02-10 20:33:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:55,259 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:55,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:55,288 INFO L225 Difference]: With dead ends: 11918 [2020-02-10 20:33:55,289 INFO L226 Difference]: Without dead ends: 11894 [2020-02-10 20:33:55,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11894 states. [2020-02-10 20:33:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11894 to 6228. [2020-02-10 20:33:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 20:33:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34181 transitions. [2020-02-10 20:33:55,899 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34181 transitions. Word has length 34 [2020-02-10 20:33:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:55,899 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34181 transitions. [2020-02-10 20:33:55,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34181 transitions. [2020-02-10 20:33:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:55,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:55,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:55,911 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:55,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:55,911 INFO L82 PathProgramCache]: Analyzing trace with hash -743719094, now seen corresponding path program 122 times [2020-02-10 20:33:55,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:55,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891222587] [2020-02-10 20:33:55,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:56,473 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:33:56,617 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:33:56,768 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:33:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:56,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891222587] [2020-02-10 20:33:56,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:56,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:56,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588757393] [2020-02-10 20:33:56,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:56,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:56,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:56,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:56,781 INFO L87 Difference]: Start difference. First operand 6228 states and 34181 transitions. Second operand 13 states. [2020-02-10 20:33:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:57,107 INFO L93 Difference]: Finished difference Result 11916 states and 58684 transitions. [2020-02-10 20:33:57,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:57,108 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:57,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:57,137 INFO L225 Difference]: With dead ends: 11916 [2020-02-10 20:33:57,138 INFO L226 Difference]: Without dead ends: 11882 [2020-02-10 20:33:57,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11882 states. [2020-02-10 20:33:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11882 to 6216. [2020-02-10 20:33:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:33:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34151 transitions. [2020-02-10 20:33:57,750 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34151 transitions. Word has length 34 [2020-02-10 20:33:57,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:57,750 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34151 transitions. [2020-02-10 20:33:57,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34151 transitions. [2020-02-10 20:33:57,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:57,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:57,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, 1, 1, 1] [2020-02-10 20:33:57,762 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:57,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:57,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1656002464, now seen corresponding path program 123 times [2020-02-10 20:33:57,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:57,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579491400] [2020-02-10 20:33:57,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:58,329 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:33:58,473 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:33:58,625 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:33:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:58,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579491400] [2020-02-10 20:33:58,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:58,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:33:58,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053984947] [2020-02-10 20:33:58,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:33:58,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:58,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:33:58,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:58,638 INFO L87 Difference]: Start difference. First operand 6216 states and 34151 transitions. Second operand 13 states. [2020-02-10 20:33:59,110 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2020-02-10 20:33:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:59,136 INFO L93 Difference]: Finished difference Result 11906 states and 58664 transitions. [2020-02-10 20:33:59,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:33:59,138 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:33:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:59,169 INFO L225 Difference]: With dead ends: 11906 [2020-02-10 20:33:59,169 INFO L226 Difference]: Without dead ends: 11887 [2020-02-10 20:33:59,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:33:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-02-10 20:33:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 6224. [2020-02-10 20:33:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2020-02-10 20:33:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 34166 transitions. [2020-02-10 20:33:59,775 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 34166 transitions. Word has length 34 [2020-02-10 20:33:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:59,775 INFO L479 AbstractCegarLoop]: Abstraction has 6224 states and 34166 transitions. [2020-02-10 20:33:59,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:33:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 34166 transitions. [2020-02-10 20:33:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:33:59,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:59,786 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:59,786 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:33:59,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash 671066180, now seen corresponding path program 124 times [2020-02-10 20:33:59,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:59,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895179132] [2020-02-10 20:33:59,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:00,351 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:34:00,501 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:34:00,651 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:34:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:00,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895179132] [2020-02-10 20:34:00,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:00,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:00,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128512004] [2020-02-10 20:34:00,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:00,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:00,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:00,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:00,664 INFO L87 Difference]: Start difference. First operand 6224 states and 34166 transitions. Second operand 13 states. [2020-02-10 20:34:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:01,066 INFO L93 Difference]: Finished difference Result 11911 states and 58666 transitions. [2020-02-10 20:34:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:01,067 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:01,097 INFO L225 Difference]: With dead ends: 11911 [2020-02-10 20:34:01,097 INFO L226 Difference]: Without dead ends: 11879 [2020-02-10 20:34:01,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2020-02-10 20:34:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 6216. [2020-02-10 20:34:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:34:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34143 transitions. [2020-02-10 20:34:01,707 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34143 transitions. Word has length 34 [2020-02-10 20:34:01,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:01,707 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34143 transitions. [2020-02-10 20:34:01,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34143 transitions. [2020-02-10 20:34:01,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:01,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:01,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, 1, 1, 1] [2020-02-10 20:34:01,718 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:01,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:01,718 INFO L82 PathProgramCache]: Analyzing trace with hash -894600826, now seen corresponding path program 125 times [2020-02-10 20:34:01,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:01,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618949310] [2020-02-10 20:34:01,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:02,419 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:34:02,568 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:34:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:02,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618949310] [2020-02-10 20:34:02,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:02,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:02,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199185065] [2020-02-10 20:34:02,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:02,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:02,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:02,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:02,580 INFO L87 Difference]: Start difference. First operand 6216 states and 34143 transitions. Second operand 13 states. [2020-02-10 20:34:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:02,904 INFO L93 Difference]: Finished difference Result 11903 states and 58651 transitions. [2020-02-10 20:34:02,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:02,905 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:02,935 INFO L225 Difference]: With dead ends: 11903 [2020-02-10 20:34:02,935 INFO L226 Difference]: Without dead ends: 11884 [2020-02-10 20:34:02,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11884 states. [2020-02-10 20:34:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11884 to 6223. [2020-02-10 20:34:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:34:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34156 transitions. [2020-02-10 20:34:03,548 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34156 transitions. Word has length 34 [2020-02-10 20:34:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:03,549 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34156 transitions. [2020-02-10 20:34:03,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34156 transitions. [2020-02-10 20:34:03,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:03,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:03,560 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:03,561 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:03,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:03,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1103063580, now seen corresponding path program 126 times [2020-02-10 20:34:03,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:03,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182475637] [2020-02-10 20:34:03,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:03,924 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2020-02-10 20:34:04,376 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:34:04,522 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:34:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:04,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182475637] [2020-02-10 20:34:04,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:04,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:04,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406843800] [2020-02-10 20:34:04,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:04,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:04,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:04,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:04,534 INFO L87 Difference]: Start difference. First operand 6223 states and 34156 transitions. Second operand 13 states. [2020-02-10 20:34:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:04,907 INFO L93 Difference]: Finished difference Result 11906 states and 58650 transitions. [2020-02-10 20:34:04,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:04,908 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:04,939 INFO L225 Difference]: With dead ends: 11906 [2020-02-10 20:34:04,939 INFO L226 Difference]: Without dead ends: 11868 [2020-02-10 20:34:04,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2020-02-10 20:34:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 6207. [2020-02-10 20:34:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:34:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34119 transitions. [2020-02-10 20:34:05,551 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34119 transitions. Word has length 34 [2020-02-10 20:34:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:05,551 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34119 transitions. [2020-02-10 20:34:05,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34119 transitions. [2020-02-10 20:34:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:05,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:05,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, 1, 1, 1] [2020-02-10 20:34:05,562 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:05,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:05,562 INFO L82 PathProgramCache]: Analyzing trace with hash 214145790, now seen corresponding path program 127 times [2020-02-10 20:34:05,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:05,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453101696] [2020-02-10 20:34:05,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:06,131 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:34:06,280 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2020-02-10 20:34:06,429 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2020-02-10 20:34:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:06,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453101696] [2020-02-10 20:34:06,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:06,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:06,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209456402] [2020-02-10 20:34:06,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:06,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:06,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:06,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:06,444 INFO L87 Difference]: Start difference. First operand 6207 states and 34119 transitions. Second operand 13 states. [2020-02-10 20:34:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:06,729 INFO L93 Difference]: Finished difference Result 11927 states and 58714 transitions. [2020-02-10 20:34:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:06,729 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:06,758 INFO L225 Difference]: With dead ends: 11927 [2020-02-10 20:34:06,759 INFO L226 Difference]: Without dead ends: 11903 [2020-02-10 20:34:06,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11903 states. [2020-02-10 20:34:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11903 to 6231. [2020-02-10 20:34:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2020-02-10 20:34:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 34181 transitions. [2020-02-10 20:34:07,368 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 34181 transitions. Word has length 34 [2020-02-10 20:34:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:07,368 INFO L479 AbstractCegarLoop]: Abstraction has 6231 states and 34181 transitions. [2020-02-10 20:34:07,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 34181 transitions. [2020-02-10 20:34:07,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:07,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:07,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, 1, 1, 1] [2020-02-10 20:34:07,379 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash -422321064, now seen corresponding path program 128 times [2020-02-10 20:34:07,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:07,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481491614] [2020-02-10 20:34:07,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:07,952 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:34:08,100 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:34:08,252 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:34:08,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-02-10 20:34:08,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481491614] [2020-02-10 20:34:08,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:08,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:08,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475616150] [2020-02-10 20:34:08,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:08,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:08,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:08,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:08,265 INFO L87 Difference]: Start difference. First operand 6231 states and 34181 transitions. Second operand 13 states. [2020-02-10 20:34:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:08,578 INFO L93 Difference]: Finished difference Result 11925 states and 58700 transitions. [2020-02-10 20:34:08,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:08,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:08,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:08,607 INFO L225 Difference]: With dead ends: 11925 [2020-02-10 20:34:08,607 INFO L226 Difference]: Without dead ends: 11891 [2020-02-10 20:34:08,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2020-02-10 20:34:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 6219. [2020-02-10 20:34:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:34:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34149 transitions. [2020-02-10 20:34:09,310 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34149 transitions. Word has length 34 [2020-02-10 20:34:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:09,310 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34149 transitions. [2020-02-10 20:34:09,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34149 transitions. [2020-02-10 20:34:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:09,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:09,321 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:09,321 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:09,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:09,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1142165220, now seen corresponding path program 129 times [2020-02-10 20:34:09,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:09,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966731892] [2020-02-10 20:34:09,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:09,890 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:34:10,038 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:34:10,202 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:34:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:10,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966731892] [2020-02-10 20:34:10,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:10,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:10,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828558256] [2020-02-10 20:34:10,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:10,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:10,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:10,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:10,214 INFO L87 Difference]: Start difference. First operand 6219 states and 34149 transitions. Second operand 13 states. [2020-02-10 20:34:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:10,590 INFO L93 Difference]: Finished difference Result 11924 states and 58697 transitions. [2020-02-10 20:34:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:10,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:10,620 INFO L225 Difference]: With dead ends: 11924 [2020-02-10 20:34:10,620 INFO L226 Difference]: Without dead ends: 11900 [2020-02-10 20:34:10,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2020-02-10 20:34:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 6229. [2020-02-10 20:34:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6229 states. [2020-02-10 20:34:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6229 states to 6229 states and 34167 transitions. [2020-02-10 20:34:11,231 INFO L78 Accepts]: Start accepts. Automaton has 6229 states and 34167 transitions. Word has length 34 [2020-02-10 20:34:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:11,231 INFO L479 AbstractCegarLoop]: Abstraction has 6229 states and 34167 transitions. [2020-02-10 20:34:11,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 6229 states and 34167 transitions. [2020-02-10 20:34:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:11,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:11,242 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:11,242 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:11,242 INFO L82 PathProgramCache]: Analyzing trace with hash -555079724, now seen corresponding path program 130 times [2020-02-10 20:34:11,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:11,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501507489] [2020-02-10 20:34:11,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:11,807 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:34:11,954 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:34:12,102 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:34:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:12,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501507489] [2020-02-10 20:34:12,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:12,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:12,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486635478] [2020-02-10 20:34:12,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:12,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:12,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:12,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:12,115 INFO L87 Difference]: Start difference. First operand 6229 states and 34167 transitions. Second operand 13 states. [2020-02-10 20:34:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:12,445 INFO L93 Difference]: Finished difference Result 11921 states and 58682 transitions. [2020-02-10 20:34:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:12,445 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:12,476 INFO L225 Difference]: With dead ends: 11921 [2020-02-10 20:34:12,476 INFO L226 Difference]: Without dead ends: 11890 [2020-02-10 20:34:12,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:12,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11890 states. [2020-02-10 20:34:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11890 to 6219. [2020-02-10 20:34:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:34:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34139 transitions. [2020-02-10 20:34:13,084 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34139 transitions. Word has length 34 [2020-02-10 20:34:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:13,084 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34139 transitions. [2020-02-10 20:34:13,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34139 transitions. [2020-02-10 20:34:13,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:13,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:13,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:13,095 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:13,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:13,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2044904924, now seen corresponding path program 131 times [2020-02-10 20:34:13,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:13,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431003804] [2020-02-10 20:34:13,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:13,664 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:34:13,808 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:34:13,962 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:34:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:13,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431003804] [2020-02-10 20:34:13,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:13,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:13,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530268826] [2020-02-10 20:34:13,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:13,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:13,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:13,975 INFO L87 Difference]: Start difference. First operand 6219 states and 34139 transitions. Second operand 13 states. [2020-02-10 20:34:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:14,444 INFO L93 Difference]: Finished difference Result 11919 states and 58679 transitions. [2020-02-10 20:34:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:14,444 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:14,474 INFO L225 Difference]: With dead ends: 11919 [2020-02-10 20:34:14,474 INFO L226 Difference]: Without dead ends: 11897 [2020-02-10 20:34:14,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11897 states. [2020-02-10 20:34:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11897 to 6228. [2020-02-10 20:34:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 20:34:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34156 transitions. [2020-02-10 20:34:15,081 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34156 transitions. Word has length 34 [2020-02-10 20:34:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:15,082 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34156 transitions. [2020-02-10 20:34:15,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34156 transitions. [2020-02-10 20:34:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:15,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:15,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, 1, 1, 1] [2020-02-10 20:34:15,093 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:15,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:15,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1189284282, now seen corresponding path program 132 times [2020-02-10 20:34:15,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:15,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784765985] [2020-02-10 20:34:15,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:15,681 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:34:15,827 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:34:15,977 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:34:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:15,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784765985] [2020-02-10 20:34:15,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:15,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:15,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370164200] [2020-02-10 20:34:15,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:15,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:15,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:15,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:15,990 INFO L87 Difference]: Start difference. First operand 6228 states and 34156 transitions. Second operand 13 states. [2020-02-10 20:34:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:16,317 INFO L93 Difference]: Finished difference Result 11918 states and 58668 transitions. [2020-02-10 20:34:16,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:16,317 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:16,347 INFO L225 Difference]: With dead ends: 11918 [2020-02-10 20:34:16,347 INFO L226 Difference]: Without dead ends: 11876 [2020-02-10 20:34:16,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11876 states. [2020-02-10 20:34:16,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11876 to 6207. [2020-02-10 20:34:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:34:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34109 transitions. [2020-02-10 20:34:16,958 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34109 transitions. Word has length 34 [2020-02-10 20:34:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:16,958 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34109 transitions. [2020-02-10 20:34:16,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34109 transitions. [2020-02-10 20:34:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:16,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:16,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, 1, 1, 1] [2020-02-10 20:34:16,969 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:16,969 INFO L82 PathProgramCache]: Analyzing trace with hash 359833722, now seen corresponding path program 133 times [2020-02-10 20:34:16,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:16,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295155342] [2020-02-10 20:34:16,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:17,518 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:34:17,663 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:34:17,812 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:34:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:17,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295155342] [2020-02-10 20:34:17,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:17,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:17,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96485585] [2020-02-10 20:34:17,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:17,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:17,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:17,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:17,825 INFO L87 Difference]: Start difference. First operand 6207 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:34:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:18,192 INFO L93 Difference]: Finished difference Result 11902 states and 58646 transitions. [2020-02-10 20:34:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:18,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:18,223 INFO L225 Difference]: With dead ends: 11902 [2020-02-10 20:34:18,223 INFO L226 Difference]: Without dead ends: 11883 [2020-02-10 20:34:18,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2020-02-10 20:34:18,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 6223. [2020-02-10 20:34:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:34:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34154 transitions. [2020-02-10 20:34:18,836 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34154 transitions. Word has length 34 [2020-02-10 20:34:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:18,836 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34154 transitions. [2020-02-10 20:34:18,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34154 transitions. [2020-02-10 20:34:18,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:18,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:18,846 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:18,846 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:18,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:18,847 INFO L82 PathProgramCache]: Analyzing trace with hash -625102562, now seen corresponding path program 134 times [2020-02-10 20:34:18,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:18,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668525449] [2020-02-10 20:34:18,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:19,193 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2020-02-10 20:34:19,505 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:34:19,653 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:34:19,804 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:34:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:19,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668525449] [2020-02-10 20:34:19,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:19,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:19,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969965481] [2020-02-10 20:34:19,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:19,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:19,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:19,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:19,817 INFO L87 Difference]: Start difference. First operand 6223 states and 34154 transitions. Second operand 13 states. [2020-02-10 20:34:20,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:20,220 INFO L93 Difference]: Finished difference Result 11907 states and 58648 transitions. [2020-02-10 20:34:20,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:20,220 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:20,250 INFO L225 Difference]: With dead ends: 11907 [2020-02-10 20:34:20,250 INFO L226 Difference]: Without dead ends: 11875 [2020-02-10 20:34:20,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2020-02-10 20:34:20,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 6215. [2020-02-10 20:34:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:34:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34131 transitions. [2020-02-10 20:34:20,858 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34131 transitions. Word has length 34 [2020-02-10 20:34:20,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:20,858 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34131 transitions. [2020-02-10 20:34:20,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:20,858 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34131 transitions. [2020-02-10 20:34:20,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:20,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:20,869 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:20,869 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:20,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:20,869 INFO L82 PathProgramCache]: Analyzing trace with hash -715151990, now seen corresponding path program 135 times [2020-02-10 20:34:20,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:20,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764695087] [2020-02-10 20:34:20,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:21,546 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:34:21,696 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:34:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:21,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764695087] [2020-02-10 20:34:21,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:21,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:21,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055770903] [2020-02-10 20:34:21,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:21,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:21,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:21,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:21,708 INFO L87 Difference]: Start difference. First operand 6215 states and 34131 transitions. Second operand 13 states. [2020-02-10 20:34:22,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:22,147 INFO L93 Difference]: Finished difference Result 11898 states and 58631 transitions. [2020-02-10 20:34:22,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:22,147 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:22,177 INFO L225 Difference]: With dead ends: 11898 [2020-02-10 20:34:22,177 INFO L226 Difference]: Without dead ends: 11879 [2020-02-10 20:34:22,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2020-02-10 20:34:22,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 6222. [2020-02-10 20:34:22,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:34:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34144 transitions. [2020-02-10 20:34:22,784 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34144 transitions. Word has length 34 [2020-02-10 20:34:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:22,784 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34144 transitions. [2020-02-10 20:34:22,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34144 transitions. [2020-02-10 20:34:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:22,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:22,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, 1, 1, 1] [2020-02-10 20:34:22,795 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:22,795 INFO L82 PathProgramCache]: Analyzing trace with hash 701008318, now seen corresponding path program 136 times [2020-02-10 20:34:22,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:22,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724257881] [2020-02-10 20:34:22,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:23,480 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:34:23,631 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:34:23,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-02-10 20:34:23,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724257881] [2020-02-10 20:34:23,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:23,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:23,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993369637] [2020-02-10 20:34:23,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:23,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:23,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:23,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:23,642 INFO L87 Difference]: Start difference. First operand 6222 states and 34144 transitions. Second operand 13 states. [2020-02-10 20:34:24,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:24,141 INFO L93 Difference]: Finished difference Result 11900 states and 58628 transitions. [2020-02-10 20:34:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:24,142 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:24,172 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 20:34:24,173 INFO L226 Difference]: Without dead ends: 11872 [2020-02-10 20:34:24,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11872 states. [2020-02-10 20:34:24,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11872 to 6215. [2020-02-10 20:34:24,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:34:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34124 transitions. [2020-02-10 20:34:24,875 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34124 transitions. Word has length 34 [2020-02-10 20:34:24,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:24,876 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34124 transitions. [2020-02-10 20:34:24,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34124 transitions. [2020-02-10 20:34:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:24,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:24,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:24,887 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:24,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash 326194026, now seen corresponding path program 137 times [2020-02-10 20:34:24,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:24,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860986679] [2020-02-10 20:34:24,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:25,433 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:34:25,582 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:34:25,731 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:34:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:25,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860986679] [2020-02-10 20:34:25,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:25,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:25,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504030950] [2020-02-10 20:34:25,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:25,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:25,743 INFO L87 Difference]: Start difference. First operand 6215 states and 34124 transitions. Second operand 13 states. [2020-02-10 20:34:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:25,990 INFO L93 Difference]: Finished difference Result 11911 states and 58650 transitions. [2020-02-10 20:34:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:25,991 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:25,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:26,020 INFO L225 Difference]: With dead ends: 11911 [2020-02-10 20:34:26,020 INFO L226 Difference]: Without dead ends: 11887 [2020-02-10 20:34:26,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-02-10 20:34:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 6225. [2020-02-10 20:34:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:34:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34142 transitions. [2020-02-10 20:34:26,629 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34142 transitions. Word has length 34 [2020-02-10 20:34:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:26,629 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34142 transitions. [2020-02-10 20:34:26,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34142 transitions. [2020-02-10 20:34:26,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:26,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:26,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:26,641 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:26,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:26,641 INFO L82 PathProgramCache]: Analyzing trace with hash -927021958, now seen corresponding path program 138 times [2020-02-10 20:34:26,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:26,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949634254] [2020-02-10 20:34:26,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:27,188 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:34:27,328 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:34:27,479 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:34:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:27,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949634254] [2020-02-10 20:34:27,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:27,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:27,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424338684] [2020-02-10 20:34:27,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:27,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:27,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:27,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:27,491 INFO L87 Difference]: Start difference. First operand 6225 states and 34142 transitions. Second operand 13 states. [2020-02-10 20:34:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:27,782 INFO L93 Difference]: Finished difference Result 11908 states and 58635 transitions. [2020-02-10 20:34:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:27,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:27,810 INFO L225 Difference]: With dead ends: 11908 [2020-02-10 20:34:27,811 INFO L226 Difference]: Without dead ends: 11869 [2020-02-10 20:34:27,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2020-02-10 20:34:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 6207. [2020-02-10 20:34:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2020-02-10 20:34:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 34101 transitions. [2020-02-10 20:34:28,417 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 34101 transitions. Word has length 34 [2020-02-10 20:34:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:28,417 INFO L479 AbstractCegarLoop]: Abstraction has 6207 states and 34101 transitions. [2020-02-10 20:34:28,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 34101 transitions. [2020-02-10 20:34:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:28,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:28,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, 1, 1, 1] [2020-02-10 20:34:28,428 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:28,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:28,429 INFO L82 PathProgramCache]: Analyzing trace with hash 344907066, now seen corresponding path program 139 times [2020-02-10 20:34:28,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:28,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640940080] [2020-02-10 20:34:28,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:29,141 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:34:29,289 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:34:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:29,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640940080] [2020-02-10 20:34:29,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:29,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:29,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151762368] [2020-02-10 20:34:29,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:29,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:29,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:29,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:29,300 INFO L87 Difference]: Start difference. First operand 6207 states and 34101 transitions. Second operand 13 states. [2020-02-10 20:34:29,652 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 20:34:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:29,678 INFO L93 Difference]: Finished difference Result 11894 states and 58623 transitions. [2020-02-10 20:34:29,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:29,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:29,710 INFO L225 Difference]: With dead ends: 11894 [2020-02-10 20:34:29,710 INFO L226 Difference]: Without dead ends: 11875 [2020-02-10 20:34:29,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2020-02-10 20:34:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 6221. [2020-02-10 20:34:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:34:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34141 transitions. [2020-02-10 20:34:30,318 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34141 transitions. Word has length 34 [2020-02-10 20:34:30,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:30,318 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34141 transitions. [2020-02-10 20:34:30,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34141 transitions. [2020-02-10 20:34:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:30,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:30,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, 1, 1, 1] [2020-02-10 20:34:30,329 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:30,329 INFO L82 PathProgramCache]: Analyzing trace with hash 136444312, now seen corresponding path program 140 times [2020-02-10 20:34:30,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:30,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381046438] [2020-02-10 20:34:30,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:30,878 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 31 [2020-02-10 20:34:31,025 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:34:31,177 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:34:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:31,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381046438] [2020-02-10 20:34:31,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:31,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:31,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727447999] [2020-02-10 20:34:31,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:31,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:31,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:31,189 INFO L87 Difference]: Start difference. First operand 6221 states and 34141 transitions. Second operand 13 states. [2020-02-10 20:34:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:31,485 INFO L93 Difference]: Finished difference Result 11897 states and 58622 transitions. [2020-02-10 20:34:31,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:31,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:31,516 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 20:34:31,516 INFO L226 Difference]: Without dead ends: 11868 [2020-02-10 20:34:31,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2020-02-10 20:34:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 6214. [2020-02-10 20:34:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:34:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34121 transitions. [2020-02-10 20:34:32,127 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34121 transitions. Word has length 34 [2020-02-10 20:34:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:32,127 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34121 transitions. [2020-02-10 20:34:32,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34121 transitions. [2020-02-10 20:34:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:32,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:32,138 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:32,138 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:32,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1820524644, now seen corresponding path program 141 times [2020-02-10 20:34:32,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:32,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671511497] [2020-02-10 20:34:32,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:32,827 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:34:32,981 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:34:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:32,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671511497] [2020-02-10 20:34:32,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:32,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:32,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68702527] [2020-02-10 20:34:32,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:32,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:32,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:32,994 INFO L87 Difference]: Start difference. First operand 6214 states and 34121 transitions. Second operand 13 states. [2020-02-10 20:34:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:33,360 INFO L93 Difference]: Finished difference Result 11893 states and 58614 transitions. [2020-02-10 20:34:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:33,361 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:33,390 INFO L225 Difference]: With dead ends: 11893 [2020-02-10 20:34:33,390 INFO L226 Difference]: Without dead ends: 11874 [2020-02-10 20:34:33,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11874 states. [2020-02-10 20:34:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11874 to 6221. [2020-02-10 20:34:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:34:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34134 transitions. [2020-02-10 20:34:34,003 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34134 transitions. Word has length 34 [2020-02-10 20:34:34,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:34,003 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34134 transitions. [2020-02-10 20:34:34,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34134 transitions. [2020-02-10 20:34:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:34,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:34,015 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:34,015 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:34,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1058282344, now seen corresponding path program 142 times [2020-02-10 20:34:34,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:34,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189009686] [2020-02-10 20:34:34,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:34,671 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 20:34:34,820 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:34:34,968 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:34:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:34,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189009686] [2020-02-10 20:34:34,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:34,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:34,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365896404] [2020-02-10 20:34:34,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:34,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:34,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:34,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:34,980 INFO L87 Difference]: Start difference. First operand 6221 states and 34134 transitions. Second operand 13 states. [2020-02-10 20:34:35,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:35,323 INFO L93 Difference]: Finished difference Result 11895 states and 58611 transitions. [2020-02-10 20:34:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:35,323 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:35,353 INFO L225 Difference]: With dead ends: 11895 [2020-02-10 20:34:35,353 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 20:34:35,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 20:34:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6214. [2020-02-10 20:34:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:34:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34114 transitions. [2020-02-10 20:34:35,963 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34114 transitions. Word has length 34 [2020-02-10 20:34:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:35,963 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34114 transitions. [2020-02-10 20:34:35,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34114 transitions. [2020-02-10 20:34:35,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:35,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:35,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, 1, 1, 1] [2020-02-10 20:34:35,974 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1087740900, now seen corresponding path program 143 times [2020-02-10 20:34:35,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:35,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779849481] [2020-02-10 20:34:35,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:36,520 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:34:36,662 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:34:36,813 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:34:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:36,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779849481] [2020-02-10 20:34:36,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:36,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:36,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214845475] [2020-02-10 20:34:36,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:36,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:36,824 INFO L87 Difference]: Start difference. First operand 6214 states and 34114 transitions. Second operand 13 states. [2020-02-10 20:34:37,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:37,212 INFO L93 Difference]: Finished difference Result 11901 states and 58625 transitions. [2020-02-10 20:34:37,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:37,212 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:37,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:37,242 INFO L225 Difference]: With dead ends: 11901 [2020-02-10 20:34:37,242 INFO L226 Difference]: Without dead ends: 11879 [2020-02-10 20:34:37,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2020-02-10 20:34:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 6223. [2020-02-10 20:34:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:34:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34131 transitions. [2020-02-10 20:34:37,854 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34131 transitions. Word has length 34 [2020-02-10 20:34:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:37,854 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34131 transitions. [2020-02-10 20:34:37,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34131 transitions. [2020-02-10 20:34:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:37,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:37,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:37,865 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:37,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:37,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1069306874, now seen corresponding path program 144 times [2020-02-10 20:34:37,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:37,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264088973] [2020-02-10 20:34:37,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:38,428 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:34:38,574 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:34:38,719 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:34:38,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:38,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264088973] [2020-02-10 20:34:38,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:38,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:38,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27533249] [2020-02-10 20:34:38,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:38,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:38,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:38,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:38,731 INFO L87 Difference]: Start difference. First operand 6223 states and 34131 transitions. Second operand 13 states. [2020-02-10 20:34:39,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:39,035 INFO L93 Difference]: Finished difference Result 11900 states and 58614 transitions. [2020-02-10 20:34:39,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:39,035 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:39,066 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 20:34:39,067 INFO L226 Difference]: Without dead ends: 11853 [2020-02-10 20:34:39,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:39,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2020-02-10 20:34:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 6197. [2020-02-10 20:34:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2020-02-10 20:34:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 34075 transitions. [2020-02-10 20:34:39,799 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 34075 transitions. Word has length 34 [2020-02-10 20:34:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:39,799 INFO L479 AbstractCegarLoop]: Abstraction has 6197 states and 34075 transitions. [2020-02-10 20:34:39,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 34075 transitions. [2020-02-10 20:34:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:39,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:39,810 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:39,810 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:39,810 INFO L82 PathProgramCache]: Analyzing trace with hash -990534336, now seen corresponding path program 145 times [2020-02-10 20:34:39,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:39,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821446245] [2020-02-10 20:34:39,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:40,377 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:34:40,526 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:34:40,678 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:34:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:40,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821446245] [2020-02-10 20:34:40,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:40,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:40,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981788934] [2020-02-10 20:34:40,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:40,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:40,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:40,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:40,691 INFO L87 Difference]: Start difference. First operand 6197 states and 34075 transitions. Second operand 13 states. [2020-02-10 20:34:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:41,069 INFO L93 Difference]: Finished difference Result 11912 states and 58673 transitions. [2020-02-10 20:34:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:41,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:41,099 INFO L225 Difference]: With dead ends: 11912 [2020-02-10 20:34:41,099 INFO L226 Difference]: Without dead ends: 11888 [2020-02-10 20:34:41,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11888 states. [2020-02-10 20:34:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11888 to 6227. [2020-02-10 20:34:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2020-02-10 20:34:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 34169 transitions. [2020-02-10 20:34:41,714 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 34169 transitions. Word has length 34 [2020-02-10 20:34:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:41,714 INFO L479 AbstractCegarLoop]: Abstraction has 6227 states and 34169 transitions. [2020-02-10 20:34:41,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 34169 transitions. [2020-02-10 20:34:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:41,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:41,725 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:41,725 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:41,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:41,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1627001190, now seen corresponding path program 146 times [2020-02-10 20:34:41,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:41,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422891535] [2020-02-10 20:34:41,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:42,292 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:34:42,437 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:34:42,588 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:34:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:42,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422891535] [2020-02-10 20:34:42,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:42,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:42,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174041003] [2020-02-10 20:34:42,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:42,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:42,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:42,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:42,600 INFO L87 Difference]: Start difference. First operand 6227 states and 34169 transitions. Second operand 13 states. [2020-02-10 20:34:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:42,919 INFO L93 Difference]: Finished difference Result 11910 states and 58659 transitions. [2020-02-10 20:34:42,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:42,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:42,949 INFO L225 Difference]: With dead ends: 11910 [2020-02-10 20:34:42,950 INFO L226 Difference]: Without dead ends: 11876 [2020-02-10 20:34:42,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:43,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11876 states. [2020-02-10 20:34:43,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11876 to 6215. [2020-02-10 20:34:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:34:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34139 transitions. [2020-02-10 20:34:43,557 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34139 transitions. Word has length 34 [2020-02-10 20:34:43,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:43,557 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34139 transitions. [2020-02-10 20:34:43,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:43,558 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34139 transitions. [2020-02-10 20:34:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:43,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:43,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:43,569 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:43,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:43,569 INFO L82 PathProgramCache]: Analyzing trace with hash 772720368, now seen corresponding path program 147 times [2020-02-10 20:34:43,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:43,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359524332] [2020-02-10 20:34:43,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:44,130 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:34:44,270 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:34:44,425 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:34:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:44,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359524332] [2020-02-10 20:34:44,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:44,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:44,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368545434] [2020-02-10 20:34:44,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:44,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:44,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:44,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:44,437 INFO L87 Difference]: Start difference. First operand 6215 states and 34139 transitions. Second operand 13 states. [2020-02-10 20:34:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:44,869 INFO L93 Difference]: Finished difference Result 11900 states and 58639 transitions. [2020-02-10 20:34:44,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:44,870 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:44,898 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 20:34:44,898 INFO L226 Difference]: Without dead ends: 11881 [2020-02-10 20:34:44,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11881 states. [2020-02-10 20:34:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11881 to 6223. [2020-02-10 20:34:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:34:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34154 transitions. [2020-02-10 20:34:45,595 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34154 transitions. Word has length 34 [2020-02-10 20:34:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:45,595 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34154 transitions. [2020-02-10 20:34:45,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:45,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34154 transitions. [2020-02-10 20:34:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:45,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:45,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:45,606 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:45,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:45,606 INFO L82 PathProgramCache]: Analyzing trace with hash -212215916, now seen corresponding path program 148 times [2020-02-10 20:34:45,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:45,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261835] [2020-02-10 20:34:45,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:46,163 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:34:46,312 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:34:46,465 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:34:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:46,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261835] [2020-02-10 20:34:46,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:46,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:46,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473478377] [2020-02-10 20:34:46,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:46,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:46,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:46,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:46,476 INFO L87 Difference]: Start difference. First operand 6223 states and 34154 transitions. Second operand 13 states. [2020-02-10 20:34:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:46,729 INFO L93 Difference]: Finished difference Result 11905 states and 58641 transitions. [2020-02-10 20:34:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:46,729 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:46,765 INFO L225 Difference]: With dead ends: 11905 [2020-02-10 20:34:46,765 INFO L226 Difference]: Without dead ends: 11873 [2020-02-10 20:34:46,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11873 states. [2020-02-10 20:34:47,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11873 to 6215. [2020-02-10 20:34:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:34:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34131 transitions. [2020-02-10 20:34:47,373 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34131 transitions. Word has length 34 [2020-02-10 20:34:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:47,373 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34131 transitions. [2020-02-10 20:34:47,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34131 transitions. [2020-02-10 20:34:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:47,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34: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, 1, 1, 1] [2020-02-10 20:34:47,385 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:47,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1777882922, now seen corresponding path program 149 times [2020-02-10 20:34:47,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:47,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119268123] [2020-02-10 20:34:47,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:48,092 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:34:48,244 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:34:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:48,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119268123] [2020-02-10 20:34:48,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:48,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:48,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977727390] [2020-02-10 20:34:48,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:48,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:48,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:48,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:48,257 INFO L87 Difference]: Start difference. First operand 6215 states and 34131 transitions. Second operand 13 states. [2020-02-10 20:34:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:48,567 INFO L93 Difference]: Finished difference Result 11897 states and 58626 transitions. [2020-02-10 20:34:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:48,568 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:48,597 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 20:34:48,597 INFO L226 Difference]: Without dead ends: 11878 [2020-02-10 20:34:48,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11878 states. [2020-02-10 20:34:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11878 to 6222. [2020-02-10 20:34:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:34:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34144 transitions. [2020-02-10 20:34:49,207 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34144 transitions. Word has length 34 [2020-02-10 20:34:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:49,207 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34144 transitions. [2020-02-10 20:34:49,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34144 transitions. [2020-02-10 20:34:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:49,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:49,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, 1, 1, 1] [2020-02-10 20:34:49,217 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:49,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:49,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1986345676, now seen corresponding path program 150 times [2020-02-10 20:34:49,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:49,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486164945] [2020-02-10 20:34:49,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:49,941 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:34:50,093 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:34:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:50,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486164945] [2020-02-10 20:34:50,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:50,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:50,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083809351] [2020-02-10 20:34:50,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:50,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:50,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:50,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:50,105 INFO L87 Difference]: Start difference. First operand 6222 states and 34144 transitions. Second operand 13 states. [2020-02-10 20:34:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:50,505 INFO L93 Difference]: Finished difference Result 11900 states and 58625 transitions. [2020-02-10 20:34:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:50,505 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:50,538 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 20:34:50,538 INFO L226 Difference]: Without dead ends: 11862 [2020-02-10 20:34:50,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2020-02-10 20:34:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 6206. [2020-02-10 20:34:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:34:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34107 transitions. [2020-02-10 20:34:51,145 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34107 transitions. Word has length 34 [2020-02-10 20:34:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:51,146 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34107 transitions. [2020-02-10 20:34:51,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34107 transitions. [2020-02-10 20:34:51,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:51,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:51,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:51,157 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:51,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:51,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2087042548, now seen corresponding path program 151 times [2020-02-10 20:34:51,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:51,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267462566] [2020-02-10 20:34:51,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:51,740 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:34:51,892 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 20:34:52,046 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:34:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:52,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267462566] [2020-02-10 20:34:52,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:52,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:52,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106109372] [2020-02-10 20:34:52,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:52,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:52,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:52,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:52,059 INFO L87 Difference]: Start difference. First operand 6206 states and 34107 transitions. Second operand 13 states. [2020-02-10 20:34:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:52,380 INFO L93 Difference]: Finished difference Result 11916 states and 58676 transitions. [2020-02-10 20:34:52,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:52,380 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:52,409 INFO L225 Difference]: With dead ends: 11916 [2020-02-10 20:34:52,409 INFO L226 Difference]: Without dead ends: 11892 [2020-02-10 20:34:52,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:52,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states. [2020-02-10 20:34:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 6228. [2020-02-10 20:34:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 20:34:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34164 transitions. [2020-02-10 20:34:53,021 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34164 transitions. Word has length 34 [2020-02-10 20:34:53,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:53,022 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34164 transitions. [2020-02-10 20:34:53,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:53,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34164 transitions. [2020-02-10 20:34:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:53,036 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:53,037 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:53,037 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:53,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:53,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1450575694, now seen corresponding path program 152 times [2020-02-10 20:34:53,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:53,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452752706] [2020-02-10 20:34:53,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:53,622 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:34:53,769 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:34:53,925 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:34:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:53,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452752706] [2020-02-10 20:34:53,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:53,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:53,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353172445] [2020-02-10 20:34:53,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:53,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:53,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:53,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:53,937 INFO L87 Difference]: Start difference. First operand 6228 states and 34164 transitions. Second operand 13 states. [2020-02-10 20:34:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:54,334 INFO L93 Difference]: Finished difference Result 11914 states and 58662 transitions. [2020-02-10 20:34:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:54,335 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:54,364 INFO L225 Difference]: With dead ends: 11914 [2020-02-10 20:34:54,364 INFO L226 Difference]: Without dead ends: 11880 [2020-02-10 20:34:54,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11880 states. [2020-02-10 20:34:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11880 to 6216. [2020-02-10 20:34:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:34:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34133 transitions. [2020-02-10 20:34:54,980 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34133 transitions. Word has length 34 [2020-02-10 20:34:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:54,980 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34133 transitions. [2020-02-10 20:34:54,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34133 transitions. [2020-02-10 20:34:54,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:54,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:54,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:54,991 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:54,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:54,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1733424308, now seen corresponding path program 153 times [2020-02-10 20:34:54,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:54,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379850238] [2020-02-10 20:34:54,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:55,557 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:34:55,711 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 20:34:55,960 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:34:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:55,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379850238] [2020-02-10 20:34:55,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:55,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:55,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757443710] [2020-02-10 20:34:55,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:55,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:55,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:55,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:55,972 INFO L87 Difference]: Start difference. First operand 6216 states and 34133 transitions. Second operand 13 states. [2020-02-10 20:34:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:56,395 INFO L93 Difference]: Finished difference Result 11911 states and 58655 transitions. [2020-02-10 20:34:56,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:56,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:56,449 INFO L225 Difference]: With dead ends: 11911 [2020-02-10 20:34:56,449 INFO L226 Difference]: Without dead ends: 11887 [2020-02-10 20:34:56,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-02-10 20:34:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 6225. [2020-02-10 20:34:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:34:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34149 transitions. [2020-02-10 20:34:57,274 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34149 transitions. Word has length 34 [2020-02-10 20:34:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:57,274 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34149 transitions. [2020-02-10 20:34:57,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34149 transitions. [2020-02-10 20:34:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:57,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:57,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:57,286 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:57,286 INFO L82 PathProgramCache]: Analyzing trace with hash 672646218, now seen corresponding path program 154 times [2020-02-10 20:34:57,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:57,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403136657] [2020-02-10 20:34:57,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:57,985 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:34:58,137 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:34:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:58,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403136657] [2020-02-10 20:34:58,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:58,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:34:58,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806083013] [2020-02-10 20:34:58,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:34:58,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:58,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:34:58,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:58,150 INFO L87 Difference]: Start difference. First operand 6225 states and 34149 transitions. Second operand 13 states. [2020-02-10 20:34:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:58,532 INFO L93 Difference]: Finished difference Result 11907 states and 58639 transitions. [2020-02-10 20:34:58,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:34:58,532 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:34:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:58,563 INFO L225 Difference]: With dead ends: 11907 [2020-02-10 20:34:58,563 INFO L226 Difference]: Without dead ends: 11878 [2020-02-10 20:34:58,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:34:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11878 states. [2020-02-10 20:34:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11878 to 6216. [2020-02-10 20:34:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:34:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34124 transitions. [2020-02-10 20:34:59,172 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34124 transitions. Word has length 34 [2020-02-10 20:34:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:59,172 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34124 transitions. [2020-02-10 20:34:59,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:34:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34124 transitions. [2020-02-10 20:34:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:34:59,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:59,183 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:59,184 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:34:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1453645836, now seen corresponding path program 155 times [2020-02-10 20:34:59,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:59,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126819474] [2020-02-10 20:34:59,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:59,734 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 20:34:59,884 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:35:00,034 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:35:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:00,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126819474] [2020-02-10 20:35:00,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:00,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:00,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14387944] [2020-02-10 20:35:00,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:00,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:00,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:00,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:00,046 INFO L87 Difference]: Start difference. First operand 6216 states and 34124 transitions. Second operand 13 states. [2020-02-10 20:35:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:00,376 INFO L93 Difference]: Finished difference Result 11906 states and 58638 transitions. [2020-02-10 20:35:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:00,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:00,406 INFO L225 Difference]: With dead ends: 11906 [2020-02-10 20:35:00,406 INFO L226 Difference]: Without dead ends: 11884 [2020-02-10 20:35:00,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:00,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11884 states. [2020-02-10 20:35:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11884 to 6224. [2020-02-10 20:35:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2020-02-10 20:35:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 34139 transitions. [2020-02-10 20:35:01,022 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 34139 transitions. Word has length 34 [2020-02-10 20:35:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:01,022 INFO L479 AbstractCegarLoop]: Abstraction has 6224 states and 34139 transitions. [2020-02-10 20:35:01,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 34139 transitions. [2020-02-10 20:35:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:01,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:01,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:01,033 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:01,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:01,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1877957072, now seen corresponding path program 156 times [2020-02-10 20:35:01,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:01,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160173006] [2020-02-10 20:35:01,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:01,318 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2020-02-10 20:35:01,845 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:35:01,999 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:35:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:02,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160173006] [2020-02-10 20:35:02,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:02,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:02,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387849600] [2020-02-10 20:35:02,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:02,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:02,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:02,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:02,012 INFO L87 Difference]: Start difference. First operand 6224 states and 34139 transitions. Second operand 13 states. [2020-02-10 20:35:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:02,378 INFO L93 Difference]: Finished difference Result 11904 states and 58626 transitions. [2020-02-10 20:35:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:02,378 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:02,408 INFO L225 Difference]: With dead ends: 11904 [2020-02-10 20:35:02,409 INFO L226 Difference]: Without dead ends: 11866 [2020-02-10 20:35:02,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11866 states. [2020-02-10 20:35:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11866 to 6206. [2020-02-10 20:35:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:35:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34098 transitions. [2020-02-10 20:35:03,016 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34098 transitions. Word has length 34 [2020-02-10 20:35:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:03,016 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34098 transitions. [2020-02-10 20:35:03,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34098 transitions. [2020-02-10 20:35:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:03,027 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:03,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, 1, 1, 1] [2020-02-10 20:35:03,027 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:03,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:03,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1599510480, now seen corresponding path program 157 times [2020-02-10 20:35:03,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:03,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925966721] [2020-02-10 20:35:03,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:03,592 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:35:03,735 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:35:03,886 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:35:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:03,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925966721] [2020-02-10 20:35:03,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:03,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:03,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342836510] [2020-02-10 20:35:03,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:03,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:03,899 INFO L87 Difference]: Start difference. First operand 6206 states and 34098 transitions. Second operand 13 states. [2020-02-10 20:35:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:04,393 INFO L93 Difference]: Finished difference Result 11894 states and 58617 transitions. [2020-02-10 20:35:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:04,393 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:04,422 INFO L225 Difference]: With dead ends: 11894 [2020-02-10 20:35:04,422 INFO L226 Difference]: Without dead ends: 11875 [2020-02-10 20:35:04,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2020-02-10 20:35:05,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 6222. [2020-02-10 20:35:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:35:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34143 transitions. [2020-02-10 20:35:05,036 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34143 transitions. Word has length 34 [2020-02-10 20:35:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:05,036 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34143 transitions. [2020-02-10 20:35:05,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34143 transitions. [2020-02-10 20:35:05,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:05,047 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:05,047 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:05,047 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:05,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:05,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1710520532, now seen corresponding path program 158 times [2020-02-10 20:35:05,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:05,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247713598] [2020-02-10 20:35:05,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:05,603 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:35:05,758 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:35:05,907 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:35:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:05,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247713598] [2020-02-10 20:35:05,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:05,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:05,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600005424] [2020-02-10 20:35:05,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:05,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:05,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:05,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:05,919 INFO L87 Difference]: Start difference. First operand 6222 states and 34143 transitions. Second operand 13 states. [2020-02-10 20:35:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:06,167 INFO L93 Difference]: Finished difference Result 11899 states and 58619 transitions. [2020-02-10 20:35:06,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:06,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:06,197 INFO L225 Difference]: With dead ends: 11899 [2020-02-10 20:35:06,197 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 20:35:06,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 20:35:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6214. [2020-02-10 20:35:06,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:35:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34120 transitions. [2020-02-10 20:35:06,916 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34120 transitions. Word has length 34 [2020-02-10 20:35:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:06,916 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34120 transitions. [2020-02-10 20:35:06,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34120 transitions. [2020-02-10 20:35:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:06,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:06,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, 1, 1, 1] [2020-02-10 20:35:06,928 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:06,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:06,928 INFO L82 PathProgramCache]: Analyzing trace with hash -123892902, now seen corresponding path program 159 times [2020-02-10 20:35:06,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:06,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718057478] [2020-02-10 20:35:06,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:07,486 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:35:07,632 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:35:07,781 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:35:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:07,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718057478] [2020-02-10 20:35:07,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:07,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:07,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059805137] [2020-02-10 20:35:07,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:07,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:07,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:07,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:07,793 INFO L87 Difference]: Start difference. First operand 6214 states and 34120 transitions. Second operand 13 states. [2020-02-10 20:35:08,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:08,104 INFO L93 Difference]: Finished difference Result 11889 states and 58600 transitions. [2020-02-10 20:35:08,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:08,105 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:08,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:08,134 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 20:35:08,134 INFO L226 Difference]: Without dead ends: 11870 [2020-02-10 20:35:08,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11870 states. [2020-02-10 20:35:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11870 to 6221. [2020-02-10 20:35:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:35:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34133 transitions. [2020-02-10 20:35:08,750 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34133 transitions. Word has length 34 [2020-02-10 20:35:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:08,750 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34133 transitions. [2020-02-10 20:35:08,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34133 transitions. [2020-02-10 20:35:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:08,761 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:08,761 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:08,761 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:08,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:08,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1176487028, now seen corresponding path program 160 times [2020-02-10 20:35:08,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:08,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623068632] [2020-02-10 20:35:08,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:09,317 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:35:09,463 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:35:09,614 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:09,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:09,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623068632] [2020-02-10 20:35:09,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:09,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:09,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116688570] [2020-02-10 20:35:09,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:09,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:09,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:09,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:09,626 INFO L87 Difference]: Start difference. First operand 6221 states and 34133 transitions. Second operand 13 states. [2020-02-10 20:35:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:09,931 INFO L93 Difference]: Finished difference Result 11890 states and 58595 transitions. [2020-02-10 20:35:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:09,932 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:09,960 INFO L225 Difference]: With dead ends: 11890 [2020-02-10 20:35:09,960 INFO L226 Difference]: Without dead ends: 11863 [2020-02-10 20:35:09,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11863 states. [2020-02-10 20:35:10,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11863 to 6214. [2020-02-10 20:35:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:35:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34113 transitions. [2020-02-10 20:35:10,566 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34113 transitions. Word has length 34 [2020-02-10 20:35:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:10,566 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34113 transitions. [2020-02-10 20:35:10,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34113 transitions. [2020-02-10 20:35:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:10,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:10,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, 1, 1, 1] [2020-02-10 20:35:10,577 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:10,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:10,578 INFO L82 PathProgramCache]: Analyzing trace with hash -927374598, now seen corresponding path program 161 times [2020-02-10 20:35:10,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:10,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316872640] [2020-02-10 20:35:10,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:11,134 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:35:11,287 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 20:35:11,444 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:11,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316872640] [2020-02-10 20:35:11,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:11,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:11,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716482812] [2020-02-10 20:35:11,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:11,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:11,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:11,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:11,457 INFO L87 Difference]: Start difference. First operand 6214 states and 34113 transitions. Second operand 13 states. [2020-02-10 20:35:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:11,711 INFO L93 Difference]: Finished difference Result 11901 states and 58616 transitions. [2020-02-10 20:35:11,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:11,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:11,741 INFO L225 Difference]: With dead ends: 11901 [2020-02-10 20:35:11,741 INFO L226 Difference]: Without dead ends: 11877 [2020-02-10 20:35:11,741 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2020-02-10 20:35:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 6223. [2020-02-10 20:35:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:35:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34129 transitions. [2020-02-10 20:35:12,447 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34129 transitions. Word has length 34 [2020-02-10 20:35:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:12,447 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34129 transitions. [2020-02-10 20:35:12,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34129 transitions. [2020-02-10 20:35:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:12,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:12,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:12,458 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:12,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1675843802, now seen corresponding path program 162 times [2020-02-10 20:35:12,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:12,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14640033] [2020-02-10 20:35:12,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:13,009 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:35:13,158 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:35:13,313 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:13,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14640033] [2020-02-10 20:35:13,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:13,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:13,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173204635] [2020-02-10 20:35:13,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:13,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:13,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:13,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:13,325 INFO L87 Difference]: Start difference. First operand 6223 states and 34129 transitions. Second operand 13 states. [2020-02-10 20:35:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:13,652 INFO L93 Difference]: Finished difference Result 11897 states and 58600 transitions. [2020-02-10 20:35:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:13,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:13,683 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 20:35:13,683 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 20:35:13,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:14,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 20:35:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6206. [2020-02-10 20:35:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-02-10 20:35:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 34090 transitions. [2020-02-10 20:35:14,292 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 34090 transitions. Word has length 34 [2020-02-10 20:35:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:14,292 INFO L479 AbstractCegarLoop]: Abstraction has 6206 states and 34090 transitions. [2020-02-10 20:35:14,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 34090 transitions. [2020-02-10 20:35:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:14,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:14,303 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:14,303 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:14,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:14,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1614437136, now seen corresponding path program 163 times [2020-02-10 20:35:14,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:14,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398111258] [2020-02-10 20:35:14,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:15,003 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:35:15,155 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:15,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398111258] [2020-02-10 20:35:15,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:15,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:15,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727397208] [2020-02-10 20:35:15,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:15,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:15,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:15,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:15,167 INFO L87 Difference]: Start difference. First operand 6206 states and 34090 transitions. Second operand 13 states. [2020-02-10 20:35:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:15,471 INFO L93 Difference]: Finished difference Result 11886 states and 58594 transitions. [2020-02-10 20:35:15,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:15,472 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:15,502 INFO L225 Difference]: With dead ends: 11886 [2020-02-10 20:35:15,502 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 20:35:15,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:15,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 20:35:16,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6220. [2020-02-10 20:35:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:35:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34130 transitions. [2020-02-10 20:35:16,113 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34130 transitions. Word has length 34 [2020-02-10 20:35:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:16,113 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34130 transitions. [2020-02-10 20:35:16,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34130 transitions. [2020-02-10 20:35:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:16,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:16,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, 1, 1, 1] [2020-02-10 20:35:16,124 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1822899890, now seen corresponding path program 164 times [2020-02-10 20:35:16,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:16,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051959163] [2020-02-10 20:35:16,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:16,815 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:35:16,968 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:16,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051959163] [2020-02-10 20:35:16,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:16,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:16,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569158833] [2020-02-10 20:35:16,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:16,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:16,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:16,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:16,979 INFO L87 Difference]: Start difference. First operand 6220 states and 34130 transitions. Second operand 13 states. [2020-02-10 20:35:17,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:17,274 INFO L93 Difference]: Finished difference Result 11889 states and 58593 transitions. [2020-02-10 20:35:17,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:17,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:17,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:17,304 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 20:35:17,304 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 20:35:17,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 20:35:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6213. [2020-02-10 20:35:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:35:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34110 transitions. [2020-02-10 20:35:17,987 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34110 transitions. Word has length 34 [2020-02-10 20:35:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:17,987 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34110 transitions. [2020-02-10 20:35:17,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34110 transitions. [2020-02-10 20:35:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:17,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:17,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:17,998 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:17,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1883183564, now seen corresponding path program 165 times [2020-02-10 20:35:17,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:17,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668983729] [2020-02-10 20:35:17,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:18,552 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:35:18,693 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:35:18,849 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:18,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668983729] [2020-02-10 20:35:18,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:18,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:18,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657623376] [2020-02-10 20:35:18,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:18,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:18,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:18,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:18,862 INFO L87 Difference]: Start difference. First operand 6213 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:35:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:19,165 INFO L93 Difference]: Finished difference Result 11884 states and 58583 transitions. [2020-02-10 20:35:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:19,165 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:19,194 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 20:35:19,194 INFO L226 Difference]: Without dead ends: 11865 [2020-02-10 20:35:19,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11865 states. [2020-02-10 20:35:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11865 to 6220. [2020-02-10 20:35:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:35:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34123 transitions. [2020-02-10 20:35:19,803 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34123 transitions. Word has length 34 [2020-02-10 20:35:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:19,803 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34123 transitions. [2020-02-10 20:35:19,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34123 transitions. [2020-02-10 20:35:19,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:19,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:19,814 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:19,814 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:19,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:19,815 INFO L82 PathProgramCache]: Analyzing trace with hash -582803634, now seen corresponding path program 166 times [2020-02-10 20:35:19,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:19,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973576884] [2020-02-10 20:35:19,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:20,516 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:35:20,666 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:35:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:20,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973576884] [2020-02-10 20:35:20,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:20,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:20,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174382309] [2020-02-10 20:35:20,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:20,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:20,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:20,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:20,678 INFO L87 Difference]: Start difference. First operand 6220 states and 34123 transitions. Second operand 13 states. [2020-02-10 20:35:20,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:20,982 INFO L93 Difference]: Finished difference Result 11885 states and 58578 transitions. [2020-02-10 20:35:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:20,983 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:21,012 INFO L225 Difference]: With dead ends: 11885 [2020-02-10 20:35:21,012 INFO L226 Difference]: Without dead ends: 11858 [2020-02-10 20:35:21,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2020-02-10 20:35:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 6213. [2020-02-10 20:35:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:35:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34103 transitions. [2020-02-10 20:35:21,633 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34103 transitions. Word has length 34 [2020-02-10 20:35:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:21,633 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34103 transitions. [2020-02-10 20:35:21,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34103 transitions. [2020-02-10 20:35:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:21,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:21,644 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:21,645 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash -165827724, now seen corresponding path program 167 times [2020-02-10 20:35:21,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:21,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604892545] [2020-02-10 20:35:21,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:22,339 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:35:22,490 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:35:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:22,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604892545] [2020-02-10 20:35:22,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:22,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:22,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134415220] [2020-02-10 20:35:22,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:22,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:22,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:22,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:22,502 INFO L87 Difference]: Start difference. First operand 6213 states and 34103 transitions. Second operand 13 states. [2020-02-10 20:35:22,982 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2020-02-10 20:35:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:23,009 INFO L93 Difference]: Finished difference Result 11891 states and 58591 transitions. [2020-02-10 20:35:23,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:23,010 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:23,042 INFO L225 Difference]: With dead ends: 11891 [2020-02-10 20:35:23,042 INFO L226 Difference]: Without dead ends: 11869 [2020-02-10 20:35:23,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2020-02-10 20:35:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 6221. [2020-02-10 20:35:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:35:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34118 transitions. [2020-02-10 20:35:23,654 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34118 transitions. Word has length 34 [2020-02-10 20:35:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:23,654 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34118 transitions. [2020-02-10 20:35:23,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:23,654 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34118 transitions. [2020-02-10 20:35:23,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:23,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:23,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, 1, 1, 1] [2020-02-10 20:35:23,665 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:23,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:23,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1544785584, now seen corresponding path program 168 times [2020-02-10 20:35:23,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:23,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774696042] [2020-02-10 20:35:23,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:24,350 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:35:24,503 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:35:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:24,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774696042] [2020-02-10 20:35:24,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:24,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:24,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557985729] [2020-02-10 20:35:24,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:24,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:24,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:24,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:24,514 INFO L87 Difference]: Start difference. First operand 6221 states and 34118 transitions. Second operand 13 states. [2020-02-10 20:35:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:24,846 INFO L93 Difference]: Finished difference Result 11889 states and 58579 transitions. [2020-02-10 20:35:24,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:24,847 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:24,877 INFO L225 Difference]: With dead ends: 11889 [2020-02-10 20:35:24,877 INFO L226 Difference]: Without dead ends: 11845 [2020-02-10 20:35:24,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2020-02-10 20:35:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 6197. [2020-02-10 20:35:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2020-02-10 20:35:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 34066 transitions. [2020-02-10 20:35:25,489 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 34066 transitions. Word has length 34 [2020-02-10 20:35:25,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:25,489 INFO L479 AbstractCegarLoop]: Abstraction has 6197 states and 34066 transitions. [2020-02-10 20:35:25,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:25,489 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 34066 transitions. [2020-02-10 20:35:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:25,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:25,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, 1, 1, 1] [2020-02-10 20:35:25,500 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:25,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:25,500 INFO L82 PathProgramCache]: Analyzing trace with hash -834520410, now seen corresponding path program 169 times [2020-02-10 20:35:25,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:25,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160524488] [2020-02-10 20:35:25,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:26,071 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:35:26,220 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 20:35:26,368 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:26,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:26,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160524488] [2020-02-10 20:35:26,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:26,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:26,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471541154] [2020-02-10 20:35:26,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:26,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:26,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:26,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:26,381 INFO L87 Difference]: Start difference. First operand 6197 states and 34066 transitions. Second operand 13 states. [2020-02-10 20:35:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:26,659 INFO L93 Difference]: Finished difference Result 11931 states and 58720 transitions. [2020-02-10 20:35:26,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:26,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:26,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:26,689 INFO L225 Difference]: With dead ends: 11931 [2020-02-10 20:35:26,689 INFO L226 Difference]: Without dead ends: 11907 [2020-02-10 20:35:26,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11907 states. [2020-02-10 20:35:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11907 to 6231. [2020-02-10 20:35:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2020-02-10 20:35:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 34172 transitions. [2020-02-10 20:35:27,303 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 34172 transitions. Word has length 34 [2020-02-10 20:35:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:27,304 INFO L479 AbstractCegarLoop]: Abstraction has 6231 states and 34172 transitions. [2020-02-10 20:35:27,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:27,304 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 34172 transitions. [2020-02-10 20:35:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:27,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:27,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, 1, 1, 1] [2020-02-10 20:35:27,315 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:27,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1470987264, now seen corresponding path program 170 times [2020-02-10 20:35:27,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:27,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724033251] [2020-02-10 20:35:27,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:27,964 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:35:28,111 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:35:28,264 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:35:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:28,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724033251] [2020-02-10 20:35:28,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:28,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:28,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941826934] [2020-02-10 20:35:28,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:28,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:28,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:28,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:28,277 INFO L87 Difference]: Start difference. First operand 6231 states and 34172 transitions. Second operand 13 states. [2020-02-10 20:35:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:28,638 INFO L93 Difference]: Finished difference Result 11929 states and 58706 transitions. [2020-02-10 20:35:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:28,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:28,668 INFO L225 Difference]: With dead ends: 11929 [2020-02-10 20:35:28,668 INFO L226 Difference]: Without dead ends: 11895 [2020-02-10 20:35:28,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11895 states. [2020-02-10 20:35:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11895 to 6219. [2020-02-10 20:35:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:35:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34141 transitions. [2020-02-10 20:35:29,277 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34141 transitions. Word has length 34 [2020-02-10 20:35:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:29,277 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34141 transitions. [2020-02-10 20:35:29,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34141 transitions. [2020-02-10 20:35:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:29,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:29,288 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:29,288 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:29,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1188138650, now seen corresponding path program 171 times [2020-02-10 20:35:29,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:29,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575646470] [2020-02-10 20:35:29,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:29,884 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:35:30,036 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2020-02-10 20:35:30,182 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:30,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575646470] [2020-02-10 20:35:30,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:30,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:30,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101252801] [2020-02-10 20:35:30,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:30,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:30,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:30,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:30,197 INFO L87 Difference]: Start difference. First operand 6219 states and 34141 transitions. Second operand 13 states. [2020-02-10 20:35:30,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:30,455 INFO L93 Difference]: Finished difference Result 11926 states and 58699 transitions. [2020-02-10 20:35:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:30,455 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:30,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:30,485 INFO L225 Difference]: With dead ends: 11926 [2020-02-10 20:35:30,485 INFO L226 Difference]: Without dead ends: 11902 [2020-02-10 20:35:30,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11902 states. [2020-02-10 20:35:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11902 to 6228. [2020-02-10 20:35:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 20:35:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34157 transitions. [2020-02-10 20:35:31,100 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34157 transitions. Word has length 34 [2020-02-10 20:35:31,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:31,100 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34157 transitions. [2020-02-10 20:35:31,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34157 transitions. [2020-02-10 20:35:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:31,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:31,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, 1, 1, 1] [2020-02-10 20:35:31,111 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:31,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:31,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2046050556, now seen corresponding path program 172 times [2020-02-10 20:35:31,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:31,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024029582] [2020-02-10 20:35:31,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:31,810 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:35:31,961 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:31,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024029582] [2020-02-10 20:35:31,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:31,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:31,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62885242] [2020-02-10 20:35:31,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:31,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:31,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:31,973 INFO L87 Difference]: Start difference. First operand 6228 states and 34157 transitions. Second operand 13 states. [2020-02-10 20:35:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:32,288 INFO L93 Difference]: Finished difference Result 11922 states and 58683 transitions. [2020-02-10 20:35:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:32,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:32,318 INFO L225 Difference]: With dead ends: 11922 [2020-02-10 20:35:32,318 INFO L226 Difference]: Without dead ends: 11893 [2020-02-10 20:35:32,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:32,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11893 states. [2020-02-10 20:35:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11893 to 6219. [2020-02-10 20:35:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:35:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34132 transitions. [2020-02-10 20:35:32,929 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34132 transitions. Word has length 34 [2020-02-10 20:35:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:32,929 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34132 transitions. [2020-02-10 20:35:32,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34132 transitions. [2020-02-10 20:35:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:32,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:32,940 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:32,940 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:32,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:32,940 INFO L82 PathProgramCache]: Analyzing trace with hash -80241498, now seen corresponding path program 173 times [2020-02-10 20:35:32,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:32,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279933253] [2020-02-10 20:35:32,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:33,651 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:35:33,902 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:35:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:33,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279933253] [2020-02-10 20:35:33,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:33,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:33,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425698720] [2020-02-10 20:35:33,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:33,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:33,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:33,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:33,915 INFO L87 Difference]: Start difference. First operand 6219 states and 34132 transitions. Second operand 13 states. [2020-02-10 20:35:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:34,342 INFO L93 Difference]: Finished difference Result 11921 states and 58682 transitions. [2020-02-10 20:35:34,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:34,342 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:34,371 INFO L225 Difference]: With dead ends: 11921 [2020-02-10 20:35:34,371 INFO L226 Difference]: Without dead ends: 11899 [2020-02-10 20:35:34,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:34,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11899 states. [2020-02-10 20:35:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11899 to 6227. [2020-02-10 20:35:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2020-02-10 20:35:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 34147 transitions. [2020-02-10 20:35:34,982 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 34147 transitions. Word has length 34 [2020-02-10 20:35:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:34,982 INFO L479 AbstractCegarLoop]: Abstraction has 6227 states and 34147 transitions. [2020-02-10 20:35:34,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 34147 transitions. [2020-02-10 20:35:34,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:34,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:34,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:34,993 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:34,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:34,993 INFO L82 PathProgramCache]: Analyzing trace with hash -504552734, now seen corresponding path program 174 times [2020-02-10 20:35:34,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:34,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855154139] [2020-02-10 20:35:34,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:35,704 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:35:35,856 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:35: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-02-10 20:35:35,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855154139] [2020-02-10 20:35:35,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:35,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:35,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959551093] [2020-02-10 20:35:35,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:35,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:35,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:35,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:35,869 INFO L87 Difference]: Start difference. First operand 6227 states and 34147 transitions. Second operand 13 states. [2020-02-10 20:35:36,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:36,235 INFO L93 Difference]: Finished difference Result 11919 states and 58670 transitions. [2020-02-10 20:35:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:36,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:36,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:36,266 INFO L225 Difference]: With dead ends: 11919 [2020-02-10 20:35:36,267 INFO L226 Difference]: Without dead ends: 11881 [2020-02-10 20:35:36,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11881 states. [2020-02-10 20:35:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11881 to 6209. [2020-02-10 20:35:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:35:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34105 transitions. [2020-02-10 20:35:36,876 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34105 transitions. Word has length 34 [2020-02-10 20:35:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:36,876 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34105 transitions. [2020-02-10 20:35:36,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34105 transitions. [2020-02-10 20:35:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:36,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:36,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:36,887 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:36,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:36,887 INFO L82 PathProgramCache]: Analyzing trace with hash 704268032, now seen corresponding path program 175 times [2020-02-10 20:35:36,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:36,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131062460] [2020-02-10 20:35:36,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:37,470 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:35:37,620 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2020-02-10 20:35:37,770 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2020-02-10 20:35:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:37,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131062460] [2020-02-10 20:35:37,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:37,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:37,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119701930] [2020-02-10 20:35:37,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:37,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:37,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:37,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:37,783 INFO L87 Difference]: Start difference. First operand 6209 states and 34105 transitions. Second operand 13 states. [2020-02-10 20:35:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:38,123 INFO L93 Difference]: Finished difference Result 11936 states and 58723 transitions. [2020-02-10 20:35:38,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:38,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:38,154 INFO L225 Difference]: With dead ends: 11936 [2020-02-10 20:35:38,154 INFO L226 Difference]: Without dead ends: 11912 [2020-02-10 20:35:38,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:38,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11912 states. [2020-02-10 20:35:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11912 to 6233. [2020-02-10 20:35:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6233 states. [2020-02-10 20:35:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6233 states to 6233 states and 34167 transitions. [2020-02-10 20:35:38,764 INFO L78 Accepts]: Start accepts. Automaton has 6233 states and 34167 transitions. Word has length 34 [2020-02-10 20:35:38,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:38,764 INFO L479 AbstractCegarLoop]: Abstraction has 6233 states and 34167 transitions. [2020-02-10 20:35:38,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 6233 states and 34167 transitions. [2020-02-10 20:35:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:38,775 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:38,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, 1, 1, 1] [2020-02-10 20:35:38,775 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:38,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:38,776 INFO L82 PathProgramCache]: Analyzing trace with hash 67801178, now seen corresponding path program 176 times [2020-02-10 20:35:38,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:38,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285927176] [2020-02-10 20:35:38,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:39,326 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2020-02-10 20:35:39,454 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:35:39,598 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:35:39,745 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-02-10 20:35:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:39,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285927176] [2020-02-10 20:35:39,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:39,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:39,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136260419] [2020-02-10 20:35:39,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:39,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:39,757 INFO L87 Difference]: Start difference. First operand 6233 states and 34167 transitions. Second operand 13 states. [2020-02-10 20:35:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:40,101 INFO L93 Difference]: Finished difference Result 11934 states and 58709 transitions. [2020-02-10 20:35:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:40,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:40,131 INFO L225 Difference]: With dead ends: 11934 [2020-02-10 20:35:40,132 INFO L226 Difference]: Without dead ends: 11900 [2020-02-10 20:35:40,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2020-02-10 20:35:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 6221. [2020-02-10 20:35:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:35:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34135 transitions. [2020-02-10 20:35:40,745 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34135 transitions. Word has length 34 [2020-02-10 20:35:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:40,745 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34135 transitions. [2020-02-10 20:35:40,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34135 transitions. [2020-02-10 20:35:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:40,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:40,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:40,756 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:40,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:40,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1632287462, now seen corresponding path program 177 times [2020-02-10 20:35:40,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:40,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401562425] [2020-02-10 20:35:40,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:41,319 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:35:41,471 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-02-10 20:35:41,622 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:41,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401562425] [2020-02-10 20:35:41,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:41,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:41,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002939086] [2020-02-10 20:35:41,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:41,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:41,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:41,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:41,635 INFO L87 Difference]: Start difference. First operand 6221 states and 34135 transitions. Second operand 13 states. [2020-02-10 20:35:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:41,998 INFO L93 Difference]: Finished difference Result 11933 states and 58706 transitions. [2020-02-10 20:35:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:41,999 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:42,030 INFO L225 Difference]: With dead ends: 11933 [2020-02-10 20:35:42,030 INFO L226 Difference]: Without dead ends: 11909 [2020-02-10 20:35:42,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11909 states. [2020-02-10 20:35:42,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11909 to 6231. [2020-02-10 20:35:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6231 states. [2020-02-10 20:35:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6231 states to 6231 states and 34153 transitions. [2020-02-10 20:35:42,640 INFO L78 Accepts]: Start accepts. Automaton has 6231 states and 34153 transitions. Word has length 34 [2020-02-10 20:35:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:42,640 INFO L479 AbstractCegarLoop]: Abstraction has 6231 states and 34153 transitions. [2020-02-10 20:35:42,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 6231 states and 34153 transitions. [2020-02-10 20:35:42,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:42,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:42,651 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:42,651 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:42,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:42,651 INFO L82 PathProgramCache]: Analyzing trace with hash -64957482, now seen corresponding path program 178 times [2020-02-10 20:35:42,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:42,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046296581] [2020-02-10 20:35:42,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:43,222 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:35:43,367 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:35:43,521 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:43,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046296581] [2020-02-10 20:35:43,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:43,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:43,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671631527] [2020-02-10 20:35:43,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:43,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:43,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:43,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:43,534 INFO L87 Difference]: Start difference. First operand 6231 states and 34153 transitions. Second operand 13 states. [2020-02-10 20:35:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:43,932 INFO L93 Difference]: Finished difference Result 11930 states and 58691 transitions. [2020-02-10 20:35:43,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:43,933 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:43,964 INFO L225 Difference]: With dead ends: 11930 [2020-02-10 20:35:43,964 INFO L226 Difference]: Without dead ends: 11899 [2020-02-10 20:35:43,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11899 states. [2020-02-10 20:35:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11899 to 6221. [2020-02-10 20:35:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:35:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34125 transitions. [2020-02-10 20:35:44,574 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34125 transitions. Word has length 34 [2020-02-10 20:35:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:44,574 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34125 transitions. [2020-02-10 20:35:44,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34125 transitions. [2020-02-10 20:35:44,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:44,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:44,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:44,585 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:44,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1554782682, now seen corresponding path program 179 times [2020-02-10 20:35:44,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:44,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129376203] [2020-02-10 20:35:44,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:45,252 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:35:45,403 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:35:45,554 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-02-10 20:35:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:45,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129376203] [2020-02-10 20:35:45,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:45,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:45,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577351435] [2020-02-10 20:35:45,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:45,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:45,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:45,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:45,567 INFO L87 Difference]: Start difference. First operand 6221 states and 34125 transitions. Second operand 13 states. [2020-02-10 20:35:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:45,913 INFO L93 Difference]: Finished difference Result 11928 states and 58688 transitions. [2020-02-10 20:35:45,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:45,914 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:45,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:45,943 INFO L225 Difference]: With dead ends: 11928 [2020-02-10 20:35:45,943 INFO L226 Difference]: Without dead ends: 11906 [2020-02-10 20:35:45,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:46,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11906 states. [2020-02-10 20:35:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11906 to 6230. [2020-02-10 20:35:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6230 states. [2020-02-10 20:35:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6230 states to 6230 states and 34142 transitions. [2020-02-10 20:35:46,553 INFO L78 Accepts]: Start accepts. Automaton has 6230 states and 34142 transitions. Word has length 34 [2020-02-10 20:35:46,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:46,554 INFO L479 AbstractCegarLoop]: Abstraction has 6230 states and 34142 transitions. [2020-02-10 20:35:46,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6230 states and 34142 transitions. [2020-02-10 20:35:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:46,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:46,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, 1, 1, 1] [2020-02-10 20:35:46,565 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:46,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1679406524, now seen corresponding path program 180 times [2020-02-10 20:35:46,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:46,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809316397] [2020-02-10 20:35:46,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:47,138 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:35:47,284 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:35:47,438 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:35:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:47,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809316397] [2020-02-10 20:35:47,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:47,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:47,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953677095] [2020-02-10 20:35:47,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:47,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:47,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:47,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:47,450 INFO L87 Difference]: Start difference. First operand 6230 states and 34142 transitions. Second operand 13 states. [2020-02-10 20:35:47,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:47,750 INFO L93 Difference]: Finished difference Result 11927 states and 58677 transitions. [2020-02-10 20:35:47,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:47,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:47,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:47,780 INFO L225 Difference]: With dead ends: 11927 [2020-02-10 20:35:47,780 INFO L226 Difference]: Without dead ends: 11885 [2020-02-10 20:35:47,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11885 states. [2020-02-10 20:35:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11885 to 6209. [2020-02-10 20:35:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:35:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34094 transitions. [2020-02-10 20:35:48,386 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34094 transitions. Word has length 34 [2020-02-10 20:35:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:48,387 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34094 transitions. [2020-02-10 20:35:48,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34094 transitions. [2020-02-10 20:35:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:48,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:48,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:48,398 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:48,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:48,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1810659904, now seen corresponding path program 181 times [2020-02-10 20:35:48,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:48,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176429858] [2020-02-10 20:35:48,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:48,956 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:35:49,113 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2020-02-10 20:35:49,265 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:35:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:49,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176429858] [2020-02-10 20:35:49,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:49,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:49,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444732127] [2020-02-10 20:35:49,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:49,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:49,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:49,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:49,278 INFO L87 Difference]: Start difference. First operand 6209 states and 34094 transitions. Second operand 13 states. [2020-02-10 20:35:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:49,530 INFO L93 Difference]: Finished difference Result 11922 states and 58680 transitions. [2020-02-10 20:35:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:49,530 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:49,560 INFO L225 Difference]: With dead ends: 11922 [2020-02-10 20:35:49,560 INFO L226 Difference]: Without dead ends: 11898 [2020-02-10 20:35:49,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11898 states. [2020-02-10 20:35:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11898 to 6227. [2020-02-10 20:35:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6227 states. [2020-02-10 20:35:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 34144 transitions. [2020-02-10 20:35:50,317 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 34144 transitions. Word has length 34 [2020-02-10 20:35:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:50,318 INFO L479 AbstractCegarLoop]: Abstraction has 6227 states and 34144 transitions. [2020-02-10 20:35:50,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 34144 transitions. [2020-02-10 20:35:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:50,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:50,330 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:50,330 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:50,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:50,330 INFO L82 PathProgramCache]: Analyzing trace with hash 749881814, now seen corresponding path program 182 times [2020-02-10 20:35:50,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:50,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437230966] [2020-02-10 20:35:50,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:50,901 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:35:51,054 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:35:51,209 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:35:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:51,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437230966] [2020-02-10 20:35:51,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:51,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:51,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127615451] [2020-02-10 20:35:51,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:51,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:51,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:51,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:51,222 INFO L87 Difference]: Start difference. First operand 6227 states and 34144 transitions. Second operand 13 states. [2020-02-10 20:35:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:51,530 INFO L93 Difference]: Finished difference Result 11918 states and 58664 transitions. [2020-02-10 20:35:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:51,530 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:51,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:51,559 INFO L225 Difference]: With dead ends: 11918 [2020-02-10 20:35:51,560 INFO L226 Difference]: Without dead ends: 11889 [2020-02-10 20:35:51,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11889 states. [2020-02-10 20:35:52,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11889 to 6218. [2020-02-10 20:35:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:35:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34119 transitions. [2020-02-10 20:35:52,175 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34119 transitions. Word has length 34 [2020-02-10 20:35:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:52,175 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34119 transitions. [2020-02-10 20:35:52,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34119 transitions. [2020-02-10 20:35:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:52,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:52,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:52,187 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:52,187 INFO L82 PathProgramCache]: Analyzing trace with hash -739943386, now seen corresponding path program 183 times [2020-02-10 20:35:52,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:52,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427352980] [2020-02-10 20:35:52,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:52,761 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:35:52,907 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-02-10 20:35:53,058 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:53,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427352980] [2020-02-10 20:35:53,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:53,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:53,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561815324] [2020-02-10 20:35:53,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:53,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:53,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:53,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:53,071 INFO L87 Difference]: Start difference. First operand 6218 states and 34119 transitions. Second operand 13 states. [2020-02-10 20:35:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:53,336 INFO L93 Difference]: Finished difference Result 11924 states and 58676 transitions. [2020-02-10 20:35:53,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:53,337 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:53,366 INFO L225 Difference]: With dead ends: 11924 [2020-02-10 20:35:53,366 INFO L226 Difference]: Without dead ends: 11900 [2020-02-10 20:35:53,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2020-02-10 20:35:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 6228. [2020-02-10 20:35:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6228 states. [2020-02-10 20:35:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 34137 transitions. [2020-02-10 20:35:53,973 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 34137 transitions. Word has length 34 [2020-02-10 20:35:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:53,973 INFO L479 AbstractCegarLoop]: Abstraction has 6228 states and 34137 transitions. [2020-02-10 20:35:53,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 34137 transitions. [2020-02-10 20:35:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:53,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:53,984 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:53,985 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:53,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1857778966, now seen corresponding path program 184 times [2020-02-10 20:35:53,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:53,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967605497] [2020-02-10 20:35:53,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:54,558 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:35:54,705 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:35:54,857 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:54,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967605497] [2020-02-10 20:35:54,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:54,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:54,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765555344] [2020-02-10 20:35:54,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:54,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:54,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:54,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:54,870 INFO L87 Difference]: Start difference. First operand 6228 states and 34137 transitions. Second operand 13 states. [2020-02-10 20:35:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:55,243 INFO L93 Difference]: Finished difference Result 11921 states and 58661 transitions. [2020-02-10 20:35:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:55,243 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:55,273 INFO L225 Difference]: With dead ends: 11921 [2020-02-10 20:35:55,273 INFO L226 Difference]: Without dead ends: 11890 [2020-02-10 20:35:55,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11890 states. [2020-02-10 20:35:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11890 to 6218. [2020-02-10 20:35:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:35:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34110 transitions. [2020-02-10 20:35:56,005 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34110 transitions. Word has length 34 [2020-02-10 20:35:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:56,005 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34110 transitions. [2020-02-10 20:35:56,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34110 transitions. [2020-02-10 20:35:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:56,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:56,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, 1, 1, 1] [2020-02-10 20:35:56,016 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:56,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:56,016 INFO L82 PathProgramCache]: Analyzing trace with hash -325103898, now seen corresponding path program 185 times [2020-02-10 20:35:56,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:56,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378677423] [2020-02-10 20:35:56,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:56,575 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:35:56,718 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:35:56,871 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:35:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:56,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378677423] [2020-02-10 20:35:56,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:56,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:56,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431353044] [2020-02-10 20:35:56,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:56,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:56,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:56,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:56,884 INFO L87 Difference]: Start difference. First operand 6218 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:35:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:57,213 INFO L93 Difference]: Finished difference Result 11914 states and 58648 transitions. [2020-02-10 20:35:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:57,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:57,243 INFO L225 Difference]: With dead ends: 11914 [2020-02-10 20:35:57,243 INFO L226 Difference]: Without dead ends: 11894 [2020-02-10 20:35:57,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11894 states. [2020-02-10 20:35:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11894 to 6226. [2020-02-10 20:35:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6226 states. [2020-02-10 20:35:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6226 states to 6226 states and 34125 transitions. [2020-02-10 20:35:57,853 INFO L78 Accepts]: Start accepts. Automaton has 6226 states and 34125 transitions. Word has length 34 [2020-02-10 20:35:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:57,853 INFO L479 AbstractCegarLoop]: Abstraction has 6226 states and 34125 transitions. [2020-02-10 20:35:57,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6226 states and 34125 transitions. [2020-02-10 20:35:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:57,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:57,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:57,865 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:57,865 INFO L82 PathProgramCache]: Analyzing trace with hash -961570752, now seen corresponding path program 186 times [2020-02-10 20:35:57,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:57,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790179427] [2020-02-10 20:35:57,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:58,450 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:35:58,597 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:35:58,745 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:35:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:58,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790179427] [2020-02-10 20:35:58,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:58,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:35:58,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426842788] [2020-02-10 20:35:58,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:35:58,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:58,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:35:58,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:58,758 INFO L87 Difference]: Start difference. First operand 6226 states and 34125 transitions. Second operand 13 states. [2020-02-10 20:35:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:59,127 INFO L93 Difference]: Finished difference Result 11915 states and 58642 transitions. [2020-02-10 20:35:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:35:59,128 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:35:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:59,157 INFO L225 Difference]: With dead ends: 11915 [2020-02-10 20:35:59,157 INFO L226 Difference]: Without dead ends: 11877 [2020-02-10 20:35:59,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:35:59,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2020-02-10 20:35:59,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 6209. [2020-02-10 20:35:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:35:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34085 transitions. [2020-02-10 20:35:59,766 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34085 transitions. Word has length 34 [2020-02-10 20:35:59,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:59,767 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34085 transitions. [2020-02-10 20:35:59,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:35:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34085 transitions. [2020-02-10 20:35:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:35:59,778 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:59,778 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:59,778 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:35:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:59,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1159266394, now seen corresponding path program 187 times [2020-02-10 20:35:59,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:59,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705773480] [2020-02-10 20:35:59,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:00,337 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 20:36:00,488 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:36:00,638 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:36:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:00,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705773480] [2020-02-10 20:36:00,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:00,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:00,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207518604] [2020-02-10 20:36:00,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:00,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:00,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:00,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:00,650 INFO L87 Difference]: Start difference. First operand 6209 states and 34085 transitions. Second operand 13 states. [2020-02-10 20:36:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:00,949 INFO L93 Difference]: Finished difference Result 11912 states and 58653 transitions. [2020-02-10 20:36:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:00,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:00,982 INFO L225 Difference]: With dead ends: 11912 [2020-02-10 20:36:00,983 INFO L226 Difference]: Without dead ends: 11890 [2020-02-10 20:36:00,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11890 states. [2020-02-10 20:36:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11890 to 6225. [2020-02-10 20:36:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:36:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34131 transitions. [2020-02-10 20:36:01,691 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34131 transitions. Word has length 34 [2020-02-10 20:36:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:01,691 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34131 transitions. [2020-02-10 20:36:01,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34131 transitions. [2020-02-10 20:36:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:01,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:01,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, 1, 1, 1] [2020-02-10 20:36:01,703 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:01,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:01,703 INFO L82 PathProgramCache]: Analyzing trace with hash 734955158, now seen corresponding path program 188 times [2020-02-10 20:36:01,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:01,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967167128] [2020-02-10 20:36:01,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:02,256 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 20:36:02,404 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:36:02,554 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:36:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:02,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967167128] [2020-02-10 20:36:02,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:02,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:02,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132510806] [2020-02-10 20:36:02,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:02,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:02,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:02,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:02,566 INFO L87 Difference]: Start difference. First operand 6225 states and 34131 transitions. Second operand 13 states. [2020-02-10 20:36:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:02,917 INFO L93 Difference]: Finished difference Result 11910 states and 58641 transitions. [2020-02-10 20:36:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:02,917 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:02,946 INFO L225 Difference]: With dead ends: 11910 [2020-02-10 20:36:02,947 INFO L226 Difference]: Without dead ends: 11882 [2020-02-10 20:36:02,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:03,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11882 states. [2020-02-10 20:36:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11882 to 6217. [2020-02-10 20:36:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:36:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34108 transitions. [2020-02-10 20:36:03,568 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34108 transitions. Word has length 34 [2020-02-10 20:36:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:03,568 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34108 transitions. [2020-02-10 20:36:03,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34108 transitions. [2020-02-10 20:36:03,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:03,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:03,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, 1, 1, 1] [2020-02-10 20:36:03,579 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:03,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:03,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1391336896, now seen corresponding path program 189 times [2020-02-10 20:36:03,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:03,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441816962] [2020-02-10 20:36:03,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:04,152 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:36:04,295 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:36:04,441 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-02-10 20:36:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:04,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441816962] [2020-02-10 20:36:04,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:04,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:04,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313295565] [2020-02-10 20:36:04,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:04,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:04,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:04,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:04,453 INFO L87 Difference]: Start difference. First operand 6217 states and 34108 transitions. Second operand 13 states. [2020-02-10 20:36:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:04,780 INFO L93 Difference]: Finished difference Result 11914 states and 58650 transitions. [2020-02-10 20:36:04,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:04,781 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:04,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:04,811 INFO L225 Difference]: With dead ends: 11914 [2020-02-10 20:36:04,811 INFO L226 Difference]: Without dead ends: 11892 [2020-02-10 20:36:04,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states. [2020-02-10 20:36:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 6226. [2020-02-10 20:36:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6226 states. [2020-02-10 20:36:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6226 states to 6226 states and 34125 transitions. [2020-02-10 20:36:05,419 INFO L78 Accepts]: Start accepts. Automaton has 6226 states and 34125 transitions. Word has length 34 [2020-02-10 20:36:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:05,419 INFO L479 AbstractCegarLoop]: Abstraction has 6226 states and 34125 transitions. [2020-02-10 20:36:05,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 6226 states and 34125 transitions. [2020-02-10 20:36:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:05,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:05,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, 1, 1, 1] [2020-02-10 20:36:05,430 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:05,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1842852310, now seen corresponding path program 190 times [2020-02-10 20:36:05,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:05,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815541518] [2020-02-10 20:36:05,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:06,005 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:36:06,150 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:36:06,302 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:36:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:06,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815541518] [2020-02-10 20:36:06,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:06,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:06,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452037391] [2020-02-10 20:36:06,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:06,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:06,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:06,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:06,315 INFO L87 Difference]: Start difference. First operand 6226 states and 34125 transitions. Second operand 13 states. [2020-02-10 20:36:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:06,649 INFO L93 Difference]: Finished difference Result 11913 states and 58639 transitions. [2020-02-10 20:36:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:06,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:06,678 INFO L225 Difference]: With dead ends: 11913 [2020-02-10 20:36:06,678 INFO L226 Difference]: Without dead ends: 11883 [2020-02-10 20:36:06,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2020-02-10 20:36:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 6217. [2020-02-10 20:36:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:36:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34100 transitions. [2020-02-10 20:36:07,385 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34100 transitions. Word has length 34 [2020-02-10 20:36:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:07,386 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34100 transitions. [2020-02-10 20:36:07,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:07,386 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34100 transitions. [2020-02-10 20:36:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:07,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:07,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, 1, 1, 1] [2020-02-10 20:36:07,397 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:07,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2084394560, now seen corresponding path program 191 times [2020-02-10 20:36:07,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:07,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990132817] [2020-02-10 20:36:07,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:08,103 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:36:08,257 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-02-10 20:36:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:08,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990132817] [2020-02-10 20:36:08,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:08,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:08,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070220754] [2020-02-10 20:36:08,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:08,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:08,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:08,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:08,270 INFO L87 Difference]: Start difference. First operand 6217 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:36:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:08,598 INFO L93 Difference]: Finished difference Result 11909 states and 58631 transitions. [2020-02-10 20:36:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:08,599 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:08,629 INFO L225 Difference]: With dead ends: 11909 [2020-02-10 20:36:08,629 INFO L226 Difference]: Without dead ends: 11889 [2020-02-10 20:36:08,629 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11889 states. [2020-02-10 20:36:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11889 to 6225. [2020-02-10 20:36:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2020-02-10 20:36:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 34115 transitions. [2020-02-10 20:36:09,238 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 34115 transitions. Word has length 34 [2020-02-10 20:36:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:09,238 INFO L479 AbstractCegarLoop]: Abstraction has 6225 states and 34115 transitions. [2020-02-10 20:36:09,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 34115 transitions. [2020-02-10 20:36:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:09,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:09,249 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:09,249 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:09,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1574105882, now seen corresponding path program 192 times [2020-02-10 20:36:09,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:09,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391981978] [2020-02-10 20:36:09,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:09,821 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:36:09,967 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:36:10,113 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:36:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:10,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391981978] [2020-02-10 20:36:10,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:10,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:10,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947914684] [2020-02-10 20:36:10,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:10,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:10,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:10,126 INFO L87 Difference]: Start difference. First operand 6225 states and 34115 transitions. Second operand 13 states. [2020-02-10 20:36:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:10,447 INFO L93 Difference]: Finished difference Result 11910 states and 58625 transitions. [2020-02-10 20:36:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:10,447 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:10,476 INFO L225 Difference]: With dead ends: 11910 [2020-02-10 20:36:10,477 INFO L226 Difference]: Without dead ends: 11861 [2020-02-10 20:36:10,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11861 states. [2020-02-10 20:36:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11861 to 6197. [2020-02-10 20:36:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2020-02-10 20:36:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 34055 transitions. [2020-02-10 20:36:11,086 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 34055 transitions. Word has length 34 [2020-02-10 20:36:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:11,086 INFO L479 AbstractCegarLoop]: Abstraction has 6197 states and 34055 transitions. [2020-02-10 20:36:11,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 34055 transitions. [2020-02-10 20:36:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:11,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:11,097 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:11,097 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1168931478, now seen corresponding path program 193 times [2020-02-10 20:36:11,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:11,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976472020] [2020-02-10 20:36:11,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:11,663 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:36:11,809 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:36:11,962 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:36:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:11,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976472020] [2020-02-10 20:36:11,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:11,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:11,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038127072] [2020-02-10 20:36:11,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:11,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:11,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:11,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:11,975 INFO L87 Difference]: Start difference. First operand 6197 states and 34055 transitions. Second operand 13 states. [2020-02-10 20:36:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:12,287 INFO L93 Difference]: Finished difference Result 11888 states and 58602 transitions. [2020-02-10 20:36:12,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:12,287 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:12,316 INFO L225 Difference]: With dead ends: 11888 [2020-02-10 20:36:12,316 INFO L226 Difference]: Without dead ends: 11869 [2020-02-10 20:36:12,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2020-02-10 20:36:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 6221. [2020-02-10 20:36:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:36:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34138 transitions. [2020-02-10 20:36:13,018 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34138 transitions. Word has length 34 [2020-02-10 20:36:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:13,018 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34138 transitions. [2020-02-10 20:36:13,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34138 transitions. [2020-02-10 20:36:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:13,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:13,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, 1, 1, 1] [2020-02-10 20:36:13,029 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:13,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash 183995194, now seen corresponding path program 194 times [2020-02-10 20:36:13,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:13,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052358511] [2020-02-10 20:36:13,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:13,594 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:36:13,747 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-02-10 20:36:13,900 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:36:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:13,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052358511] [2020-02-10 20:36:13,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:13,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:13,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759235920] [2020-02-10 20:36:13,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:13,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:13,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:13,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:13,912 INFO L87 Difference]: Start difference. First operand 6221 states and 34138 transitions. Second operand 13 states. [2020-02-10 20:36:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:14,276 INFO L93 Difference]: Finished difference Result 11893 states and 58604 transitions. [2020-02-10 20:36:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:14,276 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:14,310 INFO L225 Difference]: With dead ends: 11893 [2020-02-10 20:36:14,310 INFO L226 Difference]: Without dead ends: 11861 [2020-02-10 20:36:14,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11861 states. [2020-02-10 20:36:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11861 to 6213. [2020-02-10 20:36:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:36:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34115 transitions. [2020-02-10 20:36:14,925 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34115 transitions. Word has length 34 [2020-02-10 20:36:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:14,925 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34115 transitions. [2020-02-10 20:36:14,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34115 transitions. [2020-02-10 20:36:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:14,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:14,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:14,937 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:14,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:14,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1650418240, now seen corresponding path program 195 times [2020-02-10 20:36:14,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:14,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296809367] [2020-02-10 20:36:14,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:15,507 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-02-10 20:36:15,651 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:36:15,803 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:36:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:15,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296809367] [2020-02-10 20:36:15,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:15,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:15,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836229661] [2020-02-10 20:36:15,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:15,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:15,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:15,815 INFO L87 Difference]: Start difference. First operand 6213 states and 34115 transitions. Second operand 13 states. [2020-02-10 20:36:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:16,217 INFO L93 Difference]: Finished difference Result 11883 states and 58585 transitions. [2020-02-10 20:36:16,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:16,221 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:16,250 INFO L225 Difference]: With dead ends: 11883 [2020-02-10 20:36:16,250 INFO L226 Difference]: Without dead ends: 11864 [2020-02-10 20:36:16,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11864 states. [2020-02-10 20:36:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11864 to 6220. [2020-02-10 20:36:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:36:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34128 transitions. [2020-02-10 20:36:16,860 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34128 transitions. Word has length 34 [2020-02-10 20:36:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:16,860 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34128 transitions. [2020-02-10 20:36:16,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:16,861 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34128 transitions. [2020-02-10 20:36:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:16,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:16,871 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:16,871 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:16,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:16,872 INFO L82 PathProgramCache]: Analyzing trace with hash -350038310, now seen corresponding path program 196 times [2020-02-10 20:36:16,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:16,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159126664] [2020-02-10 20:36:16,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:17,452 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-02-10 20:36:17,599 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:36:17,752 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:36:17,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:17,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159126664] [2020-02-10 20:36:17,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:17,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:17,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847644697] [2020-02-10 20:36:17,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:17,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:17,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:17,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:17,765 INFO L87 Difference]: Start difference. First operand 6220 states and 34128 transitions. Second operand 13 states. [2020-02-10 20:36:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:18,177 INFO L93 Difference]: Finished difference Result 11884 states and 58580 transitions. [2020-02-10 20:36:18,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:18,178 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:18,207 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 20:36:18,207 INFO L226 Difference]: Without dead ends: 11857 [2020-02-10 20:36:18,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:18,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2020-02-10 20:36:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 6213. [2020-02-10 20:36:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:36:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34108 transitions. [2020-02-10 20:36:18,903 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34108 transitions. Word has length 34 [2020-02-10 20:36:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:18,903 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34108 transitions. [2020-02-10 20:36:18,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34108 transitions. [2020-02-10 20:36:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:18,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:18,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, 1, 1, 1] [2020-02-10 20:36:18,914 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:18,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:18,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1841067360, now seen corresponding path program 197 times [2020-02-10 20:36:18,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:18,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304267492] [2020-02-10 20:36:18,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:19,486 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:36:19,644 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2020-02-10 20:36:19,793 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:36:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:19,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304267492] [2020-02-10 20:36:19,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:19,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:19,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322327821] [2020-02-10 20:36:19,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:19,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:19,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:19,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:19,804 INFO L87 Difference]: Start difference. First operand 6213 states and 34108 transitions. Second operand 13 states. [2020-02-10 20:36:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:20,092 INFO L93 Difference]: Finished difference Result 11895 states and 58601 transitions. [2020-02-10 20:36:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:20,092 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:20,122 INFO L225 Difference]: With dead ends: 11895 [2020-02-10 20:36:20,122 INFO L226 Difference]: Without dead ends: 11871 [2020-02-10 20:36:20,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11871 states. [2020-02-10 20:36:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11871 to 6222. [2020-02-10 20:36:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:36:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34124 transitions. [2020-02-10 20:36:20,729 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34124 transitions. Word has length 34 [2020-02-10 20:36:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:20,729 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34124 transitions. [2020-02-10 20:36:20,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34124 transitions. [2020-02-10 20:36:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:20,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:20,740 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:20,740 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:20,740 INFO L82 PathProgramCache]: Analyzing trace with hash 149318464, now seen corresponding path program 198 times [2020-02-10 20:36:20,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:20,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809079484] [2020-02-10 20:36:20,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:21,304 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:36:21,451 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:36:21,606 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:36:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:21,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809079484] [2020-02-10 20:36:21,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:21,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:21,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706390769] [2020-02-10 20:36:21,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:21,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:21,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:21,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:21,618 INFO L87 Difference]: Start difference. First operand 6222 states and 34124 transitions. Second operand 13 states. [2020-02-10 20:36:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:21,926 INFO L93 Difference]: Finished difference Result 11891 states and 58585 transitions. [2020-02-10 20:36:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:21,927 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:21,956 INFO L225 Difference]: With dead ends: 11891 [2020-02-10 20:36:21,956 INFO L226 Difference]: Without dead ends: 11854 [2020-02-10 20:36:21,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:22,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2020-02-10 20:36:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 6205. [2020-02-10 20:36:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2020-02-10 20:36:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 34085 transitions. [2020-02-10 20:36:22,567 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 34085 transitions. Word has length 34 [2020-02-10 20:36:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:22,567 INFO L479 AbstractCegarLoop]: Abstraction has 6205 states and 34085 transitions. [2020-02-10 20:36:22,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 34085 transitions. [2020-02-10 20:36:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:22,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:22,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:22,578 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash -590359184, now seen corresponding path program 199 times [2020-02-10 20:36:22,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:22,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387382899] [2020-02-10 20:36:22,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:23,128 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:36:23,274 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:36:23,427 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:36:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:23,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387382899] [2020-02-10 20:36:23,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:23,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:23,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983257209] [2020-02-10 20:36:23,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:23,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:23,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:23,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:23,440 INFO L87 Difference]: Start difference. First operand 6205 states and 34085 transitions. Second operand 13 states. [2020-02-10 20:36:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:23,929 INFO L93 Difference]: Finished difference Result 11890 states and 58599 transitions. [2020-02-10 20:36:23,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:23,930 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:23,958 INFO L225 Difference]: With dead ends: 11890 [2020-02-10 20:36:23,959 INFO L226 Difference]: Without dead ends: 11871 [2020-02-10 20:36:23,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11871 states. [2020-02-10 20:36:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11871 to 6221. [2020-02-10 20:36:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:36:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34130 transitions. [2020-02-10 20:36:24,650 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34130 transitions. Word has length 34 [2020-02-10 20:36:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:24,650 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34130 transitions. [2020-02-10 20:36:24,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34130 transitions. [2020-02-10 20:36:24,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:24,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:24,662 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:24,662 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:24,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1575295468, now seen corresponding path program 200 times [2020-02-10 20:36:24,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:24,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197273498] [2020-02-10 20:36:24,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:25,214 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:36:25,368 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:36:25,517 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:36:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:25,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197273498] [2020-02-10 20:36:25,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:25,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:25,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245033165] [2020-02-10 20:36:25,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:25,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:25,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:25,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:25,529 INFO L87 Difference]: Start difference. First operand 6221 states and 34130 transitions. Second operand 13 states. [2020-02-10 20:36:25,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:25,982 INFO L93 Difference]: Finished difference Result 11895 states and 58601 transitions. [2020-02-10 20:36:25,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:25,982 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:26,011 INFO L225 Difference]: With dead ends: 11895 [2020-02-10 20:36:26,012 INFO L226 Difference]: Without dead ends: 11863 [2020-02-10 20:36:26,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:26,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11863 states. [2020-02-10 20:36:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11863 to 6213. [2020-02-10 20:36:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:36:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34107 transitions. [2020-02-10 20:36:26,629 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34107 transitions. Word has length 34 [2020-02-10 20:36:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:26,629 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34107 transitions. [2020-02-10 20:36:26,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34107 transitions. [2020-02-10 20:36:26,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:26,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:26,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:26,640 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:26,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:26,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1665344896, now seen corresponding path program 201 times [2020-02-10 20:36:26,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:26,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884157875] [2020-02-10 20:36:26,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:27,321 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:36:27,467 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:36:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:27,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884157875] [2020-02-10 20:36:27,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:27,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:27,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149011670] [2020-02-10 20:36:27,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:27,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:27,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:27,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:27,479 INFO L87 Difference]: Start difference. First operand 6213 states and 34107 transitions. Second operand 13 states. [2020-02-10 20:36:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:27,778 INFO L93 Difference]: Finished difference Result 11886 states and 58584 transitions. [2020-02-10 20:36:27,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:27,779 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:27,808 INFO L225 Difference]: With dead ends: 11886 [2020-02-10 20:36:27,808 INFO L226 Difference]: Without dead ends: 11867 [2020-02-10 20:36:27,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11867 states. [2020-02-10 20:36:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11867 to 6220. [2020-02-10 20:36:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:36:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34120 transitions. [2020-02-10 20:36:28,415 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34120 transitions. Word has length 34 [2020-02-10 20:36:28,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:28,416 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34120 transitions. [2020-02-10 20:36:28,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34120 transitions. [2020-02-10 20:36:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:28,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:28,427 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:28,427 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:28,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash -249184588, now seen corresponding path program 202 times [2020-02-10 20:36:28,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:28,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176856712] [2020-02-10 20:36:28,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:29,101 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:36:29,252 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:36:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:29,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176856712] [2020-02-10 20:36:29,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:29,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:29,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641402741] [2020-02-10 20:36:29,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:29,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:29,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:29,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:29,264 INFO L87 Difference]: Start difference. First operand 6220 states and 34120 transitions. Second operand 13 states. [2020-02-10 20:36:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:29,556 INFO L93 Difference]: Finished difference Result 11888 states and 58581 transitions. [2020-02-10 20:36:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:29,556 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:29,585 INFO L225 Difference]: With dead ends: 11888 [2020-02-10 20:36:29,586 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 20:36:29,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 20:36:30,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6213. [2020-02-10 20:36:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:36:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34100 transitions. [2020-02-10 20:36:30,283 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34100 transitions. Word has length 34 [2020-02-10 20:36:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:30,283 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34100 transitions. [2020-02-10 20:36:30,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34100 transitions. [2020-02-10 20:36:30,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:30,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:30,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:30,294 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:30,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:30,295 INFO L82 PathProgramCache]: Analyzing trace with hash -623998880, now seen corresponding path program 203 times [2020-02-10 20:36:30,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:30,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300314151] [2020-02-10 20:36:30,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:30,845 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:36:30,991 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:36:31,141 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:36:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:31,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300314151] [2020-02-10 20:36:31,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:31,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:31,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168761942] [2020-02-10 20:36:31,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:31,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:31,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:31,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:31,153 INFO L87 Difference]: Start difference. First operand 6213 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:36:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:31,395 INFO L93 Difference]: Finished difference Result 11899 states and 58603 transitions. [2020-02-10 20:36:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:31,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:31,425 INFO L225 Difference]: With dead ends: 11899 [2020-02-10 20:36:31,425 INFO L226 Difference]: Without dead ends: 11875 [2020-02-10 20:36:31,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11875 states. [2020-02-10 20:36:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11875 to 6223. [2020-02-10 20:36:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:36:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34118 transitions. [2020-02-10 20:36:32,035 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34118 transitions. Word has length 34 [2020-02-10 20:36:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:32,035 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34118 transitions. [2020-02-10 20:36:32,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34118 transitions. [2020-02-10 20:36:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:32,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:32,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:32,045 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1877214864, now seen corresponding path program 204 times [2020-02-10 20:36:32,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:32,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124779083] [2020-02-10 20:36:32,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:32,596 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:36:32,743 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:36:32,891 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:36:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:32,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124779083] [2020-02-10 20:36:32,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:32,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:32,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299123385] [2020-02-10 20:36:32,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:32,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:32,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:32,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:32,903 INFO L87 Difference]: Start difference. First operand 6223 states and 34118 transitions. Second operand 13 states. [2020-02-10 20:36:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:33,262 INFO L93 Difference]: Finished difference Result 11896 states and 58588 transitions. [2020-02-10 20:36:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:33,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:33,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:33,293 INFO L225 Difference]: With dead ends: 11896 [2020-02-10 20:36:33,293 INFO L226 Difference]: Without dead ends: 11857 [2020-02-10 20:36:33,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:33,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2020-02-10 20:36:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 6205. [2020-02-10 20:36:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2020-02-10 20:36:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 34077 transitions. [2020-02-10 20:36:33,898 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 34077 transitions. Word has length 34 [2020-02-10 20:36:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:33,898 INFO L479 AbstractCegarLoop]: Abstraction has 6205 states and 34077 transitions. [2020-02-10 20:36:33,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 34077 transitions. [2020-02-10 20:36:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:33,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:33,909 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:33,909 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash -615236944, now seen corresponding path program 205 times [2020-02-10 20:36:33,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:33,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6278805] [2020-02-10 20:36:33,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:34,479 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-02-10 20:36:34,628 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:36:34,780 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:36:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:34,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6278805] [2020-02-10 20:36:34,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:34,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:34,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033580272] [2020-02-10 20:36:34,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:34,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:34,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:34,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:34,792 INFO L87 Difference]: Start difference. First operand 6205 states and 34077 transitions. Second operand 13 states. [2020-02-10 20:36:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:35,195 INFO L93 Difference]: Finished difference Result 11877 states and 58565 transitions. [2020-02-10 20:36:35,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:35,196 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:35,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:35,225 INFO L225 Difference]: With dead ends: 11877 [2020-02-10 20:36:35,226 INFO L226 Difference]: Without dead ends: 11858 [2020-02-10 20:36:35,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2020-02-10 20:36:35,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 6219. [2020-02-10 20:36:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:36:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34117 transitions. [2020-02-10 20:36:35,932 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34117 transitions. Word has length 34 [2020-02-10 20:36:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:35,932 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34117 transitions. [2020-02-10 20:36:35,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34117 transitions. [2020-02-10 20:36:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:35,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:35,944 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:35,944 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:35,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash 685142986, now seen corresponding path program 206 times [2020-02-10 20:36:35,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:35,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333203987] [2020-02-10 20:36:35,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:36,489 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2020-02-10 20:36:36,636 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:36:36,788 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:36:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:36,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333203987] [2020-02-10 20:36:36,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:36,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:36,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105910482] [2020-02-10 20:36:36,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:36,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:36,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:36,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:36,801 INFO L87 Difference]: Start difference. First operand 6219 states and 34117 transitions. Second operand 13 states. [2020-02-10 20:36:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:37,104 INFO L93 Difference]: Finished difference Result 11878 states and 58560 transitions. [2020-02-10 20:36:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:37,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:37,134 INFO L225 Difference]: With dead ends: 11878 [2020-02-10 20:36:37,134 INFO L226 Difference]: Without dead ends: 11851 [2020-02-10 20:36:37,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:37,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11851 states. [2020-02-10 20:36:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11851 to 6212. [2020-02-10 20:36:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:36:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34097 transitions. [2020-02-10 20:36:37,745 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34097 transitions. Word has length 34 [2020-02-10 20:36:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:37,745 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34097 transitions. [2020-02-10 20:36:37,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34097 transitions. [2020-02-10 20:36:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:37,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:37,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:37,756 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1129127062, now seen corresponding path program 207 times [2020-02-10 20:36:37,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:37,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488828872] [2020-02-10 20:36:37,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:38,458 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:36:38,608 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:36:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:38,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488828872] [2020-02-10 20:36:38,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:38,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:38,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571474865] [2020-02-10 20:36:38,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:38,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:38,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:38,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:38,620 INFO L87 Difference]: Start difference. First operand 6212 states and 34097 transitions. Second operand 13 states. [2020-02-10 20:36:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:38,927 INFO L93 Difference]: Finished difference Result 11878 states and 58560 transitions. [2020-02-10 20:36:38,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:38,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:38,958 INFO L225 Difference]: With dead ends: 11878 [2020-02-10 20:36:38,958 INFO L226 Difference]: Without dead ends: 11859 [2020-02-10 20:36:38,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11859 states. [2020-02-10 20:36:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11859 to 6219. [2020-02-10 20:36:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:36:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34110 transitions. [2020-02-10 20:36:39,564 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34110 transitions. Word has length 34 [2020-02-10 20:36:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:39,564 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34110 transitions. [2020-02-10 20:36:39,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34110 transitions. [2020-02-10 20:36:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:39,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:39,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, 1, 1, 1] [2020-02-10 20:36:39,575 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1749679926, now seen corresponding path program 208 times [2020-02-10 20:36:39,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:39,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543577199] [2020-02-10 20:36:39,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:40,266 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:36:40,412 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 37 [2020-02-10 20:36:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:40,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543577199] [2020-02-10 20:36:40,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:40,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:40,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520490589] [2020-02-10 20:36:40,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:40,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:40,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:40,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:40,424 INFO L87 Difference]: Start difference. First operand 6219 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:36:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:40,796 INFO L93 Difference]: Finished difference Result 11880 states and 58557 transitions. [2020-02-10 20:36:40,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:40,797 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:40,826 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 20:36:40,826 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:36:40,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:36:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6212. [2020-02-10 20:36:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:36:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34090 transitions. [2020-02-10 20:36:41,534 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34090 transitions. Word has length 34 [2020-02-10 20:36:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:41,534 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34090 transitions. [2020-02-10 20:36:41,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34090 transitions. [2020-02-10 20:36:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:41,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:41,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, 1, 1, 1] [2020-02-10 20:36:41,546 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:41,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:41,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1636439574, now seen corresponding path program 209 times [2020-02-10 20:36:41,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:41,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140901903] [2020-02-10 20:36:41,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:42,093 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:36:42,234 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:36:42,388 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:36:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:42,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140901903] [2020-02-10 20:36:42,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:42,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:42,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563787286] [2020-02-10 20:36:42,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:42,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:42,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:42,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:42,400 INFO L87 Difference]: Start difference. First operand 6212 states and 34090 transitions. Second operand 13 states. [2020-02-10 20:36:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:42,790 INFO L93 Difference]: Finished difference Result 11881 states and 58560 transitions. [2020-02-10 20:36:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:42,791 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:42,820 INFO L225 Difference]: With dead ends: 11881 [2020-02-10 20:36:42,820 INFO L226 Difference]: Without dead ends: 11861 [2020-02-10 20:36:42,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11861 states. [2020-02-10 20:36:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11861 to 6220. [2020-02-10 20:36:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:36:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34105 transitions. [2020-02-10 20:36:43,430 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34105 transitions. Word has length 34 [2020-02-10 20:36:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:43,430 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34105 transitions. [2020-02-10 20:36:43,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34105 transitions. [2020-02-10 20:36:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:43,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:43,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, 1, 1, 1] [2020-02-10 20:36:43,441 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:43,441 INFO L82 PathProgramCache]: Analyzing trace with hash -92607760, now seen corresponding path program 210 times [2020-02-10 20:36:43,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:43,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646001326] [2020-02-10 20:36:43,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:44,000 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:36:44,141 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:36:44,290 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:36:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:44,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646001326] [2020-02-10 20:36:44,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:44,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:44,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203823232] [2020-02-10 20:36:44,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:44,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:44,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:44,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:44,301 INFO L87 Difference]: Start difference. First operand 6220 states and 34105 transitions. Second operand 13 states. [2020-02-10 20:36:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:44,751 INFO L93 Difference]: Finished difference Result 11882 states and 58554 transitions. [2020-02-10 20:36:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:44,751 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:44,781 INFO L225 Difference]: With dead ends: 11882 [2020-02-10 20:36:44,781 INFO L226 Difference]: Without dead ends: 11846 [2020-02-10 20:36:44,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11846 states. [2020-02-10 20:36:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11846 to 6205. [2020-02-10 20:36:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2020-02-10 20:36:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 34070 transitions. [2020-02-10 20:36:45,386 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 34070 transitions. Word has length 34 [2020-02-10 20:36:45,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:45,387 INFO L479 AbstractCegarLoop]: Abstraction has 6205 states and 34070 transitions. [2020-02-10 20:36:45,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 34070 transitions. [2020-02-10 20:36:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:45,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:45,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, 1, 1, 1] [2020-02-10 20:36:45,398 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:45,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:45,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1266490516, now seen corresponding path program 211 times [2020-02-10 20:36:45,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:45,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492035147] [2020-02-10 20:36:45,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:45,989 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:36:46,147 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2020-02-10 20:36:46,299 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:36:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:46,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492035147] [2020-02-10 20:36:46,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:46,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:46,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156058322] [2020-02-10 20:36:46,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:46,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:46,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:46,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:46,311 INFO L87 Difference]: Start difference. First operand 6205 states and 34070 transitions. Second operand 13 states. [2020-02-10 20:36:46,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:46,657 INFO L93 Difference]: Finished difference Result 11901 states and 58610 transitions. [2020-02-10 20:36:46,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:46,658 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:46,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:46,688 INFO L225 Difference]: With dead ends: 11901 [2020-02-10 20:36:46,688 INFO L226 Difference]: Without dead ends: 11877 [2020-02-10 20:36:46,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2020-02-10 20:36:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 6223. [2020-02-10 20:36:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6223 states. [2020-02-10 20:36:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 34120 transitions. [2020-02-10 20:36:47,421 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 34120 transitions. Word has length 34 [2020-02-10 20:36:47,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:47,422 INFO L479 AbstractCegarLoop]: Abstraction has 6223 states and 34120 transitions. [2020-02-10 20:36:47,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 34120 transitions. [2020-02-10 20:36:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:47,432 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:47,432 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:47,432 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:47,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:47,432 INFO L82 PathProgramCache]: Analyzing trace with hash -425258380, now seen corresponding path program 212 times [2020-02-10 20:36:47,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:47,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293612868] [2020-02-10 20:36:47,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:47,981 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 20:36:48,127 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:36:48,273 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:36:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:48,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293612868] [2020-02-10 20:36:48,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:48,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:48,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757257858] [2020-02-10 20:36:48,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:48,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:48,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:48,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:48,284 INFO L87 Difference]: Start difference. First operand 6223 states and 34120 transitions. Second operand 13 states. [2020-02-10 20:36:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:48,586 INFO L93 Difference]: Finished difference Result 11897 states and 58594 transitions. [2020-02-10 20:36:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:48,587 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:48,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:48,615 INFO L225 Difference]: With dead ends: 11897 [2020-02-10 20:36:48,615 INFO L226 Difference]: Without dead ends: 11868 [2020-02-10 20:36:48,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2020-02-10 20:36:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 6214. [2020-02-10 20:36:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:36:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34095 transitions. [2020-02-10 20:36:49,227 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34095 transitions. Word has length 34 [2020-02-10 20:36:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:49,227 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34095 transitions. [2020-02-10 20:36:49,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34095 transitions. [2020-02-10 20:36:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:49,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:49,238 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:49,238 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:49,238 INFO L82 PathProgramCache]: Analyzing trace with hash -794369286, now seen corresponding path program 213 times [2020-02-10 20:36:49,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:49,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696652799] [2020-02-10 20:36:49,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:49,794 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:36:49,947 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2020-02-10 20:36:50,099 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:36:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:50,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696652799] [2020-02-10 20:36:50,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:50,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:50,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554779165] [2020-02-10 20:36:50,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:50,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:50,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:50,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:50,111 INFO L87 Difference]: Start difference. First operand 6214 states and 34095 transitions. Second operand 13 states. [2020-02-10 20:36:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:50,394 INFO L93 Difference]: Finished difference Result 11903 states and 58606 transitions. [2020-02-10 20:36:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:50,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:50,424 INFO L225 Difference]: With dead ends: 11903 [2020-02-10 20:36:50,424 INFO L226 Difference]: Without dead ends: 11879 [2020-02-10 20:36:50,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11879 states. [2020-02-10 20:36:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11879 to 6224. [2020-02-10 20:36:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2020-02-10 20:36:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 34113 transitions. [2020-02-10 20:36:51,033 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 34113 transitions. Word has length 34 [2020-02-10 20:36:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:51,034 INFO L479 AbstractCegarLoop]: Abstraction has 6224 states and 34113 transitions. [2020-02-10 20:36:51,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 34113 transitions. [2020-02-10 20:36:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:51,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:51,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:51,045 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:51,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:51,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2047585270, now seen corresponding path program 214 times [2020-02-10 20:36:51,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:51,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956414560] [2020-02-10 20:36:51,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:51,599 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:36:51,745 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:36:51,900 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:36:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:51,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956414560] [2020-02-10 20:36:51,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:51,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:51,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110844348] [2020-02-10 20:36:51,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:51,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:51,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:51,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:51,912 INFO L87 Difference]: Start difference. First operand 6224 states and 34113 transitions. Second operand 13 states. [2020-02-10 20:36:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:52,264 INFO L93 Difference]: Finished difference Result 11900 states and 58591 transitions. [2020-02-10 20:36:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:52,265 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:52,294 INFO L225 Difference]: With dead ends: 11900 [2020-02-10 20:36:52,295 INFO L226 Difference]: Without dead ends: 11869 [2020-02-10 20:36:52,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2020-02-10 20:36:52,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 6214. [2020-02-10 20:36:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:36:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34086 transitions. [2020-02-10 20:36:53,053 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34086 transitions. Word has length 34 [2020-02-10 20:36:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:53,053 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34086 transitions. [2020-02-10 20:36:53,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34086 transitions. [2020-02-10 20:36:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:53,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:53,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:53,066 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:53,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:53,066 INFO L82 PathProgramCache]: Analyzing trace with hash -926406668, now seen corresponding path program 215 times [2020-02-10 20:36:53,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:53,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653957220] [2020-02-10 20:36:53,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:53,621 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:36:53,765 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:36:53,916 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:36:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:53,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653957220] [2020-02-10 20:36:53,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:53,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:53,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801918568] [2020-02-10 20:36:53,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:53,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:53,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:53,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:53,928 INFO L87 Difference]: Start difference. First operand 6214 states and 34086 transitions. Second operand 13 states. [2020-02-10 20:36:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:54,274 INFO L93 Difference]: Finished difference Result 11893 states and 58578 transitions. [2020-02-10 20:36:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:54,274 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:54,305 INFO L225 Difference]: With dead ends: 11893 [2020-02-10 20:36:54,305 INFO L226 Difference]: Without dead ends: 11873 [2020-02-10 20:36:54,305 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11873 states. [2020-02-10 20:36:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11873 to 6222. [2020-02-10 20:36:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:36:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34101 transitions. [2020-02-10 20:36:54,915 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34101 transitions. Word has length 34 [2020-02-10 20:36:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:54,915 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34101 transitions. [2020-02-10 20:36:54,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34101 transitions. [2020-02-10 20:36:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:54,926 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:54,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, 1, 1, 1] [2020-02-10 20:36:54,926 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:54,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1650216922, now seen corresponding path program 216 times [2020-02-10 20:36:54,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:54,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880866711] [2020-02-10 20:36:54,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:55,493 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:36:55,642 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:36:55,792 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:36:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:55,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880866711] [2020-02-10 20:36:55,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:55,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:55,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431833551] [2020-02-10 20:36:55,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:55,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:55,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:55,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:55,803 INFO L87 Difference]: Start difference. First operand 6222 states and 34101 transitions. Second operand 13 states. [2020-02-10 20:36:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:56,149 INFO L93 Difference]: Finished difference Result 11894 states and 58572 transitions. [2020-02-10 20:36:56,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:56,150 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:56,179 INFO L225 Difference]: With dead ends: 11894 [2020-02-10 20:36:56,179 INFO L226 Difference]: Without dead ends: 11848 [2020-02-10 20:36:56,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2020-02-10 20:36:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 6197. [2020-02-10 20:36:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2020-02-10 20:36:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 34047 transitions. [2020-02-10 20:36:56,784 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 34047 transitions. Word has length 34 [2020-02-10 20:36:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:56,784 INFO L479 AbstractCegarLoop]: Abstraction has 6197 states and 34047 transitions. [2020-02-10 20:36:56,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 34047 transitions. [2020-02-10 20:36:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:56,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:56,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, 1, 1, 1] [2020-02-10 20:36:56,795 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1844398148, now seen corresponding path program 217 times [2020-02-10 20:36:56,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:56,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872047540] [2020-02-10 20:36:56,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:57,478 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:36:57,634 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:36:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:57,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872047540] [2020-02-10 20:36:57,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:57,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:57,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723476217] [2020-02-10 20:36:57,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:57,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:57,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:57,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:57,646 INFO L87 Difference]: Start difference. First operand 6197 states and 34047 transitions. Second operand 13 states. [2020-02-10 20:36:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:58,015 INFO L93 Difference]: Finished difference Result 11871 states and 58557 transitions. [2020-02-10 20:36:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:58,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:58,046 INFO L225 Difference]: With dead ends: 11871 [2020-02-10 20:36:58,046 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:36:58,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:36:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:36:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6218. [2020-02-10 20:36:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:36:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34121 transitions. [2020-02-10 20:36:58,662 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34121 transitions. Word has length 34 [2020-02-10 20:36:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:58,662 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34121 transitions. [2020-02-10 20:36:58,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:36:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34121 transitions. [2020-02-10 20:36:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:36:58,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:58,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:58,673 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:36:58,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:58,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2052860902, now seen corresponding path program 218 times [2020-02-10 20:36:58,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:58,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30746949] [2020-02-10 20:36:58,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:59,470 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:36:59,624 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:36:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:59,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30746949] [2020-02-10 20:36:59,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:59,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:36:59,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136342333] [2020-02-10 20:36:59,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:36:59,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:59,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:36:59,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:59,634 INFO L87 Difference]: Start difference. First operand 6218 states and 34121 transitions. Second operand 13 states. [2020-02-10 20:36:59,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:59,971 INFO L93 Difference]: Finished difference Result 11874 states and 58556 transitions. [2020-02-10 20:36:59,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:36:59,971 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:36:59,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:00,000 INFO L225 Difference]: With dead ends: 11874 [2020-02-10 20:37:00,001 INFO L226 Difference]: Without dead ends: 11845 [2020-02-10 20:37:00,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11845 states. [2020-02-10 20:37:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11845 to 6211. [2020-02-10 20:37:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:37:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34101 transitions. [2020-02-10 20:37:00,611 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34101 transitions. Word has length 34 [2020-02-10 20:37:00,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:00,611 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34101 transitions. [2020-02-10 20:37:00,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34101 transitions. [2020-02-10 20:37:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:00,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:00,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, 1, 1, 1] [2020-02-10 20:37:00,622 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:00,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:00,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2113144576, now seen corresponding path program 219 times [2020-02-10 20:37:00,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:00,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111331152] [2020-02-10 20:37:00,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:01,170 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:37:01,318 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:37:01,471 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:37:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:01,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111331152] [2020-02-10 20:37:01,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:01,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:01,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398716233] [2020-02-10 20:37:01,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:01,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:01,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:01,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:01,483 INFO L87 Difference]: Start difference. First operand 6211 states and 34101 transitions. Second operand 13 states. [2020-02-10 20:37:01,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:01,872 INFO L93 Difference]: Finished difference Result 11869 states and 58546 transitions. [2020-02-10 20:37:01,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:01,872 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:01,902 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 20:37:01,902 INFO L226 Difference]: Without dead ends: 11850 [2020-02-10 20:37:01,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2020-02-10 20:37:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 6218. [2020-02-10 20:37:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:37:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34114 transitions. [2020-02-10 20:37:02,520 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34114 transitions. Word has length 34 [2020-02-10 20:37:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:02,521 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34114 transitions. [2020-02-10 20:37:02,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34114 transitions. [2020-02-10 20:37:02,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:02,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:02,531 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:02,531 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash -812764646, now seen corresponding path program 220 times [2020-02-10 20:37:02,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:02,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361190279] [2020-02-10 20:37:02,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:03,076 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:37:03,223 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:37:03,373 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:37:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:03,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361190279] [2020-02-10 20:37:03,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:03,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:03,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036205846] [2020-02-10 20:37:03,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:03,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:03,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:03,385 INFO L87 Difference]: Start difference. First operand 6218 states and 34114 transitions. Second operand 13 states. [2020-02-10 20:37:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:03,840 INFO L93 Difference]: Finished difference Result 11870 states and 58541 transitions. [2020-02-10 20:37:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:03,841 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:03,871 INFO L225 Difference]: With dead ends: 11870 [2020-02-10 20:37:03,871 INFO L226 Difference]: Without dead ends: 11843 [2020-02-10 20:37:03,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:04,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2020-02-10 20:37:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 6211. [2020-02-10 20:37:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:37:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34094 transitions. [2020-02-10 20:37:04,481 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34094 transitions. Word has length 34 [2020-02-10 20:37:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:04,481 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34094 transitions. [2020-02-10 20:37:04,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34094 transitions. [2020-02-10 20:37:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:04,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:04,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, 1, 1, 1] [2020-02-10 20:37:04,492 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:04,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:04,492 INFO L82 PathProgramCache]: Analyzing trace with hash -395788736, now seen corresponding path program 221 times [2020-02-10 20:37:04,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:04,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261609784] [2020-02-10 20:37:04,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:05,031 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2020-02-10 20:37:05,292 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:37:05,442 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:37:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:05,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261609784] [2020-02-10 20:37:05,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:05,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:05,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086554134] [2020-02-10 20:37:05,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:05,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:05,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:05,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:05,453 INFO L87 Difference]: Start difference. First operand 6211 states and 34094 transitions. Second operand 13 states. [2020-02-10 20:37:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:05,950 INFO L93 Difference]: Finished difference Result 11876 states and 58554 transitions. [2020-02-10 20:37:05,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:05,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:05,979 INFO L225 Difference]: With dead ends: 11876 [2020-02-10 20:37:05,979 INFO L226 Difference]: Without dead ends: 11854 [2020-02-10 20:37:05,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2020-02-10 20:37:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 6219. [2020-02-10 20:37:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:37:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34109 transitions. [2020-02-10 20:37:06,591 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34109 transitions. Word has length 34 [2020-02-10 20:37:06,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:06,591 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34109 transitions. [2020-02-10 20:37:06,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:06,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34109 transitions. [2020-02-10 20:37:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:06,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:06,602 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:06,602 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:06,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:06,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1314824572, now seen corresponding path program 222 times [2020-02-10 20:37:06,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:06,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566751047] [2020-02-10 20:37:06,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:07,309 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:37:07,465 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:37:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:07,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566751047] [2020-02-10 20:37:07,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:07,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:07,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878515926] [2020-02-10 20:37:07,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:07,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:07,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:07,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:07,477 INFO L87 Difference]: Start difference. First operand 6219 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:37:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:07,815 INFO L93 Difference]: Finished difference Result 11874 states and 58542 transitions. [2020-02-10 20:37:07,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:07,816 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:07,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:07,846 INFO L225 Difference]: With dead ends: 11874 [2020-02-10 20:37:07,847 INFO L226 Difference]: Without dead ends: 11839 [2020-02-10 20:37:07,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11839 states. [2020-02-10 20:37:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11839 to 6204. [2020-02-10 20:37:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 20:37:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34074 transitions. [2020-02-10 20:37:08,455 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34074 transitions. Word has length 34 [2020-02-10 20:37:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:08,455 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34074 transitions. [2020-02-10 20:37:08,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34074 transitions. [2020-02-10 20:37:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:08,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:08,466 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:08,466 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash 691278486, now seen corresponding path program 223 times [2020-02-10 20:37:08,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:08,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157754727] [2020-02-10 20:37:08,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:09,160 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:37:09,307 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:37:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:09,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157754727] [2020-02-10 20:37:09,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:09,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:09,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600097092] [2020-02-10 20:37:09,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:09,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:09,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:09,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:09,319 INFO L87 Difference]: Start difference. First operand 6204 states and 34074 transitions. Second operand 13 states. [2020-02-10 20:37:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:09,614 INFO L93 Difference]: Finished difference Result 11873 states and 58555 transitions. [2020-02-10 20:37:09,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:09,614 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:09,644 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 20:37:09,644 INFO L226 Difference]: Without dead ends: 11854 [2020-02-10 20:37:09,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:10,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11854 states. [2020-02-10 20:37:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11854 to 6218. [2020-02-10 20:37:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:37:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34114 transitions. [2020-02-10 20:37:10,262 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34114 transitions. Word has length 34 [2020-02-10 20:37:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:10,262 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34114 transitions. [2020-02-10 20:37:10,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34114 transitions. [2020-02-10 20:37:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:10,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:10,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:10,273 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:10,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:10,273 INFO L82 PathProgramCache]: Analyzing trace with hash 482815732, now seen corresponding path program 224 times [2020-02-10 20:37:10,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:10,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794457987] [2020-02-10 20:37:10,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:11,083 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:37:11,227 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:37:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:11,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794457987] [2020-02-10 20:37:11,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:11,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:11,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937284404] [2020-02-10 20:37:11,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:11,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:11,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:11,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:11,238 INFO L87 Difference]: Start difference. First operand 6218 states and 34114 transitions. Second operand 13 states. [2020-02-10 20:37:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:11,579 INFO L93 Difference]: Finished difference Result 11876 states and 58554 transitions. [2020-02-10 20:37:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:11,579 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:11,608 INFO L225 Difference]: With dead ends: 11876 [2020-02-10 20:37:11,608 INFO L226 Difference]: Without dead ends: 11847 [2020-02-10 20:37:11,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:12,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11847 states. [2020-02-10 20:37:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11847 to 6211. [2020-02-10 20:37:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:37:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34094 transitions. [2020-02-10 20:37:12,219 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34094 transitions. Word has length 34 [2020-02-10 20:37:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:12,219 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34094 transitions. [2020-02-10 20:37:12,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34094 transitions. [2020-02-10 20:37:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:12,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:12,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, 1, 1, 1] [2020-02-10 20:37:12,230 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:12,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:12,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2128071232, now seen corresponding path program 225 times [2020-02-10 20:37:12,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:12,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271500099] [2020-02-10 20:37:12,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:12,914 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:37:13,061 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:37:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:13,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271500099] [2020-02-10 20:37:13,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:13,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:13,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208232823] [2020-02-10 20:37:13,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:13,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:13,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:13,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:13,073 INFO L87 Difference]: Start difference. First operand 6211 states and 34094 transitions. Second operand 13 states. [2020-02-10 20:37:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:13,360 INFO L93 Difference]: Finished difference Result 11872 states and 58546 transitions. [2020-02-10 20:37:13,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:13,360 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:13,389 INFO L225 Difference]: With dead ends: 11872 [2020-02-10 20:37:13,389 INFO L226 Difference]: Without dead ends: 11853 [2020-02-10 20:37:13,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2020-02-10 20:37:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 6218. [2020-02-10 20:37:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:37:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34107 transitions. [2020-02-10 20:37:14,006 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34107 transitions. Word has length 34 [2020-02-10 20:37:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:14,006 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34107 transitions. [2020-02-10 20:37:14,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34107 transitions. [2020-02-10 20:37:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:14,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:14,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:14,017 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:14,017 INFO L82 PathProgramCache]: Analyzing trace with hash -711910924, now seen corresponding path program 226 times [2020-02-10 20:37:14,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:14,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998513734] [2020-02-10 20:37:14,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:14,699 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:37:14,849 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:37:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:14,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998513734] [2020-02-10 20:37:14,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:14,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:14,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867145691] [2020-02-10 20:37:14,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:14,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:14,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:14,860 INFO L87 Difference]: Start difference. First operand 6218 states and 34107 transitions. Second operand 13 states. [2020-02-10 20:37:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:15,173 INFO L93 Difference]: Finished difference Result 11874 states and 58543 transitions. [2020-02-10 20:37:15,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:15,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:15,203 INFO L225 Difference]: With dead ends: 11874 [2020-02-10 20:37:15,203 INFO L226 Difference]: Without dead ends: 11846 [2020-02-10 20:37:15,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11846 states. [2020-02-10 20:37:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11846 to 6211. [2020-02-10 20:37:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:37:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34087 transitions. [2020-02-10 20:37:15,810 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34087 transitions. Word has length 34 [2020-02-10 20:37:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:15,811 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34087 transitions. [2020-02-10 20:37:15,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:15,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34087 transitions. [2020-02-10 20:37:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:15,822 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:15,822 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:15,822 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:15,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1434112320, now seen corresponding path program 227 times [2020-02-10 20:37:15,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:15,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630797964] [2020-02-10 20:37:15,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:16,368 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:37:16,512 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:37:16,661 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:37:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:16,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630797964] [2020-02-10 20:37:16,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:16,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:16,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545609974] [2020-02-10 20:37:16,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:16,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:16,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:16,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:16,671 INFO L87 Difference]: Start difference. First operand 6211 states and 34087 transitions. Second operand 13 states. [2020-02-10 20:37:17,078 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-02-10 20:37:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:17,103 INFO L93 Difference]: Finished difference Result 11880 states and 58557 transitions. [2020-02-10 20:37:17,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:17,103 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:17,135 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 20:37:17,135 INFO L226 Difference]: Without dead ends: 11858 [2020-02-10 20:37:17,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2020-02-10 20:37:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 6220. [2020-02-10 20:37:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:37:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34104 transitions. [2020-02-10 20:37:17,744 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34104 transitions. Word has length 34 [2020-02-10 20:37:17,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:17,744 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34104 transitions. [2020-02-10 20:37:17,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:17,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34104 transitions. [2020-02-10 20:37:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:17,756 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:17,756 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:17,756 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:17,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1415678294, now seen corresponding path program 228 times [2020-02-10 20:37:17,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:17,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921728038] [2020-02-10 20:37:17,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:18,317 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:37:18,459 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:37:18,608 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:37:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:18,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921728038] [2020-02-10 20:37:18,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:18,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:18,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262596478] [2020-02-10 20:37:18,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:18,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:18,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:18,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:18,620 INFO L87 Difference]: Start difference. First operand 6220 states and 34104 transitions. Second operand 13 states. [2020-02-10 20:37:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:18,983 INFO L93 Difference]: Finished difference Result 11879 states and 58546 transitions. [2020-02-10 20:37:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:18,984 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:19,013 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 20:37:19,014 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 20:37:19,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 20:37:19,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6204. [2020-02-10 20:37:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 20:37:19,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34067 transitions. [2020-02-10 20:37:19,620 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34067 transitions. Word has length 34 [2020-02-10 20:37:19,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:19,620 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34067 transitions. [2020-02-10 20:37:19,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:19,621 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34067 transitions. [2020-02-10 20:37:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:19,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:19,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:19,631 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash 681327382, now seen corresponding path program 229 times [2020-02-10 20:37:19,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:19,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171022265] [2020-02-10 20:37:19,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:20,197 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:37:20,341 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:37:20,493 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:37:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:20,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171022265] [2020-02-10 20:37:20,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:20,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:20,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822618748] [2020-02-10 20:37:20,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:20,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:20,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:20,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:20,505 INFO L87 Difference]: Start difference. First operand 6204 states and 34067 transitions. Second operand 13 states. [2020-02-10 20:37:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:20,860 INFO L93 Difference]: Finished difference Result 11868 states and 58537 transitions. [2020-02-10 20:37:20,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:20,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:20,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:20,890 INFO L225 Difference]: With dead ends: 11868 [2020-02-10 20:37:20,890 INFO L226 Difference]: Without dead ends: 11849 [2020-02-10 20:37:20,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2020-02-10 20:37:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 6218. [2020-02-10 20:37:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:37:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34107 transitions. [2020-02-10 20:37:21,504 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34107 transitions. Word has length 34 [2020-02-10 20:37:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:21,504 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34107 transitions. [2020-02-10 20:37:21,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:21,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34107 transitions. [2020-02-10 20:37:21,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:21,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:21,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, 1, 1, 1] [2020-02-10 20:37:21,515 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:21,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:21,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1981707312, now seen corresponding path program 230 times [2020-02-10 20:37:21,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:21,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194075953] [2020-02-10 20:37:21,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:22,070 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:37:22,213 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:37:22,367 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-02-10 20:37:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:22,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194075953] [2020-02-10 20:37:22,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:22,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:22,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410542912] [2020-02-10 20:37:22,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:22,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:22,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:22,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:22,379 INFO L87 Difference]: Start difference. First operand 6218 states and 34107 transitions. Second operand 13 states. [2020-02-10 20:37:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:22,743 INFO L93 Difference]: Finished difference Result 11869 states and 58532 transitions. [2020-02-10 20:37:22,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:22,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:22,773 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 20:37:22,773 INFO L226 Difference]: Without dead ends: 11842 [2020-02-10 20:37:22,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2020-02-10 20:37:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 6211. [2020-02-10 20:37:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:37:23,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34087 transitions. [2020-02-10 20:37:23,474 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34087 transitions. Word has length 34 [2020-02-10 20:37:23,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:23,475 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34087 transitions. [2020-02-10 20:37:23,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34087 transitions. [2020-02-10 20:37:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:23,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:23,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:23,486 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:23,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:23,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1869275908, now seen corresponding path program 231 times [2020-02-10 20:37:23,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:23,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233981093] [2020-02-10 20:37:23,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:24,177 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:37:24,326 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:37:24,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-02-10 20:37:24,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233981093] [2020-02-10 20:37:24,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:24,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:24,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943278244] [2020-02-10 20:37:24,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:24,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:24,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:24,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:24,338 INFO L87 Difference]: Start difference. First operand 6211 states and 34087 transitions. Second operand 13 states. [2020-02-10 20:37:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:24,786 INFO L93 Difference]: Finished difference Result 11869 states and 58532 transitions. [2020-02-10 20:37:24,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:24,786 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:24,817 INFO L225 Difference]: With dead ends: 11869 [2020-02-10 20:37:24,817 INFO L226 Difference]: Without dead ends: 11850 [2020-02-10 20:37:24,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2020-02-10 20:37:25,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 6218. [2020-02-10 20:37:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:37:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34100 transitions. [2020-02-10 20:37:25,428 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34100 transitions. Word has length 34 [2020-02-10 20:37:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:25,428 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34100 transitions. [2020-02-10 20:37:25,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34100 transitions. [2020-02-10 20:37:25,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:25,439 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:25,439 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:25,440 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:25,440 INFO L82 PathProgramCache]: Analyzing trace with hash -453115600, now seen corresponding path program 232 times [2020-02-10 20:37:25,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:25,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399254462] [2020-02-10 20:37:25,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:26,137 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:37:26,292 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:37:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:26,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399254462] [2020-02-10 20:37:26,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:26,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:26,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571712643] [2020-02-10 20:37:26,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:26,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:26,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:26,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:26,304 INFO L87 Difference]: Start difference. First operand 6218 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:37:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:26,750 INFO L93 Difference]: Finished difference Result 11871 states and 58529 transitions. [2020-02-10 20:37:26,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:26,751 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:26,779 INFO L225 Difference]: With dead ends: 11871 [2020-02-10 20:37:26,780 INFO L226 Difference]: Without dead ends: 11843 [2020-02-10 20:37:26,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11843 states. [2020-02-10 20:37:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11843 to 6211. [2020-02-10 20:37:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6211 states. [2020-02-10 20:37:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6211 states to 6211 states and 34080 transitions. [2020-02-10 20:37:27,388 INFO L78 Accepts]: Start accepts. Automaton has 6211 states and 34080 transitions. Word has length 34 [2020-02-10 20:37:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:27,388 INFO L479 AbstractCegarLoop]: Abstraction has 6211 states and 34080 transitions. [2020-02-10 20:37:27,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 6211 states and 34080 transitions. [2020-02-10 20:37:27,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:27,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:27,399 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:27,399 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:27,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:27,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1361963396, now seen corresponding path program 233 times [2020-02-10 20:37:27,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:27,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575534177] [2020-02-10 20:37:27,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:27,960 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:37:28,106 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:37:28,259 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-02-10 20:37:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:28,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575534177] [2020-02-10 20:37:28,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:28,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:28,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678069886] [2020-02-10 20:37:28,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:28,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:28,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:28,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:28,271 INFO L87 Difference]: Start difference. First operand 6211 states and 34080 transitions. Second operand 13 states. [2020-02-10 20:37:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:28,643 INFO L93 Difference]: Finished difference Result 11872 states and 58532 transitions. [2020-02-10 20:37:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:28,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:28,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:28,674 INFO L225 Difference]: With dead ends: 11872 [2020-02-10 20:37:28,674 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:37:28,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:37:29,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6219. [2020-02-10 20:37:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2020-02-10 20:37:29,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 34095 transitions. [2020-02-10 20:37:29,387 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 34095 transitions. Word has length 34 [2020-02-10 20:37:29,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:29,387 INFO L479 AbstractCegarLoop]: Abstraction has 6219 states and 34095 transitions. [2020-02-10 20:37:29,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:29,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 34095 transitions. [2020-02-10 20:37:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:29,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:29,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:29,398 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1203956566, now seen corresponding path program 234 times [2020-02-10 20:37:29,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:29,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477972366] [2020-02-10 20:37:29,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:29,958 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:37:30,106 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:37:30,256 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:37:30,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:30,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477972366] [2020-02-10 20:37:30,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:30,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:30,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542373952] [2020-02-10 20:37:30,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:30,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:30,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:30,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:30,267 INFO L87 Difference]: Start difference. First operand 6219 states and 34095 transitions. Second operand 13 states. [2020-02-10 20:37:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:30,566 INFO L93 Difference]: Finished difference Result 11873 states and 58526 transitions. [2020-02-10 20:37:30,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:30,566 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:30,596 INFO L225 Difference]: With dead ends: 11873 [2020-02-10 20:37:30,596 INFO L226 Difference]: Without dead ends: 11837 [2020-02-10 20:37:30,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2020-02-10 20:37:31,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 6204. [2020-02-10 20:37:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6204 states. [2020-02-10 20:37:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6204 states to 6204 states and 34060 transitions. [2020-02-10 20:37:31,206 INFO L78 Accepts]: Start accepts. Automaton has 6204 states and 34060 transitions. Word has length 34 [2020-02-10 20:37:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:31,206 INFO L479 AbstractCegarLoop]: Abstraction has 6204 states and 34060 transitions. [2020-02-10 20:37:31,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6204 states and 34060 transitions. [2020-02-10 20:37:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:31,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:31,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, 1, 1, 1] [2020-02-10 20:37:31,217 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:31,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:31,217 INFO L82 PathProgramCache]: Analyzing trace with hash -970365580, now seen corresponding path program 235 times [2020-02-10 20:37:31,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:31,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757987387] [2020-02-10 20:37:31,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:31,779 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-02-10 20:37:31,926 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:37:32,077 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:37:32,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-02-10 20:37:32,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757987387] [2020-02-10 20:37:32,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:32,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:32,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142064843] [2020-02-10 20:37:32,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:32,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:32,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:32,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:32,088 INFO L87 Difference]: Start difference. First operand 6204 states and 34060 transitions. Second operand 13 states. [2020-02-10 20:37:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:32,409 INFO L93 Difference]: Finished difference Result 11882 states and 58564 transitions. [2020-02-10 20:37:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:32,410 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:32,439 INFO L225 Difference]: With dead ends: 11882 [2020-02-10 20:37:32,439 INFO L226 Difference]: Without dead ends: 11860 [2020-02-10 20:37:32,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:32,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11860 states. [2020-02-10 20:37:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11860 to 6220. [2020-02-10 20:37:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:37:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34106 transitions. [2020-02-10 20:37:33,048 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34106 transitions. Word has length 34 [2020-02-10 20:37:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:33,048 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34106 transitions. [2020-02-10 20:37:33,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34106 transitions. [2020-02-10 20:37:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:33,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:33,059 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:33,059 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:33,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:33,060 INFO L82 PathProgramCache]: Analyzing trace with hash 740247728, now seen corresponding path program 236 times [2020-02-10 20:37:33,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:33,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260680526] [2020-02-10 20:37:33,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:33,759 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:37:33,914 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2020-02-10 20:37:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:33,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260680526] [2020-02-10 20:37:33,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:33,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:33,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939189745] [2020-02-10 20:37:33,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:33,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:33,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:33,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:33,925 INFO L87 Difference]: Start difference. First operand 6220 states and 34106 transitions. Second operand 13 states. [2020-02-10 20:37:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:34,320 INFO L93 Difference]: Finished difference Result 11880 states and 58552 transitions. [2020-02-10 20:37:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:34,321 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:34,350 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 20:37:34,351 INFO L226 Difference]: Without dead ends: 11852 [2020-02-10 20:37:34,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2020-02-10 20:37:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 6212. [2020-02-10 20:37:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:37:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34083 transitions. [2020-02-10 20:37:35,108 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34083 transitions. Word has length 34 [2020-02-10 20:37:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:35,108 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34083 transitions. [2020-02-10 20:37:35,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34083 transitions. [2020-02-10 20:37:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:35,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:35,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, 1, 1, 1] [2020-02-10 20:37:35,119 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:35,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:35,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1263741914, now seen corresponding path program 237 times [2020-02-10 20:37:35,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:35,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997073867] [2020-02-10 20:37:35,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:35,683 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:37:35,831 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:37:35,984 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2020-02-10 20:37:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:35,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997073867] [2020-02-10 20:37:35,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:35,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:35,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582148695] [2020-02-10 20:37:35,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:35,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:35,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:35,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:35,996 INFO L87 Difference]: Start difference. First operand 6212 states and 34083 transitions. Second operand 13 states. [2020-02-10 20:37:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:36,358 INFO L93 Difference]: Finished difference Result 11884 states and 58561 transitions. [2020-02-10 20:37:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:36,358 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:36,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:36,388 INFO L225 Difference]: With dead ends: 11884 [2020-02-10 20:37:36,389 INFO L226 Difference]: Without dead ends: 11862 [2020-02-10 20:37:36,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2020-02-10 20:37:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 6221. [2020-02-10 20:37:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:37:36,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34100 transitions. [2020-02-10 20:37:37,000 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34100 transitions. Word has length 34 [2020-02-10 20:37:37,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:37,000 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34100 transitions. [2020-02-10 20:37:37,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:37,000 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34100 transitions. [2020-02-10 20:37:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:37,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:37,011 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:37,011 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:37,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:37,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1245307888, now seen corresponding path program 238 times [2020-02-10 20:37:37,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:37,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690574284] [2020-02-10 20:37:37,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:37,576 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:37:37,722 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:37:37,871 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:37:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:37,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690574284] [2020-02-10 20:37:37,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:37,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:37,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780080226] [2020-02-10 20:37:37,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:37,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:37,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:37,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:37,882 INFO L87 Difference]: Start difference. First operand 6221 states and 34100 transitions. Second operand 13 states. [2020-02-10 20:37:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:38,226 INFO L93 Difference]: Finished difference Result 11883 states and 58550 transitions. [2020-02-10 20:37:38,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:38,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:38,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:38,260 INFO L225 Difference]: With dead ends: 11883 [2020-02-10 20:37:38,260 INFO L226 Difference]: Without dead ends: 11853 [2020-02-10 20:37:38,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2020-02-10 20:37:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 6212. [2020-02-10 20:37:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6212 states. [2020-02-10 20:37:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6212 states to 6212 states and 34075 transitions. [2020-02-10 20:37:38,865 INFO L78 Accepts]: Start accepts. Automaton has 6212 states and 34075 transitions. Word has length 34 [2020-02-10 20:37:38,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:38,865 INFO L479 AbstractCegarLoop]: Abstraction has 6212 states and 34075 transitions. [2020-02-10 20:37:38,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6212 states and 34075 transitions. [2020-02-10 20:37:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:38,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:38,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:38,876 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:38,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash 168792922, now seen corresponding path program 239 times [2020-02-10 20:37:38,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:38,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038818374] [2020-02-10 20:37:38,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:39,438 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:37:39,588 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:37:39,737 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-02-10 20:37:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:39,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038818374] [2020-02-10 20:37:39,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:39,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:39,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47554017] [2020-02-10 20:37:39,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:39,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:39,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:39,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:39,749 INFO L87 Difference]: Start difference. First operand 6212 states and 34075 transitions. Second operand 13 states. [2020-02-10 20:37:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:40,070 INFO L93 Difference]: Finished difference Result 11879 states and 58542 transitions. [2020-02-10 20:37:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:40,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:40,099 INFO L225 Difference]: With dead ends: 11879 [2020-02-10 20:37:40,099 INFO L226 Difference]: Without dead ends: 11859 [2020-02-10 20:37:40,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11859 states. [2020-02-10 20:37:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11859 to 6220. [2020-02-10 20:37:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6220 states. [2020-02-10 20:37:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 34090 transitions. [2020-02-10 20:37:40,711 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 34090 transitions. Word has length 34 [2020-02-10 20:37:40,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:40,711 INFO L479 AbstractCegarLoop]: Abstraction has 6220 states and 34090 transitions. [2020-02-10 20:37:40,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:40,711 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 34090 transitions. [2020-02-10 20:37:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:40,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:40,722 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:40,722 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:40,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:40,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1560254412, now seen corresponding path program 240 times [2020-02-10 20:37:40,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:40,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128975728] [2020-02-10 20:37:40,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:41,267 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:37:41,396 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:37:41,542 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2020-02-10 20:37:41,693 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2020-02-10 20:37:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:41,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128975728] [2020-02-10 20:37:41,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:41,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:41,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163736184] [2020-02-10 20:37:41,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:41,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:41,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:41,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:41,704 INFO L87 Difference]: Start difference. First operand 6220 states and 34090 transitions. Second operand 13 states. [2020-02-10 20:37:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:42,056 INFO L93 Difference]: Finished difference Result 11880 states and 58536 transitions. [2020-02-10 20:37:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:42,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:42,086 INFO L225 Difference]: With dead ends: 11880 [2020-02-10 20:37:42,086 INFO L226 Difference]: Without dead ends: 11824 [2020-02-10 20:37:42,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11824 states. [2020-02-10 20:37:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11824 to 6185. [2020-02-10 20:37:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2020-02-10 20:37:42,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 34018 transitions. [2020-02-10 20:37:42,695 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 34018 transitions. Word has length 34 [2020-02-10 20:37:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:42,695 INFO L479 AbstractCegarLoop]: Abstraction has 6185 states and 34018 transitions. [2020-02-10 20:37:42,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 34018 transitions. [2020-02-10 20:37:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:42,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:42,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:42,706 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:42,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1153765992, now seen corresponding path program 241 times [2020-02-10 20:37:42,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:42,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119656888] [2020-02-10 20:37:42,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:43,256 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:37:43,406 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:37:43,560 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:37:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:43,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119656888] [2020-02-10 20:37:43,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:43,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:43,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655418400] [2020-02-10 20:37:43,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:43,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:43,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:43,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:43,571 INFO L87 Difference]: Start difference. First operand 6185 states and 34018 transitions. Second operand 13 states. [2020-02-10 20:37:43,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:43,891 INFO L93 Difference]: Finished difference Result 11865 states and 58516 transitions. [2020-02-10 20:37:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:43,892 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:43,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:43,921 INFO L225 Difference]: With dead ends: 11865 [2020-02-10 20:37:43,921 INFO L226 Difference]: Without dead ends: 11841 [2020-02-10 20:37:43,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:44,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2020-02-10 20:37:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 6222. [2020-02-10 20:37:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2020-02-10 20:37:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 34151 transitions. [2020-02-10 20:37:44,530 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 34151 transitions. Word has length 34 [2020-02-10 20:37:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:44,530 INFO L479 AbstractCegarLoop]: Abstraction has 6222 states and 34151 transitions. [2020-02-10 20:37:44,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 34151 transitions. [2020-02-10 20:37:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:44,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:44,541 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:44,541 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:44,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:44,542 INFO L82 PathProgramCache]: Analyzing trace with hash 517299138, now seen corresponding path program 242 times [2020-02-10 20:37:44,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:44,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771878727] [2020-02-10 20:37:44,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:45,096 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:37:45,246 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:37:45,398 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:37:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:45,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771878727] [2020-02-10 20:37:45,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:45,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:45,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391194918] [2020-02-10 20:37:45,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:45,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:45,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:45,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:45,411 INFO L87 Difference]: Start difference. First operand 6222 states and 34151 transitions. Second operand 13 states. [2020-02-10 20:37:45,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:45,910 INFO L93 Difference]: Finished difference Result 11863 states and 58502 transitions. [2020-02-10 20:37:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:45,911 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:45,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:45,941 INFO L225 Difference]: With dead ends: 11863 [2020-02-10 20:37:45,941 INFO L226 Difference]: Without dead ends: 11829 [2020-02-10 20:37:45,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11829 states. [2020-02-10 20:37:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11829 to 6210. [2020-02-10 20:37:46,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 20:37:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34121 transitions. [2020-02-10 20:37:46,551 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34121 transitions. Word has length 34 [2020-02-10 20:37:46,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:46,552 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34121 transitions. [2020-02-10 20:37:46,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34121 transitions. [2020-02-10 20:37:46,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:46,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:46,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, 1, 1, 1] [2020-02-10 20:37:46,563 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:46,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:46,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1377946600, now seen corresponding path program 243 times [2020-02-10 20:37:46,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:46,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127491188] [2020-02-10 20:37:46,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:47,102 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:37:47,245 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:37:47,398 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:37:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:47,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127491188] [2020-02-10 20:37:47,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:47,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:47,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45522925] [2020-02-10 20:37:47,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:47,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:47,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:47,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:47,410 INFO L87 Difference]: Start difference. First operand 6210 states and 34121 transitions. Second operand 13 states. [2020-02-10 20:37:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:47,868 INFO L93 Difference]: Finished difference Result 11853 states and 58482 transitions. [2020-02-10 20:37:47,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:47,868 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:47,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:47,897 INFO L225 Difference]: With dead ends: 11853 [2020-02-10 20:37:47,897 INFO L226 Difference]: Without dead ends: 11834 [2020-02-10 20:37:47,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11834 states. [2020-02-10 20:37:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11834 to 6218. [2020-02-10 20:37:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6218 states. [2020-02-10 20:37:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 34136 transitions. [2020-02-10 20:37:48,513 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 34136 transitions. Word has length 34 [2020-02-10 20:37:48,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:48,514 INFO L479 AbstractCegarLoop]: Abstraction has 6218 states and 34136 transitions. [2020-02-10 20:37:48,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 34136 transitions. [2020-02-10 20:37:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:48,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:48,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, 1, 1, 1] [2020-02-10 20:37:48,525 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:48,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1932084412, now seen corresponding path program 244 times [2020-02-10 20:37:48,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:48,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575936819] [2020-02-10 20:37:48,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:49,062 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:37:49,214 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:37:49,368 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:37:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:49,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575936819] [2020-02-10 20:37:49,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:49,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:49,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111590497] [2020-02-10 20:37:49,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:49,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:49,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:49,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:49,380 INFO L87 Difference]: Start difference. First operand 6218 states and 34136 transitions. Second operand 13 states. [2020-02-10 20:37:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:49,742 INFO L93 Difference]: Finished difference Result 11858 states and 58484 transitions. [2020-02-10 20:37:49,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:49,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:49,772 INFO L225 Difference]: With dead ends: 11858 [2020-02-10 20:37:49,772 INFO L226 Difference]: Without dead ends: 11826 [2020-02-10 20:37:49,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11826 states. [2020-02-10 20:37:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11826 to 6210. [2020-02-10 20:37:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2020-02-10 20:37:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 34113 transitions. [2020-02-10 20:37:50,382 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 34113 transitions. Word has length 34 [2020-02-10 20:37:50,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:50,383 INFO L479 AbstractCegarLoop]: Abstraction has 6210 states and 34113 transitions. [2020-02-10 20:37:50,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 34113 transitions. [2020-02-10 20:37:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:50,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:50,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, 1, 1, 1] [2020-02-10 20:37:50,394 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:50,394 INFO L82 PathProgramCache]: Analyzing trace with hash 366417406, now seen corresponding path program 245 times [2020-02-10 20:37:50,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:50,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888059746] [2020-02-10 20:37:50,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:51,076 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:37:51,229 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:37:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:51,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888059746] [2020-02-10 20:37:51,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:51,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:51,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155481118] [2020-02-10 20:37:51,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:51,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:51,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:51,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:51,241 INFO L87 Difference]: Start difference. First operand 6210 states and 34113 transitions. Second operand 13 states. [2020-02-10 20:37:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:51,533 INFO L93 Difference]: Finished difference Result 11850 states and 58469 transitions. [2020-02-10 20:37:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:51,534 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:51,564 INFO L225 Difference]: With dead ends: 11850 [2020-02-10 20:37:51,564 INFO L226 Difference]: Without dead ends: 11831 [2020-02-10 20:37:51,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11831 states. [2020-02-10 20:37:52,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11831 to 6217. [2020-02-10 20:37:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2020-02-10 20:37:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 34126 transitions. [2020-02-10 20:37:52,174 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 34126 transitions. Word has length 34 [2020-02-10 20:37:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:52,174 INFO L479 AbstractCegarLoop]: Abstraction has 6217 states and 34126 transitions. [2020-02-10 20:37:52,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:52,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 34126 transitions. [2020-02-10 20:37:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:52,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:52,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:52,187 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:52,187 INFO L82 PathProgramCache]: Analyzing trace with hash 157954652, now seen corresponding path program 246 times [2020-02-10 20:37:52,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:52,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796859740] [2020-02-10 20:37:52,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:52,869 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:37:53,016 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:37:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:53,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796859740] [2020-02-10 20:37:53,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:53,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:53,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436297075] [2020-02-10 20:37:53,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:53,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:53,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:53,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:53,034 INFO L87 Difference]: Start difference. First operand 6217 states and 34126 transitions. Second operand 13 states. [2020-02-10 20:37:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:53,335 INFO L93 Difference]: Finished difference Result 11853 states and 58468 transitions. [2020-02-10 20:37:53,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:53,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:53,367 INFO L225 Difference]: With dead ends: 11853 [2020-02-10 20:37:53,368 INFO L226 Difference]: Without dead ends: 11815 [2020-02-10 20:37:53,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2020-02-10 20:37:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 6201. [2020-02-10 20:37:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 20:37:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34090 transitions. [2020-02-10 20:37:54,068 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34090 transitions. Word has length 34 [2020-02-10 20:37:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:54,069 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34090 transitions. [2020-02-10 20:37:54,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34090 transitions. [2020-02-10 20:37:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:54,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:54,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, 1, 1, 1] [2020-02-10 20:37:54,079 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:54,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:54,080 INFO L82 PathProgramCache]: Analyzing trace with hash 747969188, now seen corresponding path program 247 times [2020-02-10 20:37:54,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:54,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496627097] [2020-02-10 20:37:54,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:54,629 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:37:54,780 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:37:54,931 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:37:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:54,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496627097] [2020-02-10 20:37:54,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:54,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:54,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26462498] [2020-02-10 20:37:54,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:54,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:54,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:54,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:54,944 INFO L87 Difference]: Start difference. First operand 6201 states and 34090 transitions. Second operand 13 states. [2020-02-10 20:37:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:55,225 INFO L93 Difference]: Finished difference Result 11861 states and 58496 transitions. [2020-02-10 20:37:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:55,225 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:55,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:55,255 INFO L225 Difference]: With dead ends: 11861 [2020-02-10 20:37:55,255 INFO L226 Difference]: Without dead ends: 11837 [2020-02-10 20:37:55,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2020-02-10 20:37:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 6221. [2020-02-10 20:37:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2020-02-10 20:37:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 34139 transitions. [2020-02-10 20:37:55,865 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 34139 transitions. Word has length 34 [2020-02-10 20:37:55,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:55,865 INFO L479 AbstractCegarLoop]: Abstraction has 6221 states and 34139 transitions. [2020-02-10 20:37:55,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 34139 transitions. [2020-02-10 20:37:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:55,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:55,876 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:55,877 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:55,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:55,877 INFO L82 PathProgramCache]: Analyzing trace with hash 111502334, now seen corresponding path program 248 times [2020-02-10 20:37:55,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:55,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611951518] [2020-02-10 20:37:55,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:56,425 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:37:56,571 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:37:56,721 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:37:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:56,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611951518] [2020-02-10 20:37:56,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:56,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:56,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509309231] [2020-02-10 20:37:56,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:56,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:56,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:56,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:56,734 INFO L87 Difference]: Start difference. First operand 6221 states and 34139 transitions. Second operand 13 states. [2020-02-10 20:37:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:57,091 INFO L93 Difference]: Finished difference Result 11859 states and 58482 transitions. [2020-02-10 20:37:57,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:57,092 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:57,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:57,121 INFO L225 Difference]: With dead ends: 11859 [2020-02-10 20:37:57,121 INFO L226 Difference]: Without dead ends: 11825 [2020-02-10 20:37:57,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11825 states. [2020-02-10 20:37:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11825 to 6209. [2020-02-10 20:37:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:37:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34110 transitions. [2020-02-10 20:37:57,731 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34110 transitions. Word has length 34 [2020-02-10 20:37:57,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:57,731 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34110 transitions. [2020-02-10 20:37:57,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:57,731 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34110 transitions. [2020-02-10 20:37:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:57,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:57,742 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:57,742 INFO L427 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.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:57,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1548812252, now seen corresponding path program 249 times [2020-02-10 20:37:57,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:57,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918985120] [2020-02-10 20:37:57,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:58,275 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:37:58,431 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:37:58,583 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:37:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:58,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918985120] [2020-02-10 20:37:58,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:58,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:37:58,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826498096] [2020-02-10 20:37:58,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:37:58,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:58,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:37:58,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:58,595 INFO L87 Difference]: Start difference. First operand 6209 states and 34110 transitions. Second operand 13 states. [2020-02-10 20:37:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:58,864 INFO L93 Difference]: Finished difference Result 11852 states and 58467 transitions. [2020-02-10 20:37:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:37:58,864 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:37:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:58,894 INFO L225 Difference]: With dead ends: 11852 [2020-02-10 20:37:58,894 INFO L226 Difference]: Without dead ends: 11828 [2020-02-10 20:37:58,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:37:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2020-02-10 20:37:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 6216. [2020-02-10 20:37:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:37:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34122 transitions. [2020-02-10 20:37:59,611 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34122 transitions. Word has length 34 [2020-02-10 20:37:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:59,611 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34122 transitions. [2020-02-10 20:37:59,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:37:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34122 transitions. [2020-02-10 20:37:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:37:59,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:59,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, 1, 1, 1] [2020-02-10 20:37:59,622 INFO L427 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.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:37:59,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1336656634, now seen corresponding path program 250 times [2020-02-10 20:37:59,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:59,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586326708] [2020-02-10 20:37:59,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:00,158 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:38:00,306 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:38:00,457 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:38:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:00,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586326708] [2020-02-10 20:38:00,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:00,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:38:00,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92819595] [2020-02-10 20:38:00,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:38:00,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:00,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:38:00,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:00,470 INFO L87 Difference]: Start difference. First operand 6216 states and 34122 transitions. Second operand 13 states. [2020-02-10 20:38:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:00,852 INFO L93 Difference]: Finished difference Result 11846 states and 58449 transitions. [2020-02-10 20:38:00,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:38:00,853 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:38:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:00,882 INFO L225 Difference]: With dead ends: 11846 [2020-02-10 20:38:00,883 INFO L226 Difference]: Without dead ends: 11821 [2020-02-10 20:38:00,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:38:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11821 states. [2020-02-10 20:38:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11821 to 6209. [2020-02-10 20:38:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6209 states. [2020-02-10 20:38:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6209 states to 6209 states and 34103 transitions. [2020-02-10 20:38:01,496 INFO L78 Accepts]: Start accepts. Automaton has 6209 states and 34103 transitions. Word has length 34 [2020-02-10 20:38:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:01,496 INFO L479 AbstractCegarLoop]: Abstraction has 6209 states and 34103 transitions. [2020-02-10 20:38:01,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:38:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 6209 states and 34103 transitions. [2020-02-10 20:38:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:38:01,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:01,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, 1, 1, 1] [2020-02-10 20:38:01,507 INFO L427 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.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:01,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1213946656, now seen corresponding path program 251 times [2020-02-10 20:38:01,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:01,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075206351] [2020-02-10 20:38:01,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:02,163 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:38:02,314 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:38:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:02,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075206351] [2020-02-10 20:38:02,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:02,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:38:02,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094951304] [2020-02-10 20:38:02,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:38:02,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:02,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:38:02,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:02,326 INFO L87 Difference]: Start difference. First operand 6209 states and 34103 transitions. Second operand 13 states. [2020-02-10 20:38:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:02,627 INFO L93 Difference]: Finished difference Result 11843 states and 58444 transitions. [2020-02-10 20:38:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:38:02,627 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:38:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:02,656 INFO L225 Difference]: With dead ends: 11843 [2020-02-10 20:38:02,656 INFO L226 Difference]: Without dead ends: 11825 [2020-02-10 20:38:02,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:38:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11825 states. [2020-02-10 20:38:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11825 to 6215. [2020-02-10 20:38:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:38:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34114 transitions. [2020-02-10 20:38:03,261 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34114 transitions. Word has length 34 [2020-02-10 20:38:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:03,261 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34114 transitions. [2020-02-10 20:38:03,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:38:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34114 transitions. [2020-02-10 20:38:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:38:03,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:03,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:03,272 INFO L427 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.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1638257892, now seen corresponding path program 252 times [2020-02-10 20:38:03,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:03,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469108562] [2020-02-10 20:38:03,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:03,938 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:38:04,089 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:38:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:04,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469108562] [2020-02-10 20:38:04,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:04,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:38:04,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228645880] [2020-02-10 20:38:04,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:38:04,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:04,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:38:04,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:04,102 INFO L87 Difference]: Start difference. First operand 6215 states and 34114 transitions. Second operand 13 states. [2020-02-10 20:38:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:04,402 INFO L93 Difference]: Finished difference Result 11847 states and 58446 transitions. [2020-02-10 20:38:04,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:38:04,403 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:38:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:04,432 INFO L225 Difference]: With dead ends: 11847 [2020-02-10 20:38:04,433 INFO L226 Difference]: Without dead ends: 11811 [2020-02-10 20:38:04,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:38:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11811 states. [2020-02-10 20:38:05,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11811 to 6201. [2020-02-10 20:38:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 20:38:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34082 transitions. [2020-02-10 20:38:05,043 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34082 transitions. Word has length 34 [2020-02-10 20:38:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:05,043 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34082 transitions. [2020-02-10 20:38:05,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:38:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34082 transitions. [2020-02-10 20:38:05,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:38:05,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:05,055 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:05,055 INFO L427 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.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:05,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:05,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1973351904, now seen corresponding path program 253 times [2020-02-10 20:38:05,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:05,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447985480] [2020-02-10 20:38:05,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:05,581 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 29 [2020-02-10 20:38:05,708 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:38:05,854 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:38:06,007 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:38:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:06,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447985480] [2020-02-10 20:38:06,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:06,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:38:06,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572829837] [2020-02-10 20:38:06,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:38:06,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:06,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:38:06,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:06,020 INFO L87 Difference]: Start difference. First operand 6201 states and 34082 transitions. Second operand 13 states. [2020-02-10 20:38:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:06,451 INFO L93 Difference]: Finished difference Result 11841 states and 58445 transitions. [2020-02-10 20:38:06,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:38:06,451 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:38:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:06,480 INFO L225 Difference]: With dead ends: 11841 [2020-02-10 20:38:06,480 INFO L226 Difference]: Without dead ends: 11822 [2020-02-10 20:38:06,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:38:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2020-02-10 20:38:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 6216. [2020-02-10 20:38:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6216 states. [2020-02-10 20:38:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6216 states to 6216 states and 34123 transitions. [2020-02-10 20:38:07,091 INFO L78 Accepts]: Start accepts. Automaton has 6216 states and 34123 transitions. Word has length 34 [2020-02-10 20:38:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:07,091 INFO L479 AbstractCegarLoop]: Abstraction has 6216 states and 34123 transitions. [2020-02-10 20:38:07,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:38:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6216 states and 34123 transitions. [2020-02-10 20:38:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:38:07,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:07,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:07,102 INFO L427 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.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:07,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:07,103 INFO L82 PathProgramCache]: Analyzing trace with hash 988415620, now seen corresponding path program 254 times [2020-02-10 20:38:07,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:07,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927630192] [2020-02-10 20:38:07,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:07,655 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:38:07,802 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:38:07,955 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:38:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:07,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927630192] [2020-02-10 20:38:07,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:07,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:38:07,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105560012] [2020-02-10 20:38:07,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:38:07,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:07,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:38:07,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:07,966 INFO L87 Difference]: Start difference. First operand 6216 states and 34123 transitions. Second operand 13 states. [2020-02-10 20:38:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:08,344 INFO L93 Difference]: Finished difference Result 11846 states and 58447 transitions. [2020-02-10 20:38:08,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:38:08,345 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:38:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:08,374 INFO L225 Difference]: With dead ends: 11846 [2020-02-10 20:38:08,374 INFO L226 Difference]: Without dead ends: 11814 [2020-02-10 20:38:08,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:38:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11814 states. [2020-02-10 20:38:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11814 to 6208. [2020-02-10 20:38:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:38:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34101 transitions. [2020-02-10 20:38:08,990 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34101 transitions. Word has length 34 [2020-02-10 20:38:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:08,990 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34101 transitions. [2020-02-10 20:38:08,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:38:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34101 transitions. [2020-02-10 20:38:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:38:09,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:09,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:09,000 INFO L427 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.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:09,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:09,000 INFO L82 PathProgramCache]: Analyzing trace with hash -308504958, now seen corresponding path program 255 times [2020-02-10 20:38:09,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:09,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122680666] [2020-02-10 20:38:09,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:09,542 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:38:09,683 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 36 [2020-02-10 20:38:09,831 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:38:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:09,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122680666] [2020-02-10 20:38:09,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:09,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:38:09,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069424042] [2020-02-10 20:38:09,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:38:09,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:09,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:38:09,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:09,844 INFO L87 Difference]: Start difference. First operand 6208 states and 34101 transitions. Second operand 13 states. [2020-02-10 20:38:10,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:10,177 INFO L93 Difference]: Finished difference Result 11833 states and 58422 transitions. [2020-02-10 20:38:10,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:38:10,178 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:38:10,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:10,206 INFO L225 Difference]: With dead ends: 11833 [2020-02-10 20:38:10,206 INFO L226 Difference]: Without dead ends: 11814 [2020-02-10 20:38:10,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:38:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11814 states. [2020-02-10 20:38:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11814 to 6214. [2020-02-10 20:38:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2020-02-10 20:38:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 34112 transitions. [2020-02-10 20:38:10,816 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 34112 transitions. Word has length 34 [2020-02-10 20:38:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:10,816 INFO L479 AbstractCegarLoop]: Abstraction has 6214 states and 34112 transitions. [2020-02-10 20:38:10,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:38:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 34112 transitions. [2020-02-10 20:38:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:38:10,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:10,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:10,827 INFO L427 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.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash 300145704, now seen corresponding path program 256 times [2020-02-10 20:38:10,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:10,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589503] [2020-02-10 20:38:10,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:11,382 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:38:11,527 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:38:11,679 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:38:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:11,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589503] [2020-02-10 20:38:11,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:11,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:38:11,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068167052] [2020-02-10 20:38:11,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:38:11,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:11,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:38:11,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:11,691 INFO L87 Difference]: Start difference. First operand 6214 states and 34112 transitions. Second operand 13 states. [2020-02-10 20:38:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:12,076 INFO L93 Difference]: Finished difference Result 11832 states and 58414 transitions. [2020-02-10 20:38:12,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:38:12,076 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:38:12,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:12,106 INFO L225 Difference]: With dead ends: 11832 [2020-02-10 20:38:12,107 INFO L226 Difference]: Without dead ends: 11808 [2020-02-10 20:38:12,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:38:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11808 states. [2020-02-10 20:38:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11808 to 6208. [2020-02-10 20:38:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6208 states. [2020-02-10 20:38:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6208 states to 6208 states and 34095 transitions. [2020-02-10 20:38:12,713 INFO L78 Accepts]: Start accepts. Automaton has 6208 states and 34095 transitions. Word has length 34 [2020-02-10 20:38:12,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:12,713 INFO L479 AbstractCegarLoop]: Abstraction has 6208 states and 34095 transitions. [2020-02-10 20:38:12,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:38:12,714 INFO L276 IsEmpty]: Start isEmpty. Operand 6208 states and 34095 transitions. [2020-02-10 20:38:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:38:12,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:12,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:12,724 INFO L427 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.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:12,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:12,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1618250338, now seen corresponding path program 257 times [2020-02-10 20:38:12,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:12,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250832135] [2020-02-10 20:38:12,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:13,275 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:38:13,425 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 37 [2020-02-10 20:38:13,576 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:38:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:13,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250832135] [2020-02-10 20:38:13,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:13,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:38:13,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860578727] [2020-02-10 20:38:13,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:38:13,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:13,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:38:13,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:13,587 INFO L87 Difference]: Start difference. First operand 6208 states and 34095 transitions. Second operand 13 states. [2020-02-10 20:38:13,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:13,884 INFO L93 Difference]: Finished difference Result 11844 states and 58436 transitions. [2020-02-10 20:38:13,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:38:13,884 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:38:13,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:13,913 INFO L225 Difference]: With dead ends: 11844 [2020-02-10 20:38:13,913 INFO L226 Difference]: Without dead ends: 11820 [2020-02-10 20:38:13,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:38:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11820 states. [2020-02-10 20:38:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11820 to 6215. [2020-02-10 20:38:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6215 states. [2020-02-10 20:38:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 34107 transitions. [2020-02-10 20:38:14,525 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 34107 transitions. Word has length 34 [2020-02-10 20:38:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:14,525 INFO L479 AbstractCegarLoop]: Abstraction has 6215 states and 34107 transitions. [2020-02-10 20:38:14,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:38:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 34107 transitions. [2020-02-10 20:38:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:38:14,536 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:14,536 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:14,536 INFO L427 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.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:14,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:14,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1344671732, now seen corresponding path program 258 times [2020-02-10 20:38:14,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:14,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640008564] [2020-02-10 20:38:14,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:15,089 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 20:38:15,236 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-02-10 20:38:15,387 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2020-02-10 20:38:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:15,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640008564] [2020-02-10 20:38:15,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:15,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:38:15,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160558294] [2020-02-10 20:38:15,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:38:15,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:15,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:38:15,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:15,398 INFO L87 Difference]: Start difference. First operand 6215 states and 34107 transitions. Second operand 13 states. [2020-02-10 20:38:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:15,782 INFO L93 Difference]: Finished difference Result 11838 states and 58418 transitions. [2020-02-10 20:38:15,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:38:15,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:38:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:15,811 INFO L225 Difference]: With dead ends: 11838 [2020-02-10 20:38:15,811 INFO L226 Difference]: Without dead ends: 11806 [2020-02-10 20:38:15,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:38:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11806 states. [2020-02-10 20:38:16,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11806 to 6201. [2020-02-10 20:38:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2020-02-10 20:38:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 34075 transitions. [2020-02-10 20:38:16,423 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 34075 transitions. Word has length 34 [2020-02-10 20:38:16,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:16,423 INFO L479 AbstractCegarLoop]: Abstraction has 6201 states and 34075 transitions. [2020-02-10 20:38:16,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:38:16,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 34075 transitions. [2020-02-10 20:38:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:38:16,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:16,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, 1, 1, 1] [2020-02-10 20:38:16,435 INFO L427 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.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:16,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2067795620, now seen corresponding path program 259 times [2020-02-10 20:38:16,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:16,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985245036] [2020-02-10 20:38:16,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:16,995 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:38:17,140 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-02-10 20:38:17,292 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:38:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:17,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985245036] [2020-02-10 20:38:17,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:17,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:38:17,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341191459] [2020-02-10 20:38:17,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:38:17,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:17,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:38:17,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:17,305 INFO L87 Difference]: Start difference. First operand 6201 states and 34075 transitions. Second operand 13 states. [2020-02-10 20:38:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:17,734 INFO L93 Difference]: Finished difference Result 11828 states and 58412 transitions. [2020-02-10 20:38:17,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:38:17,735 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:38:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:17,765 INFO L225 Difference]: With dead ends: 11828 [2020-02-10 20:38:17,765 INFO L226 Difference]: Without dead ends: 11809 [2020-02-10 20:38:17,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2020-02-10 20:38:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11809 states. [2020-02-10 20:38:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11809 to 6213. [2020-02-10 20:38:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6213 states. [2020-02-10 20:38:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 34109 transitions. [2020-02-10 20:38:18,473 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 34109 transitions. Word has length 34 [2020-02-10 20:38:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:18,474 INFO L479 AbstractCegarLoop]: Abstraction has 6213 states and 34109 transitions. [2020-02-10 20:38:18,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-02-10 20:38:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 34109 transitions. [2020-02-10 20:38:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-02-10 20:38:18,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:18,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:18,485 INFO L427 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.startErr10INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1459144958, now seen corresponding path program 260 times [2020-02-10 20:38:18,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:18,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344623329] [2020-02-10 20:38:18,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:19,017 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:38:19,157 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2020-02-10 20:38:19,308 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 38 [2020-02-10 20:38:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:19,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344623329] [2020-02-10 20:38:19,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:19,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-02-10 20:38:19,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400797628] [2020-02-10 20:38:19,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-02-10 20:38:19,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:19,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-02-10 20:38:19,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:19,321 INFO L87 Difference]: Start difference. First operand 6213 states and 34109 transitions. Second operand 13 states. [2020-02-10 20:38:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:19,652 INFO L93 Difference]: Finished difference Result 11827 states and 58404 transitions. [2020-02-10 20:38:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-02-10 20:38:19,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2020-02-10 20:38:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:19,684 INFO L225 Difference]: With dead ends: 11827 [2020-02-10 20:38:19,684 INFO L226 Difference]: Without dead ends: 11803 [2020-02-10 20:38:19,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 Received shutdown request... [2020-02-10 20:38:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11803 states. [2020-02-10 20:38:20,176 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 20:38:20,179 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 20:38:20,179 INFO L202 PluginConnector]: Adding new model example_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:38:20 BasicIcfg [2020-02-10 20:38:20,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:38:20,180 INFO L168 Benchmark]: Toolchain (without parser) took 741349.77 ms. Allocated memory was 144.7 MB in the beginning and 4.4 GB in the end (delta: 4.3 GB). Free memory was 119.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2020-02-10 20:38:20,180 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.45 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:38:20,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.69 ms. Allocated memory is still 144.7 MB. Free memory was 119.6 MB in the beginning and 117.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-02-10 20:38:20,180 INFO L168 Benchmark]: Boogie Preprocessor took 21.52 ms. Allocated memory is still 144.7 MB. Free memory was 117.8 MB in the beginning and 116.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-02-10 20:38:20,181 INFO L168 Benchmark]: RCFGBuilder took 380.83 ms. Allocated memory is still 144.7 MB. Free memory was 116.5 MB in the beginning and 101.2 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-02-10 20:38:20,181 INFO L168 Benchmark]: TraceAbstraction took 740906.41 ms. Allocated memory was 144.7 MB in the beginning and 4.4 GB in the end (delta: 4.3 GB). Free memory was 100.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2020-02-10 20:38:20,181 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.45 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.69 ms. Allocated memory is still 144.7 MB. Free memory was 119.6 MB in the beginning and 117.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.52 ms. Allocated memory is still 144.7 MB. Free memory was 117.8 MB in the beginning and 116.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 380.83 ms. Allocated memory is still 144.7 MB. Free memory was 116.5 MB in the beginning and 101.2 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 740906.41 ms. Allocated memory was 144.7 MB in the beginning and 4.4 GB in the end (delta: 4.3 GB). Free memory was 100.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 21.6s, 92 ProgramPointsBefore, 80 ProgramPointsAfterwards, 168 TransitionsBefore, 156 TransitionsAfterwards, 5060 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1320 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1375 CheckedPairsTotal, 12 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 740.5s, OverallIterations: 270, TraceHistogramMax: 1, AutomataDifference: 122.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 123.6s, HoareTripleCheckerStatistics: 49629 SDtfs, 75461 SDslu, 142896 SDs, 0 SdLazy, 37817 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3410 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 3130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 242.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179196occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 240.5s AutomataMinimizationTime, 270 MinimizatonAttempts, 1459124 StatesRemovedByMinimization, 259 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 226.3s InterpolantComputationTime, 9180 NumberOfCodeBlocks, 9180 NumberOfCodeBlocksAsserted, 270 NumberOfCheckSat, 8910 ConstructedInterpolants, 0 QuantifiedInterpolants, 12690711 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 270 InterpolantComputations, 270 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