./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1f73d82f Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1f73d82-m [2024-11-21 11:19:22,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 11:19:23,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-21 11:19:23,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 11:19:23,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 11:19:23,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 11:19:23,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 11:19:23,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 11:19:23,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 11:19:23,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 11:19:23,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 11:19:23,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 11:19:23,044 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 11:19:23,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 11:19:23,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 11:19:23,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 11:19:23,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 11:19:23,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 11:19:23,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 11:19:23,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 11:19:23,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 11:19:23,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 11:19:23,045 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 11:19:23,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 11:19:23,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-21 11:19:23,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 11:19:23,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 11:19:23,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 11:19:23,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 11:19:23,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 11:19:23,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 11:19:23,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 11:19:23,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 11:19:23,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-21 11:19:23,047 INFO L153 SettingsManager]: * Commutativity condition synthesis=SUFFICIENT [2024-11-21 11:19:23,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 11:19:23,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 11:19:23,048 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-21 11:19:23,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 11:19:23,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 11:19:23,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-21 11:19:23,048 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-21 11:19:23,048 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-21 11:19:23,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c [2024-11-21 11:19:23,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 11:19:23,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 11:19:23,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 11:19:23,359 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 11:19:23,360 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 11:19:23,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2024-11-21 11:19:24,736 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/8b35cb54c/e4fbbb0580134fc8829064a1c3f7e952/FLAGdd7594934 [2024-11-21 11:19:25,029 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 11:19:25,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2024-11-21 11:19:25,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/8b35cb54c/e4fbbb0580134fc8829064a1c3f7e952/FLAGdd7594934 [2024-11-21 11:19:25,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/8b35cb54c/e4fbbb0580134fc8829064a1c3f7e952 [2024-11-21 11:19:25,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 11:19:25,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 11:19:25,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 11:19:25,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 11:19:25,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 11:19:25,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c02ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25, skipping insertion in model container [2024-11-21 11:19:25,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 11:19:25,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i[30176,30189] [2024-11-21 11:19:25,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 11:19:25,407 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 11:19:25,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i[30176,30189] [2024-11-21 11:19:25,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 11:19:25,519 INFO L204 MainTranslator]: Completed translation [2024-11-21 11:19:25,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25 WrapperNode [2024-11-21 11:19:25,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 11:19:25,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 11:19:25,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 11:19:25,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 11:19:25,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,570 INFO L138 Inliner]: procedures = 170, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2024-11-21 11:19:25,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 11:19:25,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 11:19:25,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 11:19:25,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 11:19:25,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 11:19:25,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 11:19:25,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 11:19:25,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 11:19:25,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (1/1) ... [2024-11-21 11:19:25,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 11:19:25,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 11:19:25,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-21 11:19:25,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-21 11:19:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-21 11:19:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-21 11:19:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-21 11:19:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 11:19:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-21 11:19:25,671 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-21 11:19:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-21 11:19:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-21 11:19:25,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 11:19:25,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 11:19:25,673 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-21 11:19:25,789 INFO L234 CfgBuilder]: Building ICFG [2024-11-21 11:19:25,791 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 11:19:25,986 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-21 11:19:25,986 INFO L283 CfgBuilder]: Performing block encoding [2024-11-21 11:19:26,164 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 11:19:26,164 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-21 11:19:26,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:19:26 BoogieIcfgContainer [2024-11-21 11:19:26,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 11:19:26,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 11:19:26,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 11:19:26,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 11:19:26,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:19:25" (1/3) ... [2024-11-21 11:19:26,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d21202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:19:26, skipping insertion in model container [2024-11-21 11:19:26,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:19:25" (2/3) ... [2024-11-21 11:19:26,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d21202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:19:26, skipping insertion in model container [2024-11-21 11:19:26,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:19:26" (3/3) ... [2024-11-21 11:19:26,176 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_21-deref_read_racing.i [2024-11-21 11:19:26,191 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 11:19:26,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_21-deref_read_racing.i that has 2 procedures, 33 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2024-11-21 11:19:26,195 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-21 11:19:26,236 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:19:26,284 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:26,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-21 11:19:26,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-21 11:19:26,287 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-21 11:19:26,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-21 11:19:26,356 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:19:26,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:19:26,377 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:26,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:19:26,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:26,567 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:26,567 INFO L139 ounterexampleChecker]: Examining path program with hash 1912069828, occurence #1 [2024-11-21 11:19:26,567 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:26,567 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:26,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:26,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1651313413, now seen corresponding path program 1 times [2024-11-21 11:19:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:26,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925123582] [2024-11-21 11:19:26,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:26,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:26,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:26,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925123582] [2024-11-21 11:19:26,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925123582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:26,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:26,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:19:26,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927967795] [2024-11-21 11:19:26,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:26,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:19:26,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:26,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:19:26,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:19:26,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:26,780 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:26,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:26,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:26,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 11:19:26,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:26,859 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:26,859 INFO L139 ounterexampleChecker]: Examining path program with hash -2126754215, occurence #1 [2024-11-21 11:19:26,860 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:26,860 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:26,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1482078621, now seen corresponding path program 1 times [2024-11-21 11:19:26,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:26,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177349575] [2024-11-21 11:19:26,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:26,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:26,887 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:19:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:26,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:19:26,936 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:19:26,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:19:26,940 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:19:26,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 11:19:26,947 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 11:19:26,949 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:19:26,949 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-21 11:19:26,972 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:19:26,977 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:26,986 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:19:26,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:19:26,987 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:26,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:19:27,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:27,258 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:27,258 INFO L139 ounterexampleChecker]: Examining path program with hash -1080315154, occurence #1 [2024-11-21 11:19:27,258 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:27,259 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:27,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1595445842, now seen corresponding path program 1 times [2024-11-21 11:19:27,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:27,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623607336] [2024-11-21 11:19:27,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:27,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:27,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:27,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623607336] [2024-11-21 11:19:27,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623607336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:27,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:27,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:19:27,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226019824] [2024-11-21 11:19:27,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:27,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:19:27,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:27,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:19:27,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:19:27,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:27,320 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:27,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:27,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:27,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 11:19:27,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:27,746 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:27,746 INFO L139 ounterexampleChecker]: Examining path program with hash -1427498470, occurence #1 [2024-11-21 11:19:27,746 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:27,746 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:27,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash 62219460, now seen corresponding path program 1 times [2024-11-21 11:19:27,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:27,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248444846] [2024-11-21 11:19:27,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:27,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:27,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248444846] [2024-11-21 11:19:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248444846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:27,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:19:27,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861458142] [2024-11-21 11:19:27,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:27,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:19:27,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:27,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:19:27,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:19:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:27,960 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:27,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:27,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:27,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:28,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 11:19:28,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:28,103 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:28,103 INFO L139 ounterexampleChecker]: Examining path program with hash 528828362, occurence #1 [2024-11-21 11:19:28,103 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:28,103 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:28,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:28,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1208097409, now seen corresponding path program 1 times [2024-11-21 11:19:28,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:28,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867966786] [2024-11-21 11:19:28,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:28,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:28,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867966786] [2024-11-21 11:19:28,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867966786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:28,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:28,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:19:28,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147794186] [2024-11-21 11:19:28,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:28,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:19:28,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:28,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:19:28,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:19:28,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:28,364 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:28,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:28,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:28,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:28,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:28,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:19:28,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 11:19:28,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:28,472 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:28,472 INFO L139 ounterexampleChecker]: Examining path program with hash 1827931216, occurence #1 [2024-11-21 11:19:28,472 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:28,472 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:28,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:28,472 INFO L85 PathProgramCache]: Analyzing trace with hash -65783168, now seen corresponding path program 1 times [2024-11-21 11:19:28,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:28,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848043827] [2024-11-21 11:19:28,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:28,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:28,497 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:19:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:28,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:19:28,525 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:19:28,525 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:19:28,525 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:19:28,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 11:19:28,527 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:19:28,527 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:19:28,527 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-21 11:19:28,549 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:19:28,556 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:28,568 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:19:28,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:19:28,569 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:28,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:19:28,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:28,952 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:28,952 INFO L139 ounterexampleChecker]: Examining path program with hash -1433641563, occurence #1 [2024-11-21 11:19:28,953 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:28,953 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:28,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:28,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2125581038, now seen corresponding path program 1 times [2024-11-21 11:19:28,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:28,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920997124] [2024-11-21 11:19:28,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:28,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:28,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:28,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920997124] [2024-11-21 11:19:28,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920997124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:28,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:28,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:19:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691588380] [2024-11-21 11:19:28,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:28,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:19:28,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:28,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:19:28,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:19:28,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:28,986 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:28,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:28,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:29,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 11:19:29,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:29,825 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:29,825 INFO L139 ounterexampleChecker]: Examining path program with hash 298072821, occurence #1 [2024-11-21 11:19:29,825 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:29,825 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:29,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash 906924130, now seen corresponding path program 1 times [2024-11-21 11:19:29,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:29,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203504321] [2024-11-21 11:19:29,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:29,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:29,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:29,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203504321] [2024-11-21 11:19:29,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203504321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:29,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:29,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:19:29,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338666267] [2024-11-21 11:19:29,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:29,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:19:29,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:29,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:19:29,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:19:29,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:29,949 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:29,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:29,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:29,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:30,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:30,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 11:19:30,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:30,142 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:30,142 INFO L139 ounterexampleChecker]: Examining path program with hash 354591989, occurence #1 [2024-11-21 11:19:30,142 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:30,142 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:30,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1009964099, now seen corresponding path program 1 times [2024-11-21 11:19:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:30,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161206224] [2024-11-21 11:19:30,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:30,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:30,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161206224] [2024-11-21 11:19:30,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161206224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:30,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:30,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:19:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508547699] [2024-11-21 11:19:30,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:30,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:19:30,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:30,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:19:30,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:19:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:30,340 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:30,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:30,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:30,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:30,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:19:30,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 11:19:30,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:30,541 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:30,541 INFO L139 ounterexampleChecker]: Examining path program with hash 1236828972, occurence #1 [2024-11-21 11:19:30,541 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:30,541 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:30,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:30,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1697221860, now seen corresponding path program 1 times [2024-11-21 11:19:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:30,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202744983] [2024-11-21 11:19:30,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:30,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:30,569 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:19:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:30,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:19:30,595 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:19:30,595 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:19:30,595 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:19:30,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 11:19:30,596 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:19:30,597 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:19:30,597 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-21 11:19:30,617 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:19:30,620 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:30,630 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:19:30,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:19:30,630 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:30,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:19:31,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:31,070 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:31,070 INFO L139 ounterexampleChecker]: Examining path program with hash 2018770039, occurence #1 [2024-11-21 11:19:31,070 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:31,070 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:31,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1923547087, now seen corresponding path program 1 times [2024-11-21 11:19:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:31,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908594190] [2024-11-21 11:19:31,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:31,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:31,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:31,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908594190] [2024-11-21 11:19:31,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908594190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:31,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:31,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:19:31,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412978267] [2024-11-21 11:19:31,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:31,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:19:31,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:31,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:19:31,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:19:31,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:31,107 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:31,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:31,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:32,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:32,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 11:19:32,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:32,286 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:32,286 INFO L139 ounterexampleChecker]: Examining path program with hash -607621009, occurence #1 [2024-11-21 11:19:32,286 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:32,286 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:32,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:32,286 INFO L85 PathProgramCache]: Analyzing trace with hash -344163789, now seen corresponding path program 1 times [2024-11-21 11:19:32,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:32,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085748897] [2024-11-21 11:19:32,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:32,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:32,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:32,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085748897] [2024-11-21 11:19:32,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085748897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:32,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:32,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:19:32,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916193223] [2024-11-21 11:19:32,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:32,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:19:32,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:32,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:19:32,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:19:32,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:32,426 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:32,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:32,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:32,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:32,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 11:19:32,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:32,641 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:32,641 INFO L139 ounterexampleChecker]: Examining path program with hash 1847980022, occurence #1 [2024-11-21 11:19:32,641 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:32,641 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:32,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1948197035, now seen corresponding path program 1 times [2024-11-21 11:19:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252187585] [2024-11-21 11:19:32,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:32,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252187585] [2024-11-21 11:19:32,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252187585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:32,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:32,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:19:32,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780899574] [2024-11-21 11:19:32,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:32,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:19:32,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:32,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:19:32,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:19:32,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:32,813 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:32,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:32,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:32,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:32,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:33,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:19:33,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 11:19:33,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:33,019 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:33,020 INFO L139 ounterexampleChecker]: Examining path program with hash 1912178745, occurence #1 [2024-11-21 11:19:33,020 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:33,020 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:33,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:33,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1656485266, now seen corresponding path program 1 times [2024-11-21 11:19:33,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:33,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860683787] [2024-11-21 11:19:33,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:33,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:33,038 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:19:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:33,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:19:33,056 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:19:33,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:19:33,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:19:33,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 11:19:33,058 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:19:33,058 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:19:33,058 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-21 11:19:33,080 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:19:33,086 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:33,108 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:19:33,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:19:33,110 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:33,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:19:33,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:33,687 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:33,687 INFO L139 ounterexampleChecker]: Examining path program with hash -1414582372, occurence #1 [2024-11-21 11:19:33,687 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:33,687 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:33,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash -478618849, now seen corresponding path program 1 times [2024-11-21 11:19:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:33,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066877046] [2024-11-21 11:19:33,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:33,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:33,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066877046] [2024-11-21 11:19:33,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066877046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:33,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:33,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:19:33,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326272896] [2024-11-21 11:19:33,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:33,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:19:33,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:33,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:19:33,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:19:33,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:33,717 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:33,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:33,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:35,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:35,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-21 11:19:35,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:35,167 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:35,167 INFO L139 ounterexampleChecker]: Examining path program with hash -1898777728, occurence #1 [2024-11-21 11:19:35,167 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:35,167 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:35,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash 671418355, now seen corresponding path program 1 times [2024-11-21 11:19:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:35,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930969581] [2024-11-21 11:19:35,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:35,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:35,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:35,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:35,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930969581] [2024-11-21 11:19:35,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930969581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:35,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:35,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:19:35,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126409176] [2024-11-21 11:19:35,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:35,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:19:35,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:35,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:19:35,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:19:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:35,283 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:35,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:35,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:35,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:35,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-21 11:19:35,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:35,552 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:35,552 INFO L139 ounterexampleChecker]: Examining path program with hash -1688903930, occurence #1 [2024-11-21 11:19:35,552 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:35,552 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:35,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1932229144, now seen corresponding path program 1 times [2024-11-21 11:19:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828528179] [2024-11-21 11:19:35,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:35,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:35,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828528179] [2024-11-21 11:19:35,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828528179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:35,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:35,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:19:35,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529143171] [2024-11-21 11:19:35,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:35,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:19:35,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:35,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:19:35,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:19:35,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:35,699 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:35,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:35,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:35,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:35,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:19:36,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-21 11:19:36,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:36,042 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:36,042 INFO L139 ounterexampleChecker]: Examining path program with hash 1224246090, occurence #1 [2024-11-21 11:19:36,042 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:36,042 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:36,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1217429950, now seen corresponding path program 1 times [2024-11-21 11:19:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:36,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806381657] [2024-11-21 11:19:36,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:36,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:36,070 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:19:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:36,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:19:36,108 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:19:36,108 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:19:36,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:19:36,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-21 11:19:36,110 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:19:36,110 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:19:36,110 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-21 11:19:36,135 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:19:36,137 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:36,152 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:19:36,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:19:36,153 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:36,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:19:36,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:36,857 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:36,857 INFO L139 ounterexampleChecker]: Examining path program with hash 684227340, occurence #1 [2024-11-21 11:19:36,858 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:36,858 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:36,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:36,858 INFO L85 PathProgramCache]: Analyzing trace with hash 829340176, now seen corresponding path program 1 times [2024-11-21 11:19:36,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:36,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926612191] [2024-11-21 11:19:36,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:36,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:36,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:36,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926612191] [2024-11-21 11:19:36,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926612191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:36,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:36,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:19:36,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763183655] [2024-11-21 11:19:36,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:36,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:19:36,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:36,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:19:36,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:19:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:36,878 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:36,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:36,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:38,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-21 11:19:38,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:38,660 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:38,660 INFO L139 ounterexampleChecker]: Examining path program with hash 1605398938, occurence #1 [2024-11-21 11:19:38,660 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:38,660 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:38,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1822733357, now seen corresponding path program 1 times [2024-11-21 11:19:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:38,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89183564] [2024-11-21 11:19:38,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:38,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89183564] [2024-11-21 11:19:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89183564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:38,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:38,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:19:38,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737604462] [2024-11-21 11:19:38,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:38,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:19:38,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:38,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:19:38,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:19:38,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:38,797 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:38,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:38,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:38,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:39,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:39,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:39,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-21 11:19:39,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:39,182 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:39,182 INFO L139 ounterexampleChecker]: Examining path program with hash 1958034719, occurence #1 [2024-11-21 11:19:39,182 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:39,182 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:39,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:39,182 INFO L85 PathProgramCache]: Analyzing trace with hash -113738041, now seen corresponding path program 1 times [2024-11-21 11:19:39,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:39,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206942231] [2024-11-21 11:19:39,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:39,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206942231] [2024-11-21 11:19:39,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206942231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:39,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:39,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:19:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441009747] [2024-11-21 11:19:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:39,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:19:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:39,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:19:39,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:19:39,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:39,368 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:39,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:39,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:39,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:39,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:39,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:19:39,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-21 11:19:39,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:39,886 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:39,887 INFO L139 ounterexampleChecker]: Examining path program with hash -1599493785, occurence #1 [2024-11-21 11:19:39,887 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:39,887 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:39,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1743421554, now seen corresponding path program 1 times [2024-11-21 11:19:39,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:39,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981132497] [2024-11-21 11:19:39,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:39,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:39,909 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:19:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:39,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:19:39,938 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:19:39,938 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:19:39,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:19:39,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-21 11:19:39,940 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:19:39,942 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:19:39,942 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-11-21 11:19:39,970 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:19:39,972 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:39,988 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:19:39,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:19:39,988 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:39,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:19:40,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:40,828 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:40,828 INFO L139 ounterexampleChecker]: Examining path program with hash -542652449, occurence #1 [2024-11-21 11:19:40,828 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:40,828 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:40,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:40,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1422185132, now seen corresponding path program 1 times [2024-11-21 11:19:40,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:40,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328635743] [2024-11-21 11:19:40,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:40,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:40,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328635743] [2024-11-21 11:19:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328635743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:40,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:40,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:19:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671019798] [2024-11-21 11:19:40,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:40,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:19:40,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:40,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:19:40,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:19:40,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:40,851 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:40,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:40,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:43,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-21 11:19:43,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:43,368 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:43,369 INFO L139 ounterexampleChecker]: Examining path program with hash 1439341387, occurence #1 [2024-11-21 11:19:43,369 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:43,369 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:43,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash 694780264, now seen corresponding path program 1 times [2024-11-21 11:19:43,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:43,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240285612] [2024-11-21 11:19:43,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:43,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:43,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240285612] [2024-11-21 11:19:43,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240285612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:43,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:43,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:19:43,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693116092] [2024-11-21 11:19:43,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:43,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:19:43,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:43,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:19:43,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:19:43,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:43,477 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:43,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:43,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:43,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:43,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:43,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-21 11:19:43,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:43,951 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:43,951 INFO L139 ounterexampleChecker]: Examining path program with hash 22844385, occurence #1 [2024-11-21 11:19:43,952 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:43,952 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:43,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:43,952 INFO L85 PathProgramCache]: Analyzing trace with hash -748619975, now seen corresponding path program 1 times [2024-11-21 11:19:43,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:43,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139718768] [2024-11-21 11:19:43,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:44,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:44,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139718768] [2024-11-21 11:19:44,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139718768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:44,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:44,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:19:44,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483624306] [2024-11-21 11:19:44,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:44,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:19:44,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:44,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:19:44,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:19:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:44,121 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:44,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:44,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:44,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:44,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:44,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:44,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:44,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:19:44,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-21 11:19:44,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:44,715 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:44,715 INFO L139 ounterexampleChecker]: Examining path program with hash 165354272, occurence #1 [2024-11-21 11:19:44,715 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:44,715 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:44,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash -11321199, now seen corresponding path program 1 times [2024-11-21 11:19:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:44,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600268432] [2024-11-21 11:19:44,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:44,761 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:19:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:44,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:19:44,789 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:19:44,789 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:19:44,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:19:44,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-21 11:19:44,792 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:19:44,792 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:19:44,792 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-11-21 11:19:44,818 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:19:44,820 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:44,839 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:19:44,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:19:44,840 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:44,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:19:45,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:45,933 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:45,933 INFO L139 ounterexampleChecker]: Examining path program with hash 2121093290, occurence #1 [2024-11-21 11:19:45,933 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:45,933 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:45,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1172075785, now seen corresponding path program 1 times [2024-11-21 11:19:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:45,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396692838] [2024-11-21 11:19:45,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:45,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:45,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396692838] [2024-11-21 11:19:45,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396692838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:45,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:45,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:19:45,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562146884] [2024-11-21 11:19:45,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:45,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:19:45,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:45,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:19:45,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:19:45,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:45,965 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:45,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:45,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:48,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-21 11:19:48,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:48,953 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:48,953 INFO L139 ounterexampleChecker]: Examining path program with hash 254253011, occurence #1 [2024-11-21 11:19:48,953 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:48,953 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:48,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:48,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1479209145, now seen corresponding path program 1 times [2024-11-21 11:19:48,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:48,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340679181] [2024-11-21 11:19:48,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:48,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:49,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:49,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340679181] [2024-11-21 11:19:49,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340679181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:49,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:49,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:19:49,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620331230] [2024-11-21 11:19:49,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:49,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:19:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:49,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:19:49,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:19:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:49,057 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:49,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:49,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:49,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:49,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:49,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-21 11:19:49,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:49,580 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:49,580 INFO L139 ounterexampleChecker]: Examining path program with hash 34073194, occurence #1 [2024-11-21 11:19:49,580 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:49,580 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:49,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:49,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1907976684, now seen corresponding path program 1 times [2024-11-21 11:19:49,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:49,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902199100] [2024-11-21 11:19:49,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:49,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:49,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:49,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902199100] [2024-11-21 11:19:49,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902199100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:49,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:49,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:19:49,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681812740] [2024-11-21 11:19:49,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:49,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:19:49,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:49,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:19:49,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:19:49,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:49,753 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:49,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:49,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:49,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:49,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:19:50,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-21 11:19:50,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:50,540 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:50,540 INFO L139 ounterexampleChecker]: Examining path program with hash -1689428115, occurence #1 [2024-11-21 11:19:50,540 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:50,540 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:50,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:50,540 INFO L85 PathProgramCache]: Analyzing trace with hash 267799694, now seen corresponding path program 1 times [2024-11-21 11:19:50,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:50,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685001953] [2024-11-21 11:19:50,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:50,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:50,564 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:19:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:50,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:19:50,593 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:19:50,593 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:19:50,594 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:19:50,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-21 11:19:50,595 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:19:50,596 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:19:50,596 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-11-21 11:19:50,627 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:19:50,630 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:50,653 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:19:50,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:19:50,653 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:50,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:19:51,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:51,850 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:51,850 INFO L139 ounterexampleChecker]: Examining path program with hash -1474886810, occurence #1 [2024-11-21 11:19:51,850 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:51,850 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:51,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:51,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1270739685, now seen corresponding path program 1 times [2024-11-21 11:19:51,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:51,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950642279] [2024-11-21 11:19:51,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:51,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950642279] [2024-11-21 11:19:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950642279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:51,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:51,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:19:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404842244] [2024-11-21 11:19:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:51,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:19:51,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:51,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:19:51,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:19:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:51,872 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:51,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:51,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:55,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:55,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-21 11:19:55,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:55,104 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:55,104 INFO L139 ounterexampleChecker]: Examining path program with hash -1446440180, occurence #1 [2024-11-21 11:19:55,104 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:55,104 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:55,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash -269768747, now seen corresponding path program 1 times [2024-11-21 11:19:55,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:55,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393655074] [2024-11-21 11:19:55,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:55,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:55,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:55,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393655074] [2024-11-21 11:19:55,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393655074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:55,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:55,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:19:55,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716273044] [2024-11-21 11:19:55,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:55,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:19:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:55,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:19:55,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:19:55,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:55,247 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:55,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:55,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:55,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:55,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-21 11:19:55,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:55,877 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:55,877 INFO L139 ounterexampleChecker]: Examining path program with hash 1218744502, occurence #1 [2024-11-21 11:19:55,877 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:55,878 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:55,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:55,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1552649242, now seen corresponding path program 1 times [2024-11-21 11:19:55,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:55,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027697458] [2024-11-21 11:19:55,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:55,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:56,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:56,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027697458] [2024-11-21 11:19:56,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027697458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:56,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:56,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:19:56,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185680667] [2024-11-21 11:19:56,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:56,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:19:56,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:56,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:19:56,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:19:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:56,068 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:56,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:56,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:56,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:56,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:57,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:57,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:19:57,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:19:57,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-21 11:19:57,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:57,007 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:57,007 INFO L139 ounterexampleChecker]: Examining path program with hash 1223703514, occurence #1 [2024-11-21 11:19:57,007 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:57,007 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:57,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1452997722, now seen corresponding path program 1 times [2024-11-21 11:19:57,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:57,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57564474] [2024-11-21 11:19:57,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:57,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:57,028 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:19:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:19:57,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:19:57,060 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:19:57,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:19:57,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:19:57,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-21 11:19:57,062 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:19:57,062 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:19:57,062 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-11-21 11:19:57,093 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:19:57,095 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:57,117 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:19:57,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:19:57,117 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:19:57,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:19:58,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:19:58,468 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:19:58,468 INFO L139 ounterexampleChecker]: Examining path program with hash -1419171728, occurence #1 [2024-11-21 11:19:58,468 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:19:58,468 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:19:58,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:19:58,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1732891404, now seen corresponding path program 1 times [2024-11-21 11:19:58,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:19:58,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60552891] [2024-11-21 11:19:58,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:19:58,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:19:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:19:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:19:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:19:58,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60552891] [2024-11-21 11:19:58,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60552891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:19:58,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:19:58,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:19:58,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858499559] [2024-11-21 11:19:58,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:19:58,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:19:58,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:19:58,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:19:58,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:19:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:19:58,491 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:19:58,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:19:58,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:02,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-21 11:20:02,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:02,295 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:02,295 INFO L139 ounterexampleChecker]: Examining path program with hash -783774085, occurence #1 [2024-11-21 11:20:02,295 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:02,295 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:02,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:02,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1461270461, now seen corresponding path program 1 times [2024-11-21 11:20:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:02,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345196573] [2024-11-21 11:20:02,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:02,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:02,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:02,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345196573] [2024-11-21 11:20:02,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345196573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:02,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:02,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:20:02,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542458857] [2024-11-21 11:20:02,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:02,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:20:02,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:02,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:20:02,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:20:02,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:02,416 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:02,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:02,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:02,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:03,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:03,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:03,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-21 11:20:03,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:03,031 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:03,031 INFO L139 ounterexampleChecker]: Examining path program with hash 877318882, occurence #1 [2024-11-21 11:20:03,031 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:03,031 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:03,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash -543931009, now seen corresponding path program 1 times [2024-11-21 11:20:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:03,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926486977] [2024-11-21 11:20:03,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:03,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:03,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:03,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926486977] [2024-11-21 11:20:03,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926486977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:03,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:03,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:20:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661011102] [2024-11-21 11:20:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:03,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:20:03,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:03,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:20:03,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:20:03,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:03,269 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:03,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:03,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:03,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:03,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:20:04,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-21 11:20:04,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:04,200 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:04,201 INFO L139 ounterexampleChecker]: Examining path program with hash 649505613, occurence #1 [2024-11-21 11:20:04,201 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:04,201 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:04,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:04,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1614835265, now seen corresponding path program 1 times [2024-11-21 11:20:04,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:04,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377409346] [2024-11-21 11:20:04,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:04,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:20:04,225 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:20:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:20:04,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:20:04,263 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:20:04,264 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:20:04,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:20:04,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-21 11:20:04,265 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:20:04,266 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:20:04,266 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-11-21 11:20:04,297 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:20:04,301 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:20:04,323 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:20:04,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:20:04,325 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:20:04,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:20:05,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:05,881 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:05,881 INFO L139 ounterexampleChecker]: Examining path program with hash 1855023298, occurence #1 [2024-11-21 11:20:05,881 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:05,881 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:05,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1324773530, now seen corresponding path program 1 times [2024-11-21 11:20:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:05,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363252711] [2024-11-21 11:20:05,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:05,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:05,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:05,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363252711] [2024-11-21 11:20:05,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363252711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:05,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:05,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:20:05,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661250246] [2024-11-21 11:20:05,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:05,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:20:05,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:05,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:20:05,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:20:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:05,900 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:05,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:05,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:10,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-21 11:20:10,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:10,387 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:10,387 INFO L139 ounterexampleChecker]: Examining path program with hash 1145859548, occurence #1 [2024-11-21 11:20:10,387 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:10,387 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:10,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1727547318, now seen corresponding path program 1 times [2024-11-21 11:20:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:10,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976498415] [2024-11-21 11:20:10,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:10,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:10,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:10,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976498415] [2024-11-21 11:20:10,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976498415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:10,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:10,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:20:10,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659452916] [2024-11-21 11:20:10,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:10,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:20:10,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:10,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:20:10,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:20:10,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:10,482 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:10,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:10,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:10,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:11,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-21 11:20:11,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:11,217 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:11,218 INFO L139 ounterexampleChecker]: Examining path program with hash -1138904737, occurence #1 [2024-11-21 11:20:11,218 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:11,218 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:11,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash 294304134, now seen corresponding path program 1 times [2024-11-21 11:20:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:11,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053241564] [2024-11-21 11:20:11,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:11,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:11,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:11,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053241564] [2024-11-21 11:20:11,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053241564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:11,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:11,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:20:11,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496995299] [2024-11-21 11:20:11,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:11,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:20:11,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:11,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:20:11,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:20:11,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:11,414 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:11,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:11,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:11,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:11,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:12,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:20:12,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-21 11:20:12,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:12,638 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:12,638 INFO L139 ounterexampleChecker]: Examining path program with hash 892359719, occurence #1 [2024-11-21 11:20:12,638 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:12,638 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:12,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash 680377678, now seen corresponding path program 1 times [2024-11-21 11:20:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:12,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757090840] [2024-11-21 11:20:12,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:20:12,664 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:20:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:20:12,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:20:12,696 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:20:12,696 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:20:12,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:20:12,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-21 11:20:12,698 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:20:12,698 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:20:12,698 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-11-21 11:20:12,739 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:20:12,745 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:20:12,770 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:20:12,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:20:12,772 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:20:12,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:20:14,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:14,558 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:14,559 INFO L139 ounterexampleChecker]: Examining path program with hash -1186959560, occurence #1 [2024-11-21 11:20:14,559 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:14,559 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:14,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1347054793, now seen corresponding path program 1 times [2024-11-21 11:20:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:14,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961880787] [2024-11-21 11:20:14,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:14,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:14,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:14,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961880787] [2024-11-21 11:20:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961880787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:14,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:14,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:20:14,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861205640] [2024-11-21 11:20:14,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:14,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:20:14,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:14,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:20:14,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:20:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:14,580 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:14,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:14,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:19,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-21 11:20:19,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:19,741 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:19,742 INFO L139 ounterexampleChecker]: Examining path program with hash -1869111995, occurence #1 [2024-11-21 11:20:19,742 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:19,742 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:19,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash -341147535, now seen corresponding path program 1 times [2024-11-21 11:20:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:19,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513889492] [2024-11-21 11:20:19,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:19,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:19,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:19,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513889492] [2024-11-21 11:20:19,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513889492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:19,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:19,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:20:19,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732941727] [2024-11-21 11:20:19,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:19,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:20:19,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:19,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:20:19,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:20:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:19,839 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:19,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:19,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:19,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:20,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:20,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:20,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-21 11:20:20,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:20,791 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:20,791 INFO L139 ounterexampleChecker]: Examining path program with hash 381768850, occurence #1 [2024-11-21 11:20:20,791 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:20,791 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:20,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2120378170, now seen corresponding path program 1 times [2024-11-21 11:20:20,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:20,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217290583] [2024-11-21 11:20:20,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:20,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:21,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:21,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217290583] [2024-11-21 11:20:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217290583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:21,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:21,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:20:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694483957] [2024-11-21 11:20:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:21,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:20:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:21,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:20:21,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:20:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:21,011 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:21,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:21,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:21,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:21,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:20:22,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-21 11:20:22,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:22,523 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:22,523 INFO L139 ounterexampleChecker]: Examining path program with hash 766279510, occurence #1 [2024-11-21 11:20:22,523 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:22,523 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:22,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:22,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1994023862, now seen corresponding path program 1 times [2024-11-21 11:20:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:22,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464182645] [2024-11-21 11:20:22,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:22,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:20:22,552 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:20:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:20:22,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:20:22,589 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:20:22,589 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:20:22,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:20:22,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-21 11:20:22,591 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:20:22,592 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:20:22,592 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-11-21 11:20:22,628 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:20:22,631 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:20:22,656 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:20:22,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:20:22,657 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:20:22,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:20:24,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:24,679 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:24,679 INFO L139 ounterexampleChecker]: Examining path program with hash 896625428, occurence #1 [2024-11-21 11:20:24,679 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:24,679 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:24,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:24,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1170806655, now seen corresponding path program 1 times [2024-11-21 11:20:24,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:24,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698086451] [2024-11-21 11:20:24,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:24,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:24,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:24,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698086451] [2024-11-21 11:20:24,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698086451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:24,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:24,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:20:24,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424653438] [2024-11-21 11:20:24,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:24,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:20:24,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:24,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:20:24,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:20:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:24,706 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:24,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:24,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:30,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:30,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-21 11:20:30,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:30,568 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:30,568 INFO L139 ounterexampleChecker]: Examining path program with hash -1660743334, occurence #1 [2024-11-21 11:20:30,568 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:30,568 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:30,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:30,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1406788292, now seen corresponding path program 1 times [2024-11-21 11:20:30,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:30,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936285960] [2024-11-21 11:20:30,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:30,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936285960] [2024-11-21 11:20:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936285960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:30,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:30,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:20:30,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788212228] [2024-11-21 11:20:30,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:30,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:20:30,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:30,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:20:30,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:20:30,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:30,675 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:30,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:30,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:30,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:31,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-21 11:20:31,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:31,642 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:31,642 INFO L139 ounterexampleChecker]: Examining path program with hash -179021815, occurence #1 [2024-11-21 11:20:31,642 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:31,642 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:31,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:31,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1370693732, now seen corresponding path program 1 times [2024-11-21 11:20:31,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:31,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130581486] [2024-11-21 11:20:31,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:31,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:31,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:31,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130581486] [2024-11-21 11:20:31,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130581486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:31,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:31,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:20:31,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114087313] [2024-11-21 11:20:31,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:31,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:20:31,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:31,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:20:31,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:20:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:31,842 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:31,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:31,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:31,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:31,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:33,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:33,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:20:33,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-21 11:20:33,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:33,546 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:33,546 INFO L139 ounterexampleChecker]: Examining path program with hash -27191154, occurence #1 [2024-11-21 11:20:33,546 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:33,546 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:33,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:33,546 INFO L85 PathProgramCache]: Analyzing trace with hash 174234502, now seen corresponding path program 1 times [2024-11-21 11:20:33,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:33,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574306701] [2024-11-21 11:20:33,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:33,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:20:33,574 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:20:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:20:33,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:20:33,613 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:20:33,613 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:20:33,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:20:33,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-21 11:20:33,616 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:20:33,616 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:20:33,616 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-11-21 11:20:33,753 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:20:33,757 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:20:33,788 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:20:33,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:20:33,788 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:20:33,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:20:36,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:36,149 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:36,149 INFO L139 ounterexampleChecker]: Examining path program with hash -1302778682, occurence #1 [2024-11-21 11:20:36,149 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:36,149 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:36,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:36,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1726751702, now seen corresponding path program 1 times [2024-11-21 11:20:36,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:36,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788320878] [2024-11-21 11:20:36,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:36,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:36,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:36,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788320878] [2024-11-21 11:20:36,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788320878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:36,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:36,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:20:36,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332028165] [2024-11-21 11:20:36,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:36,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:20:36,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:36,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:20:36,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:20:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:36,172 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:36,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:36,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:43,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-21 11:20:43,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:43,000 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:43,000 INFO L139 ounterexampleChecker]: Examining path program with hash 937317646, occurence #1 [2024-11-21 11:20:43,000 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:43,000 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:43,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash -302808329, now seen corresponding path program 1 times [2024-11-21 11:20:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:43,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380187624] [2024-11-21 11:20:43,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:43,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:43,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:43,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380187624] [2024-11-21 11:20:43,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380187624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:43,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:43,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:20:43,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603162058] [2024-11-21 11:20:43,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:43,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:20:43,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:43,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:20:43,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:20:43,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:43,113 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:43,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:43,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:43,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:44,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-21 11:20:44,166 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:44,166 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:44,166 INFO L139 ounterexampleChecker]: Examining path program with hash 1316628533, occurence #1 [2024-11-21 11:20:44,166 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:44,166 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:44,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:44,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2085266199, now seen corresponding path program 1 times [2024-11-21 11:20:44,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:44,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724814106] [2024-11-21 11:20:44,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:44,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:44,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:44,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724814106] [2024-11-21 11:20:44,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724814106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:44,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:44,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:20:44,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229852729] [2024-11-21 11:20:44,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:44,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:20:44,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:44,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:20:44,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:20:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:44,391 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:44,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:44,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:44,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:44,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:20:46,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-21 11:20:46,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:46,447 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:46,447 INFO L139 ounterexampleChecker]: Examining path program with hash -1917938600, occurence #1 [2024-11-21 11:20:46,447 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:46,447 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:46,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:46,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1348049316, now seen corresponding path program 1 times [2024-11-21 11:20:46,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:46,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976556287] [2024-11-21 11:20:46,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:46,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:20:46,474 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:20:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:20:46,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:20:46,513 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:20:46,513 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:20:46,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:20:46,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-21 11:20:46,515 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-21 11:20:46,515 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:20:46,515 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-11-21 11:20:46,549 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:20:46,552 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:20:46,583 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:20:46,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:20:46,584 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:20:46,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:20:49,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:49,348 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:49,348 INFO L139 ounterexampleChecker]: Examining path program with hash 1140704908, occurence #1 [2024-11-21 11:20:49,348 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:49,348 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:49,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:49,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1754165240, now seen corresponding path program 1 times [2024-11-21 11:20:49,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:49,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821887524] [2024-11-21 11:20:49,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:49,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:49,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821887524] [2024-11-21 11:20:49,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821887524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:49,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:49,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:20:49,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707205271] [2024-11-21 11:20:49,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:49,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:20:49,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:49,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:20:49,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:20:49,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:49,373 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:49,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:49,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:57,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-21 11:20:57,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:57,251 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:57,252 INFO L139 ounterexampleChecker]: Examining path program with hash 1345137603, occurence #1 [2024-11-21 11:20:57,252 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:57,252 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:57,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:57,252 INFO L85 PathProgramCache]: Analyzing trace with hash 322353740, now seen corresponding path program 1 times [2024-11-21 11:20:57,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:57,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259697994] [2024-11-21 11:20:57,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:57,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:57,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:57,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259697994] [2024-11-21 11:20:57,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259697994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:57,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:57,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:20:57,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366822997] [2024-11-21 11:20:57,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:57,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:20:57,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:57,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:20:57,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:20:57,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:57,388 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:57,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:57,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:57,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:58,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:58,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:58,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-21 11:20:58,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:20:58,441 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:20:58,442 INFO L139 ounterexampleChecker]: Examining path program with hash 8633628, occurence #1 [2024-11-21 11:20:58,442 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:20:58,442 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:20:58,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:20:58,442 INFO L85 PathProgramCache]: Analyzing trace with hash 957895516, now seen corresponding path program 2 times [2024-11-21 11:20:58,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:20:58,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508404824] [2024-11-21 11:20:58,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:20:58,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:20:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:20:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:20:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:20:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508404824] [2024-11-21 11:20:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508404824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:20:58,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:20:58,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:20:58,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916675887] [2024-11-21 11:20:58,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:20:58,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:20:58,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:20:58,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:20:58,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:20:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:58,685 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:20:58,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:20:58,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:20:58,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:20:58,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:01,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:01,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:21:01,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:21:01,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-21 11:21:01,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:01,371 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:01,371 INFO L139 ounterexampleChecker]: Examining path program with hash 1889197406, occurence #1 [2024-11-21 11:21:01,371 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:01,371 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:01,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1327539640, now seen corresponding path program 1 times [2024-11-21 11:21:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:01,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517909993] [2024-11-21 11:21:01,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:01,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:21:01,405 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:21:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:21:01,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:21:01,456 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:21:01,456 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:21:01,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:21:01,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-21 11:21:01,457 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:21:01,458 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:21:01,458 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-11-21 11:21:01,494 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:21:01,498 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:21:01,529 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:21:01,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:21:01,530 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:21:01,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:21:04,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:04,731 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:04,731 INFO L139 ounterexampleChecker]: Examining path program with hash 104878708, occurence #1 [2024-11-21 11:21:04,731 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:04,731 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:04,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1289941505, now seen corresponding path program 1 times [2024-11-21 11:21:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:04,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992892770] [2024-11-21 11:21:04,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:21:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:21:04,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:21:04,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992892770] [2024-11-21 11:21:04,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992892770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:21:04,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:21:04,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:21:04,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342897024] [2024-11-21 11:21:04,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:21:04,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:21:04,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:21:04,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:21:04,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:21:04,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:04,758 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:21:04,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 59.0) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:21:04,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:13,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:13,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-21 11:21:13,250 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:13,250 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:13,250 INFO L139 ounterexampleChecker]: Examining path program with hash 1931968624, occurence #1 [2024-11-21 11:21:13,250 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:13,250 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:13,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:13,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1874794712, now seen corresponding path program 1 times [2024-11-21 11:21:13,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:13,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940260974] [2024-11-21 11:21:13,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:13,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:21:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:21:13,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:21:13,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940260974] [2024-11-21 11:21:13,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940260974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:21:13,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:21:13,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:21:13,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155280660] [2024-11-21 11:21:13,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:21:13,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:21:13,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:21:13,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:21:13,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:21:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:13,529 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:21:13,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:21:13,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:13,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:21:14,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-21 11:21:14,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:14,826 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:14,827 INFO L139 ounterexampleChecker]: Examining path program with hash -913636281, occurence #1 [2024-11-21 11:21:14,827 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:14,827 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:14,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:14,827 INFO L85 PathProgramCache]: Analyzing trace with hash -482843266, now seen corresponding path program 2 times [2024-11-21 11:21:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:14,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598478297] [2024-11-21 11:21:14,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:14,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:21:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:21:15,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:21:15,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598478297] [2024-11-21 11:21:15,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598478297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:21:15,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:21:15,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:21:15,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952115162] [2024-11-21 11:21:15,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:21:15,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:21:15,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:21:15,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:21:15,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:21:15,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:15,127 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:21:15,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.8) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:21:15,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:15,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:21:15,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:21:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:21:18,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-11-21 11:21:18,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:18,001 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:18,002 INFO L139 ounterexampleChecker]: Examining path program with hash 798537879, occurence #1 [2024-11-21 11:21:18,002 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:18,002 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:18,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:18,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1650855227, now seen corresponding path program 1 times [2024-11-21 11:21:18,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:18,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049478731] [2024-11-21 11:21:18,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:18,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:21:18,040 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:21:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:21:18,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:21:18,098 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:21:18,098 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:21:18,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:21:18,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-11-21 11:21:18,100 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:21:18,103 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:21:18,103 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-11-21 11:21:18,152 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:21:18,155 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:21:18,186 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:21:18,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:21:18,186 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:21:18,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:21:21,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:21,695 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:21,695 INFO L139 ounterexampleChecker]: Examining path program with hash -677406354, occurence #1 [2024-11-21 11:21:21,695 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:21,695 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:21,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1899669825, now seen corresponding path program 1 times [2024-11-21 11:21:21,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:21,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620763680] [2024-11-21 11:21:21,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:21,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:21:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:21:21,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:21:21,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620763680] [2024-11-21 11:21:21,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620763680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:21:21,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:21:21,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:21:21,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694860034] [2024-11-21 11:21:21,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:21:21,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:21:21,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:21:21,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:21:21,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:21:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:21,727 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:21:21,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:21:21,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:31,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-11-21 11:21:31,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:31,393 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:31,394 INFO L139 ounterexampleChecker]: Examining path program with hash -799495363, occurence #1 [2024-11-21 11:21:31,394 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:31,394 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash -616929735, now seen corresponding path program 1 times [2024-11-21 11:21:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:31,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666698085] [2024-11-21 11:21:31,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:21:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:21:31,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:21:31,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666698085] [2024-11-21 11:21:31,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666698085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:21:31,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:21:31,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:21:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745309534] [2024-11-21 11:21:31,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:21:31,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:21:31,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:21:31,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:21:31,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:21:31,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:31,532 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:21:31,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:21:31,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:31,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:21:32,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-11-21 11:21:32,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:32,611 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:32,612 INFO L139 ounterexampleChecker]: Examining path program with hash 2021461396, occurence #1 [2024-11-21 11:21:32,612 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:32,612 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:32,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1990015061, now seen corresponding path program 2 times [2024-11-21 11:21:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:32,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792088210] [2024-11-21 11:21:32,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:32,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:21:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:21:32,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:21:32,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792088210] [2024-11-21 11:21:32,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792088210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:21:32,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:21:32,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:21:32,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537401097] [2024-11-21 11:21:32,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:21:32,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:21:32,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:21:32,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:21:32,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:21:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:32,901 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:21:32,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:21:32,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:32,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:21:32,901 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:36,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:36,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:21:36,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:21:36,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-11-21 11:21:36,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:36,607 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:36,607 INFO L139 ounterexampleChecker]: Examining path program with hash -2134119743, occurence #1 [2024-11-21 11:21:36,607 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:36,607 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:36,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -274925288, now seen corresponding path program 1 times [2024-11-21 11:21:36,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:36,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108099477] [2024-11-21 11:21:36,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:21:36,652 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:21:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:21:36,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:21:36,721 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:21:36,721 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:21:36,721 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:21:36,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-11-21 11:21:36,723 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:21:36,723 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:21:36,723 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-11-21 11:21:36,783 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:21:36,788 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:21:36,829 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:21:36,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:21:36,830 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:21:36,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:21:40,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:40,651 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:40,651 INFO L139 ounterexampleChecker]: Examining path program with hash 2055468568, occurence #1 [2024-11-21 11:21:40,651 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:40,651 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:40,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:40,651 INFO L85 PathProgramCache]: Analyzing trace with hash 218414076, now seen corresponding path program 1 times [2024-11-21 11:21:40,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:40,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484025793] [2024-11-21 11:21:40,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:40,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:21:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:21:40,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:21:40,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484025793] [2024-11-21 11:21:40,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484025793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:21:40,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:21:40,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:21:40,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55996585] [2024-11-21 11:21:40,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:21:40,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:21:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:21:40,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:21:40,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:21:40,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:40,690 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:21:40,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:21:40,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:51,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-11-21 11:21:51,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:51,335 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:51,335 INFO L139 ounterexampleChecker]: Examining path program with hash -1610953890, occurence #1 [2024-11-21 11:21:51,335 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:51,335 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:51,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:51,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1957601309, now seen corresponding path program 1 times [2024-11-21 11:21:51,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:51,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689806074] [2024-11-21 11:21:51,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:51,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:21:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:21:51,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:21:51,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689806074] [2024-11-21 11:21:51,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689806074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:21:51,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:21:51,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:21:51,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152083828] [2024-11-21 11:21:51,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:21:51,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:21:51,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:21:51,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:21:51,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:21:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:51,491 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:21:51,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:21:51,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:51,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:21:52,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-11-21 11:21:52,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:52,618 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:52,618 INFO L139 ounterexampleChecker]: Examining path program with hash 1524315953, occurence #1 [2024-11-21 11:21:52,618 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:52,618 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:52,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1095206421, now seen corresponding path program 2 times [2024-11-21 11:21:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:52,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724441492] [2024-11-21 11:21:52,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:52,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:21:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:21:52,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:21:52,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724441492] [2024-11-21 11:21:52,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724441492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:21:52,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:21:52,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:21:52,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871672219] [2024-11-21 11:21:52,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:21:52,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:21:52,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:21:52,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:21:52,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:21:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:52,963 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:21:52,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.0) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:21:52,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:52,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:21:52,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:21:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:21:57,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:21:57,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-11-21 11:21:57,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:21:57,022 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:21:57,023 INFO L139 ounterexampleChecker]: Examining path program with hash -72692943, occurence #1 [2024-11-21 11:21:57,023 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:21:57,023 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:21:57,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:21:57,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1438663922, now seen corresponding path program 1 times [2024-11-21 11:21:57,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:21:57,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021649839] [2024-11-21 11:21:57,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:21:57,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:21:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:21:57,056 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:21:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:21:57,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:21:57,118 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:21:57,119 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:21:57,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:21:57,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-11-21 11:21:57,120 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:21:57,120 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:21:57,120 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2024-11-21 11:21:57,166 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:21:57,169 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:21:57,208 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:21:57,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:21:57,209 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:21:57,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:22:01,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:22:01,545 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:22:01,545 INFO L139 ounterexampleChecker]: Examining path program with hash -642647614, occurence #1 [2024-11-21 11:22:01,545 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:22:01,546 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:22:01,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:22:01,546 INFO L85 PathProgramCache]: Analyzing trace with hash 315662342, now seen corresponding path program 1 times [2024-11-21 11:22:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:22:01,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69991022] [2024-11-21 11:22:01,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:22:01,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:22:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:22:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:22:01,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:22:01,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69991022] [2024-11-21 11:22:01,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69991022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:22:01,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:22:01,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:22:01,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588064510] [2024-11-21 11:22:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:22:01,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:22:01,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:22:01,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:22:01,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:22:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:01,578 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:22:01,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:22:01,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:13,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:13,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-11-21 11:22:13,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:22:13,472 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:22:13,472 INFO L139 ounterexampleChecker]: Examining path program with hash -1145800709, occurence #1 [2024-11-21 11:22:13,473 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:22:13,473 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:22:13,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:22:13,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1774451877, now seen corresponding path program 1 times [2024-11-21 11:22:13,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:22:13,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137695433] [2024-11-21 11:22:13,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:22:13,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:22:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:22:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:22:13,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:22:13,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137695433] [2024-11-21 11:22:13,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137695433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:22:13,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:22:13,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:22:13,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660777024] [2024-11-21 11:22:13,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:22:13,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:22:13,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:22:13,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:22:13,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:22:13,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:13,757 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:22:13,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:22:13,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:13,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:22:15,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-11-21 11:22:15,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:22:15,107 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:22:15,108 INFO L139 ounterexampleChecker]: Examining path program with hash 1165761147, occurence #1 [2024-11-21 11:22:15,108 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:22:15,108 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:22:15,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:22:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1419614649, now seen corresponding path program 2 times [2024-11-21 11:22:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:22:15,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835142692] [2024-11-21 11:22:15,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:22:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:22:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:22:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:22:15,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:22:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835142692] [2024-11-21 11:22:15,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835142692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:22:15,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:22:15,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:22:15,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629169693] [2024-11-21 11:22:15,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:22:15,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:22:15,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:22:15,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:22:15,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:22:15,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:15,493 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:22:15,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.6) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:22:15,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:15,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:22:15,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:22:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:22:19,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-11-21 11:22:19,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:22:19,682 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:22:19,682 INFO L139 ounterexampleChecker]: Examining path program with hash -1836086215, occurence #1 [2024-11-21 11:22:19,682 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:22:19,682 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:22:19,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:22:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1107592450, now seen corresponding path program 1 times [2024-11-21 11:22:19,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:22:19,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940455268] [2024-11-21 11:22:19,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:22:19,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:22:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:22:19,723 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:22:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:22:19,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:22:19,784 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:22:19,784 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:22:19,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:22:19,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-11-21 11:22:19,786 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:22:19,787 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:22:19,787 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2024-11-21 11:22:19,846 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:22:19,849 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:22:19,889 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:22:19,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:22:19,890 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:22:19,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:22:24,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:22:24,721 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:22:24,721 INFO L139 ounterexampleChecker]: Examining path program with hash 835152452, occurence #1 [2024-11-21 11:22:24,721 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:22:24,721 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:22:24,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:22:24,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1639585019, now seen corresponding path program 1 times [2024-11-21 11:22:24,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:22:24,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284834504] [2024-11-21 11:22:24,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:22:24,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:22:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:22:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:22:24,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:22:24,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284834504] [2024-11-21 11:22:24,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284834504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:22:24,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:22:24,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:22:24,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545270493] [2024-11-21 11:22:24,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:22:24,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:22:24,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:22:24,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:22:24,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:22:24,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:24,756 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:22:24,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:22:24,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:37,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:37,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-11-21 11:22:37,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:22:37,689 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:22:37,689 INFO L139 ounterexampleChecker]: Examining path program with hash 115272970, occurence #1 [2024-11-21 11:22:37,689 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:22:37,689 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:22:37,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:22:37,690 INFO L85 PathProgramCache]: Analyzing trace with hash -459415240, now seen corresponding path program 1 times [2024-11-21 11:22:37,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:22:37,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404110384] [2024-11-21 11:22:37,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:22:37,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:22:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:22:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:22:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:22:37,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404110384] [2024-11-21 11:22:37,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404110384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:22:37,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:22:37,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:22:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904366750] [2024-11-21 11:22:37,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:22:37,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:22:37,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:22:37,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:22:37,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:22:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:37,897 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:22:37,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:22:37,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:37,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:22:39,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-11-21 11:22:39,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:22:39,113 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:22:39,113 INFO L139 ounterexampleChecker]: Examining path program with hash -1303599862, occurence #1 [2024-11-21 11:22:39,113 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:22:39,113 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:22:39,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:22:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash -800852030, now seen corresponding path program 2 times [2024-11-21 11:22:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:22:39,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946471259] [2024-11-21 11:22:39,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:22:39,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:22:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:22:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:22:39,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:22:39,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946471259] [2024-11-21 11:22:39,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946471259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:22:39,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:22:39,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:22:39,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751830629] [2024-11-21 11:22:39,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:22:39,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:22:39,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:22:39,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:22:39,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:22:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:39,644 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:22:39,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:22:39,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:39,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:22:39,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:22:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:22:44,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-11-21 11:22:44,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:22:44,440 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:22:44,440 INFO L139 ounterexampleChecker]: Examining path program with hash 1160802936, occurence #1 [2024-11-21 11:22:44,440 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:22:44,440 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:22:44,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:22:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1642511284, now seen corresponding path program 1 times [2024-11-21 11:22:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:22:44,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846026381] [2024-11-21 11:22:44,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:22:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:22:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:22:44,486 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:22:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:22:44,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:22:44,556 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:22:44,557 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:22:44,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:22:44,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-11-21 11:22:44,559 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:22:44,560 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:22:44,560 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2024-11-21 11:22:44,609 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:22:44,613 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:22:44,653 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:22:44,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:22:44,654 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:22:44,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:22:49,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:22:49,977 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:22:49,977 INFO L139 ounterexampleChecker]: Examining path program with hash -910542105, occurence #1 [2024-11-21 11:22:49,977 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:22:49,977 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:22:49,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:22:49,978 INFO L85 PathProgramCache]: Analyzing trace with hash 908472831, now seen corresponding path program 1 times [2024-11-21 11:22:49,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:22:49,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194212226] [2024-11-21 11:22:49,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:22:49,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:22:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:22:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:22:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:22:50,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194212226] [2024-11-21 11:22:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194212226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:22:50,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:22:50,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:22:50,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30958325] [2024-11-21 11:22:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:22:50,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:22:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:22:50,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:22:50,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:22:50,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:22:50,026 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:22:50,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:22:50,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:04,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-11-21 11:23:04,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:23:04,433 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:23:04,433 INFO L139 ounterexampleChecker]: Examining path program with hash 386423677, occurence #1 [2024-11-21 11:23:04,433 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:23:04,433 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:23:04,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:23:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash 311197144, now seen corresponding path program 1 times [2024-11-21 11:23:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:23:04,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894398967] [2024-11-21 11:23:04,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:23:04,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:23:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:23:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:23:04,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:23:04,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894398967] [2024-11-21 11:23:04,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894398967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:23:04,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:23:04,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:23:04,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456162045] [2024-11-21 11:23:04,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:23:04,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:23:04,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:23:04,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:23:04,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:23:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:04,635 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:23:04,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:23:04,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:04,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:23:05,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-11-21 11:23:05,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:23:05,901 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:23:05,901 INFO L139 ounterexampleChecker]: Examining path program with hash 712224136, occurence #1 [2024-11-21 11:23:05,901 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:23:05,901 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:23:05,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:23:05,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1738926956, now seen corresponding path program 2 times [2024-11-21 11:23:05,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:23:05,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549242246] [2024-11-21 11:23:05,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:23:05,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:23:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:23:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:23:06,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:23:06,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549242246] [2024-11-21 11:23:06,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549242246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:23:06,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:23:06,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:23:06,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329390665] [2024-11-21 11:23:06,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:23:06,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:23:06,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:23:06,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:23:06,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:23:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:06,227 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:23:06,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.8) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:23:06,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:06,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:23:06,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:11,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:23:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:23:11,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-11-21 11:23:11,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:23:11,796 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:23:11,796 INFO L139 ounterexampleChecker]: Examining path program with hash 2025368983, occurence #1 [2024-11-21 11:23:11,796 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:23:11,796 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:23:11,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:23:11,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1128074654, now seen corresponding path program 1 times [2024-11-21 11:23:11,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:23:11,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670793801] [2024-11-21 11:23:11,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:23:11,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:23:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:23:11,839 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:23:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:23:11,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:23:11,915 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:23:11,915 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:23:11,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:23:11,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-11-21 11:23:11,918 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:23:11,919 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:23:11,919 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2024-11-21 11:23:11,979 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:23:11,983 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:23:12,026 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:23:12,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:23:12,027 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:23:12,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:23:17,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:23:17,598 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:23:17,599 INFO L139 ounterexampleChecker]: Examining path program with hash -1457524729, occurence #1 [2024-11-21 11:23:17,599 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:23:17,599 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:23:17,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:23:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1253438432, now seen corresponding path program 1 times [2024-11-21 11:23:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:23:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474179826] [2024-11-21 11:23:17,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:23:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:23:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:23:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:23:17,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:23:17,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474179826] [2024-11-21 11:23:17,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474179826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:23:17,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:23:17,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:23:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214208913] [2024-11-21 11:23:17,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:23:17,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:23:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:23:17,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:23:17,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:23:17,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:17,640 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:23:17,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:23:17,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:32,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-11-21 11:23:32,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:23:32,815 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:23:32,816 INFO L139 ounterexampleChecker]: Examining path program with hash -875725134, occurence #1 [2024-11-21 11:23:32,816 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:23:32,816 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:23:32,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:23:32,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2051742314, now seen corresponding path program 1 times [2024-11-21 11:23:32,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:23:32,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303946186] [2024-11-21 11:23:32,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:23:32,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:23:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:23:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:23:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:23:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303946186] [2024-11-21 11:23:33,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303946186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:23:33,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:23:33,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:23:33,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974209606] [2024-11-21 11:23:33,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:23:33,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:23:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:23:33,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:23:33,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:23:33,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:33,006 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:23:33,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:23:33,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:33,006 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:23:34,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-11-21 11:23:34,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:23:34,417 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:23:34,417 INFO L139 ounterexampleChecker]: Examining path program with hash -1344970737, occurence #1 [2024-11-21 11:23:34,418 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:23:34,418 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:23:34,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:23:34,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1202197292, now seen corresponding path program 2 times [2024-11-21 11:23:34,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:23:34,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638779557] [2024-11-21 11:23:34,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:23:34,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:23:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:23:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:23:34,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:23:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638779557] [2024-11-21 11:23:34,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638779557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:23:34,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:23:34,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:23:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421971439] [2024-11-21 11:23:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:23:34,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:23:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:23:34,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:23:34,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:23:34,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:34,772 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:23:34,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.4) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:23:34,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:34,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:23:34,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:23:40,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:23:40,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-11-21 11:23:40,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:23:40,650 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:23:40,650 INFO L139 ounterexampleChecker]: Examining path program with hash 510976996, occurence #1 [2024-11-21 11:23:40,650 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:23:40,650 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:23:40,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:23:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1558331699, now seen corresponding path program 1 times [2024-11-21 11:23:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:23:40,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111688427] [2024-11-21 11:23:40,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:23:40,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:23:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:23:40,695 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:23:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:23:40,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:23:40,771 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:23:40,771 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:23:40,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:23:40,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-11-21 11:23:40,773 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:23:40,774 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:23:40,774 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2024-11-21 11:23:40,832 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:23:40,835 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:23:40,874 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:23:40,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:23:40,875 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:23:40,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:23:47,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:23:47,096 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:23:47,096 INFO L139 ounterexampleChecker]: Examining path program with hash 2088084099, occurence #1 [2024-11-21 11:23:47,096 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:23:47,096 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:23:47,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:23:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash 266196284, now seen corresponding path program 1 times [2024-11-21 11:23:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:23:47,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69010732] [2024-11-21 11:23:47,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:23:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:23:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:23:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:23:47,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:23:47,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69010732] [2024-11-21 11:23:47,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69010732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:23:47,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:23:47,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:23:47,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744248616] [2024-11-21 11:23:47,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:23:47,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:23:47,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:23:47,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:23:47,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:23:47,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:23:47,133 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:23:47,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:23:47,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:03,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:03,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-11-21 11:24:03,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:24:03,662 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:24:03,662 INFO L139 ounterexampleChecker]: Examining path program with hash 54406124, occurence #1 [2024-11-21 11:24:03,662 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:24:03,662 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:24:03,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:24:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash 393635747, now seen corresponding path program 1 times [2024-11-21 11:24:03,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:24:03,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295726223] [2024-11-21 11:24:03,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:24:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:24:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:24:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:24:03,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:24:03,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295726223] [2024-11-21 11:24:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295726223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:24:03,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:24:03,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:24:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696389971] [2024-11-21 11:24:03,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:24:03,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:24:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:24:03,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:24:03,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:24:03,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:03,870 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:24:03,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:24:03,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:03,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:24:05,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-11-21 11:24:05,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:24:05,146 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:24:05,146 INFO L139 ounterexampleChecker]: Examining path program with hash 1499817728, occurence #1 [2024-11-21 11:24:05,146 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:24:05,146 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:24:05,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:24:05,147 INFO L85 PathProgramCache]: Analyzing trace with hash 605839619, now seen corresponding path program 2 times [2024-11-21 11:24:05,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:24:05,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253209269] [2024-11-21 11:24:05,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:24:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:24:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:24:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:24:05,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:24:05,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253209269] [2024-11-21 11:24:05,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253209269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:24:05,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:24:05,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:24:05,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30301789] [2024-11-21 11:24:05,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:24:05,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:24:05,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:24:05,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:24:05,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:24:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:05,463 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:24:05,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:24:05,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:05,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:24:05,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:24:12,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:24:12,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-11-21 11:24:12,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:24:12,378 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:24:12,378 INFO L139 ounterexampleChecker]: Examining path program with hash -960600797, occurence #1 [2024-11-21 11:24:12,378 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:24:12,378 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:24:12,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:24:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1935643838, now seen corresponding path program 1 times [2024-11-21 11:24:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:24:12,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23628757] [2024-11-21 11:24:12,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:24:12,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:24:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:24:12,424 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:24:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:24:12,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:24:12,504 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:24:12,504 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:24:12,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:24:12,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-11-21 11:24:12,506 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:24:12,507 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:24:12,507 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2024-11-21 11:24:12,568 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:24:12,572 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:24:12,619 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:24:12,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:24:12,620 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:24:12,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:24:19,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:24:19,178 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:24:19,178 INFO L139 ounterexampleChecker]: Examining path program with hash 1570805626, occurence #1 [2024-11-21 11:24:19,178 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:24:19,178 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:24:19,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:24:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1621686697, now seen corresponding path program 1 times [2024-11-21 11:24:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:24:19,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4139388] [2024-11-21 11:24:19,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:24:19,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:24:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:24:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:24:19,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:24:19,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4139388] [2024-11-21 11:24:19,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4139388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:24:19,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:24:19,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:24:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189908912] [2024-11-21 11:24:19,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:24:19,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:24:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:24:19,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:24:19,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:24:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:19,219 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:24:19,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:24:19,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:37,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-11-21 11:24:37,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:24:37,384 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:24:37,384 INFO L139 ounterexampleChecker]: Examining path program with hash 1636790354, occurence #1 [2024-11-21 11:24:37,384 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:24:37,384 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:24:37,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:24:37,385 INFO L85 PathProgramCache]: Analyzing trace with hash 18372425, now seen corresponding path program 1 times [2024-11-21 11:24:37,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:24:37,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618176775] [2024-11-21 11:24:37,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:24:37,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:24:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:24:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:24:37,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:24:37,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618176775] [2024-11-21 11:24:37,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618176775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:24:37,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:24:37,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:24:37,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312455791] [2024-11-21 11:24:37,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:24:37,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:24:37,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:24:37,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:24:37,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:24:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:37,768 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:24:37,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:24:37,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:37,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:39,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:24:39,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-11-21 11:24:39,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:24:39,801 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:24:39,802 INFO L139 ounterexampleChecker]: Examining path program with hash -829290022, occurence #1 [2024-11-21 11:24:39,802 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:24:39,802 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:24:39,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:24:39,802 INFO L85 PathProgramCache]: Analyzing trace with hash 306855013, now seen corresponding path program 2 times [2024-11-21 11:24:39,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:24:39,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756462718] [2024-11-21 11:24:39,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:24:39,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:24:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:24:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:24:40,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:24:40,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756462718] [2024-11-21 11:24:40,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756462718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:24:40,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:24:40,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:24:40,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953799045] [2024-11-21 11:24:40,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:24:40,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:24:40,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:24:40,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:24:40,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:24:40,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:40,135 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:24:40,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:24:40,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:40,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:24:40,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:24:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:24:47,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-11-21 11:24:47,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:24:47,358 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:24:47,358 INFO L139 ounterexampleChecker]: Examining path program with hash 1790956752, occurence #1 [2024-11-21 11:24:47,358 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:24:47,358 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:24:47,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:24:47,358 INFO L85 PathProgramCache]: Analyzing trace with hash -112519594, now seen corresponding path program 1 times [2024-11-21 11:24:47,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:24:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183424984] [2024-11-21 11:24:47,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:24:47,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:24:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:24:47,407 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:24:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:24:47,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:24:47,503 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:24:47,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:24:47,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:24:47,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-11-21 11:24:47,506 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:24:47,506 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:24:47,506 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2024-11-21 11:24:47,570 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:24:47,574 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:24:47,623 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:24:47,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:24:47,624 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:24:47,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:24:54,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:24:54,776 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:24:54,776 INFO L139 ounterexampleChecker]: Examining path program with hash -1977166443, occurence #1 [2024-11-21 11:24:54,777 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:24:54,777 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:24:54,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:24:54,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1354156307, now seen corresponding path program 1 times [2024-11-21 11:24:54,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:24:54,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601795730] [2024-11-21 11:24:54,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:24:54,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:24:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:24:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:24:54,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:24:54,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601795730] [2024-11-21 11:24:54,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601795730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:24:54,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:24:54,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:24:54,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692310544] [2024-11-21 11:24:54,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:24:54,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:24:54,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:24:54,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:24:54,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:24:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:24:54,819 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:24:54,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:24:54,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:13,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:13,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-11-21 11:25:13,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:25:13,893 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:25:13,894 INFO L139 ounterexampleChecker]: Examining path program with hash -889236159, occurence #1 [2024-11-21 11:25:13,894 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:25:13,894 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:25:13,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:25:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1898996283, now seen corresponding path program 1 times [2024-11-21 11:25:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:25:13,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138666815] [2024-11-21 11:25:13,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:25:13,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:25:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:25:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:25:14,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:25:14,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138666815] [2024-11-21 11:25:14,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138666815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:25:14,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:25:14,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:25:14,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180650475] [2024-11-21 11:25:14,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:25:14,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:25:14,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:25:14,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:25:14,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:25:14,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:14,111 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:25:14,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:25:14,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:14,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:15,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:25:15,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-11-21 11:25:15,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:25:15,360 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:25:15,360 INFO L139 ounterexampleChecker]: Examining path program with hash 813349985, occurence #1 [2024-11-21 11:25:15,360 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:25:15,360 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:25:15,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:25:15,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1207110007, now seen corresponding path program 2 times [2024-11-21 11:25:15,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:25:15,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425816384] [2024-11-21 11:25:15,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:25:15,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:25:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:25:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:25:15,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:25:15,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425816384] [2024-11-21 11:25:15,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425816384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:25:15,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:25:15,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:25:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335745181] [2024-11-21 11:25:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:25:15,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:25:15,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:25:15,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:25:15,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:25:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:15,710 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:25:15,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:25:15,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:15,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:25:15,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:25:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:25:23,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-11-21 11:25:23,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:25:23,279 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:25:23,279 INFO L139 ounterexampleChecker]: Examining path program with hash -155343748, occurence #1 [2024-11-21 11:25:23,279 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:25:23,279 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:25:23,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:25:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash 515942750, now seen corresponding path program 1 times [2024-11-21 11:25:23,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:25:23,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920357744] [2024-11-21 11:25:23,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:25:23,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:25:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:25:23,325 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:25:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:25:23,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:25:23,420 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:25:23,420 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:25:23,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:25:23,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-11-21 11:25:23,423 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:25:23,423 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:25:23,423 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2024-11-21 11:25:23,493 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:25:23,498 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:25:23,548 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:25:23,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:25:23,548 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:25:23,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:25:31,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:25:31,549 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:25:31,549 INFO L139 ounterexampleChecker]: Examining path program with hash 1302131949, occurence #1 [2024-11-21 11:25:31,549 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:25:31,549 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:25:31,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:25:31,549 INFO L85 PathProgramCache]: Analyzing trace with hash -693971528, now seen corresponding path program 1 times [2024-11-21 11:25:31,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:25:31,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967289516] [2024-11-21 11:25:31,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:25:31,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:25:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:25:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:25:31,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:25:31,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967289516] [2024-11-21 11:25:31,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967289516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:25:31,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:25:31,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:25:31,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104178876] [2024-11-21 11:25:31,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:25:31,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:25:31,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:25:31,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:25:31,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:25:31,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:31,595 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:25:31,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:25:31,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:52,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-11-21 11:25:52,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:25:52,227 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:25:52,227 INFO L139 ounterexampleChecker]: Examining path program with hash -269531144, occurence #1 [2024-11-21 11:25:52,227 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:25:52,227 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:25:52,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:25:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1213068612, now seen corresponding path program 1 times [2024-11-21 11:25:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:25:52,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702128777] [2024-11-21 11:25:52,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:25:52,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:25:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:25:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:25:52,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:25:52,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702128777] [2024-11-21 11:25:52,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702128777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:25:52,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:25:52,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:25:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115743228] [2024-11-21 11:25:52,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:25:52,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:25:52,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:25:52,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:25:52,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:25:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:52,464 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:25:52,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:25:52,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:52,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:53,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:53,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:25:53,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-11-21 11:25:53,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:25:53,956 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:25:53,956 INFO L139 ounterexampleChecker]: Examining path program with hash -1590438675, occurence #1 [2024-11-21 11:25:53,956 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:25:53,956 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:25:53,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:25:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1080731616, now seen corresponding path program 2 times [2024-11-21 11:25:53,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:25:53,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099792292] [2024-11-21 11:25:53,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:25:53,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:25:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:25:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:25:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:25:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099792292] [2024-11-21 11:25:54,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099792292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:25:54,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:25:54,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:25:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615290078] [2024-11-21 11:25:54,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:25:54,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:25:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:25:54,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:25:54,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:25:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:54,326 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:25:54,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:25:54,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:25:54,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:25:54,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:26:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:26:03,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-11-21 11:26:03,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:26:03,073 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:26:03,074 INFO L139 ounterexampleChecker]: Examining path program with hash -33809541, occurence #1 [2024-11-21 11:26:03,074 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:26:03,074 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:26:03,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:26:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1368014978, now seen corresponding path program 1 times [2024-11-21 11:26:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:26:03,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393731663] [2024-11-21 11:26:03,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:26:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:26:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:26:03,124 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:26:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:26:03,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:26:03,232 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:26:03,232 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:26:03,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:26:03,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-11-21 11:26:03,234 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:26:03,235 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:26:03,235 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2024-11-21 11:26:03,303 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:26:03,307 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:26:03,369 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:26:03,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:26:03,370 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:26:03,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:26:12,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:26:12,011 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:26:12,012 INFO L139 ounterexampleChecker]: Examining path program with hash 241144902, occurence #1 [2024-11-21 11:26:12,012 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:26:12,012 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:26:12,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:26:12,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1020623654, now seen corresponding path program 1 times [2024-11-21 11:26:12,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:26:12,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395831057] [2024-11-21 11:26:12,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:26:12,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:26:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:26:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:26:12,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:26:12,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395831057] [2024-11-21 11:26:12,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395831057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:26:12,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:26:12,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:26:12,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231632823] [2024-11-21 11:26:12,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:26:12,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:26:12,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:26:12,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:26:12,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:26:12,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:12,061 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:26:12,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:26:12,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:34,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-11-21 11:26:34,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:26:34,247 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:26:34,247 INFO L139 ounterexampleChecker]: Examining path program with hash -431420469, occurence #1 [2024-11-21 11:26:34,247 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:26:34,247 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:26:34,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:26:34,247 INFO L85 PathProgramCache]: Analyzing trace with hash 282216652, now seen corresponding path program 1 times [2024-11-21 11:26:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:26:34,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69565656] [2024-11-21 11:26:34,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:26:34,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:26:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:26:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:26:34,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:26:34,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69565656] [2024-11-21 11:26:34,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69565656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:26:34,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:26:34,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:26:34,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550766337] [2024-11-21 11:26:34,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:26:34,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:26:34,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:26:34,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:26:34,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:26:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:34,658 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:26:34,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:26:34,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:34,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:36,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:36,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:26:36,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-11-21 11:26:36,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:26:36,001 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:26:36,001 INFO L139 ounterexampleChecker]: Examining path program with hash -586985329, occurence #1 [2024-11-21 11:26:36,002 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:26:36,002 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:26:36,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:26:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1699827404, now seen corresponding path program 2 times [2024-11-21 11:26:36,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:26:36,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383002138] [2024-11-21 11:26:36,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:26:36,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:26:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:26:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:26:36,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:26:36,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383002138] [2024-11-21 11:26:36,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383002138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:26:36,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:26:36,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:26:36,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134757240] [2024-11-21 11:26:36,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:26:36,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:26:36,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:26:36,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:26:36,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:26:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:36,388 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:26:36,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:26:36,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:36,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:26:36,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:26:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:26:45,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-11-21 11:26:45,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:26:45,756 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:26:45,757 INFO L139 ounterexampleChecker]: Examining path program with hash 579183487, occurence #1 [2024-11-21 11:26:45,757 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:26:45,757 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:26:45,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:26:45,757 INFO L85 PathProgramCache]: Analyzing trace with hash 430066068, now seen corresponding path program 1 times [2024-11-21 11:26:45,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:26:45,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085270786] [2024-11-21 11:26:45,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:26:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:26:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:26:45,808 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:26:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:26:45,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:26:45,917 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:26:45,917 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:26:45,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:26:45,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-11-21 11:26:45,920 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:26:45,920 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:26:45,920 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2024-11-21 11:26:45,985 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:26:45,989 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:26:46,047 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:26:46,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:26:46,048 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:26:46,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:26:55,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:26:55,090 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:26:55,090 INFO L139 ounterexampleChecker]: Examining path program with hash -972760883, occurence #1 [2024-11-21 11:26:55,090 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:26:55,090 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:26:55,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:26:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash -20809777, now seen corresponding path program 1 times [2024-11-21 11:26:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:26:55,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767316621] [2024-11-21 11:26:55,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:26:55,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:26:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:26:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:26:55,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:26:55,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767316621] [2024-11-21 11:26:55,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767316621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:26:55,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:26:55,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:26:55,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624291385] [2024-11-21 11:26:55,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:26:55,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:26:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:26:55,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:26:55,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:26:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:26:55,141 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:26:55,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 101.0) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:26:55,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:27:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:27:19,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-11-21 11:27:19,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:27:19,710 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:27:19,711 INFO L139 ounterexampleChecker]: Examining path program with hash 1008451144, occurence #1 [2024-11-21 11:27:19,711 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:27:19,711 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:27:19,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:27:19,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1117130073, now seen corresponding path program 1 times [2024-11-21 11:27:19,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:27:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333232966] [2024-11-21 11:27:19,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:27:19,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:27:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:27:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:27:19,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:27:19,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333232966] [2024-11-21 11:27:19,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333232966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:27:19,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:27:19,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:27:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513224665] [2024-11-21 11:27:19,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:27:19,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:27:19,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:27:19,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:27:19,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:27:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:27:19,960 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:27:19,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:27:19,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:27:19,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:27:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:27:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:27:21,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-11-21 11:27:21,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:27:21,403 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:27:21,404 INFO L139 ounterexampleChecker]: Examining path program with hash -1247896885, occurence #1 [2024-11-21 11:27:21,404 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:27:21,404 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:27:21,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:27:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2053666847, now seen corresponding path program 2 times [2024-11-21 11:27:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:27:21,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091762093] [2024-11-21 11:27:21,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:27:21,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:27:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:27:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:27:21,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:27:21,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091762093] [2024-11-21 11:27:21,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091762093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:27:21,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:27:21,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:27:21,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923133502] [2024-11-21 11:27:21,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:27:21,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:27:21,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:27:21,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:27:21,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:27:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:27:21,851 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:27:21,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:27:21,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:27:21,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:27:21,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:27:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:27:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:27:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:27:31,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-11-21 11:27:31,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:27:31,837 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:27:31,838 INFO L139 ounterexampleChecker]: Examining path program with hash 1114973524, occurence #1 [2024-11-21 11:27:31,838 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:27:31,838 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:27:31,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:27:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash 147031460, now seen corresponding path program 1 times [2024-11-21 11:27:31,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:27:31,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725796325] [2024-11-21 11:27:31,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:27:31,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:27:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:27:31,899 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:27:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:27:31,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:27:31,991 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:27:31,991 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:27:31,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:27:31,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-11-21 11:27:31,993 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:27:31,993 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:27:31,993 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2024-11-21 11:27:32,051 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:27:32,055 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:27:32,106 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:27:32,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:27:32,106 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:27:32,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:27:41,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:27:41,777 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:27:41,777 INFO L139 ounterexampleChecker]: Examining path program with hash 390280638, occurence #1 [2024-11-21 11:27:41,777 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:27:41,777 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:27:41,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:27:41,777 INFO L85 PathProgramCache]: Analyzing trace with hash 7122799, now seen corresponding path program 1 times [2024-11-21 11:27:41,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:27:41,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45519225] [2024-11-21 11:27:41,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:27:41,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:27:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:27:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:27:41,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:27:41,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45519225] [2024-11-21 11:27:41,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45519225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:27:41,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:27:41,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:27:41,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233134061] [2024-11-21 11:27:41,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:27:41,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:27:41,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:27:41,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:27:41,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:27:41,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:27:41,827 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:27:41,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:27:41,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:07,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:07,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-11-21 11:28:07,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:28:07,650 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:28:07,651 INFO L139 ounterexampleChecker]: Examining path program with hash -1003726812, occurence #1 [2024-11-21 11:28:07,651 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:28:07,651 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:28:07,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:28:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1253325087, now seen corresponding path program 1 times [2024-11-21 11:28:07,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:28:07,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360985718] [2024-11-21 11:28:07,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:28:07,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:28:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:28:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:28:08,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:28:08,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360985718] [2024-11-21 11:28:08,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360985718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:28:08,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:28:08,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:28:08,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622427644] [2024-11-21 11:28:08,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:28:08,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:28:08,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:28:08,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:28:08,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:28:08,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:08,093 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:28:08,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:28:08,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:08,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:28:09,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-11-21 11:28:09,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:28:09,507 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:28:09,507 INFO L139 ounterexampleChecker]: Examining path program with hash 1110827692, occurence #1 [2024-11-21 11:28:09,507 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:28:09,507 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:28:09,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:28:09,508 INFO L85 PathProgramCache]: Analyzing trace with hash -828121967, now seen corresponding path program 2 times [2024-11-21 11:28:09,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:28:09,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195268014] [2024-11-21 11:28:09,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:28:09,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:28:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:28:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:28:10,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:28:10,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195268014] [2024-11-21 11:28:10,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195268014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:28:10,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:28:10,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:28:10,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626073069] [2024-11-21 11:28:10,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:28:10,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:28:10,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:28:10,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:28:10,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:28:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:10,115 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:28:10,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:28:10,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:10,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:28:10,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:28:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:28:20,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-11-21 11:28:20,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:28:20,839 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:28:20,839 INFO L139 ounterexampleChecker]: Examining path program with hash -542741910, occurence #1 [2024-11-21 11:28:20,839 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:28:20,839 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:28:20,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:28:20,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1713594556, now seen corresponding path program 1 times [2024-11-21 11:28:20,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:28:20,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357095953] [2024-11-21 11:28:20,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:28:20,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:28:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:28:20,894 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:28:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:28:21,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:28:21,006 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:28:21,006 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:28:21,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:28:21,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-11-21 11:28:21,008 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:28:21,008 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:28:21,008 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2024-11-21 11:28:21,083 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:28:21,087 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:28:21,138 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:28:21,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:28:21,139 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:28:21,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:28:31,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:28:31,527 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:28:31,528 INFO L139 ounterexampleChecker]: Examining path program with hash -636391623, occurence #1 [2024-11-21 11:28:31,528 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:28:31,528 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:28:31,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:28:31,528 INFO L85 PathProgramCache]: Analyzing trace with hash 12611270, now seen corresponding path program 1 times [2024-11-21 11:28:31,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:28:31,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245075841] [2024-11-21 11:28:31,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:28:31,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:28:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:28:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:28:31,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:28:31,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245075841] [2024-11-21 11:28:31,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245075841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:28:31,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:28:31,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:28:31,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298041794] [2024-11-21 11:28:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:28:31,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:28:31,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:28:31,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:28:31,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:28:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:31,581 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:28:31,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:28:31,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:59,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-11-21 11:28:59,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:28:59,154 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:28:59,155 INFO L139 ounterexampleChecker]: Examining path program with hash 227188454, occurence #1 [2024-11-21 11:28:59,155 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:28:59,155 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:28:59,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:28:59,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1588739651, now seen corresponding path program 1 times [2024-11-21 11:28:59,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:28:59,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548253741] [2024-11-21 11:28:59,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:28:59,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:28:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:28:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:28:59,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:28:59,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548253741] [2024-11-21 11:28:59,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548253741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:28:59,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:28:59,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:28:59,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184750707] [2024-11-21 11:28:59,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:28:59,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:28:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:28:59,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:28:59,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:28:59,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:59,441 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:28:59,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:28:59,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:28:59,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:00,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:29:00,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-11-21 11:29:00,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:29:00,869 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:29:00,870 INFO L139 ounterexampleChecker]: Examining path program with hash -325483609, occurence #1 [2024-11-21 11:29:00,870 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:29:00,870 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:29:00,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:29:00,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1633347379, now seen corresponding path program 2 times [2024-11-21 11:29:00,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:29:00,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042635000] [2024-11-21 11:29:00,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:29:00,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:29:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:29:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:29:01,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:29:01,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042635000] [2024-11-21 11:29:01,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042635000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:29:01,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:29:01,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:29:01,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488527161] [2024-11-21 11:29:01,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:29:01,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:29:01,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:29:01,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:29:01,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:29:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:01,395 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:29:01,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:29:01,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:01,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:29:01,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:12,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:12,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:29:12,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:29:12,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-11-21 11:29:12,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:29:12,883 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:29:12,883 INFO L139 ounterexampleChecker]: Examining path program with hash -1729042269, occurence #1 [2024-11-21 11:29:12,883 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:29:12,883 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:29:12,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:29:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash -370826506, now seen corresponding path program 1 times [2024-11-21 11:29:12,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:29:12,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689966558] [2024-11-21 11:29:12,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:29:12,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:29:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:29:12,948 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:29:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:29:13,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:29:13,251 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:29:13,251 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:29:13,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:29:13,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-11-21 11:29:13,254 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:29:13,254 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:29:13,254 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2024-11-21 11:29:13,316 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:29:13,320 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:29:13,379 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:29:13,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:29:13,379 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:29:13,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:29:25,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:29:25,121 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:29:25,121 INFO L139 ounterexampleChecker]: Examining path program with hash 1418716951, occurence #1 [2024-11-21 11:29:25,121 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:29:25,121 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:29:25,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:29:25,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1473640128, now seen corresponding path program 1 times [2024-11-21 11:29:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:29:25,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734647725] [2024-11-21 11:29:25,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:29:25,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:29:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:29:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:29:25,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:29:25,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734647725] [2024-11-21 11:29:25,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734647725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:29:25,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:29:25,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:29:25,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015800331] [2024-11-21 11:29:25,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:29:25,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:29:25,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:29:25,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:29:25,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:29:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:25,201 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:29:25,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:29:25,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:54,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-11-21 11:29:54,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:29:54,266 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:29:54,266 INFO L139 ounterexampleChecker]: Examining path program with hash 1419455516, occurence #1 [2024-11-21 11:29:54,266 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:29:54,266 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:29:54,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:29:54,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1117673116, now seen corresponding path program 1 times [2024-11-21 11:29:54,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:29:54,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882014012] [2024-11-21 11:29:54,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:29:54,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:29:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:29:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:29:54,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:29:54,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882014012] [2024-11-21 11:29:54,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882014012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:29:54,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:29:54,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:29:54,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496007447] [2024-11-21 11:29:54,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:29:54,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:29:54,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:29:54,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:29:54,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:29:54,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:54,554 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:29:54,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:29:54,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:54,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:29:56,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-11-21 11:29:56,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:29:56,217 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:29:56,217 INFO L139 ounterexampleChecker]: Examining path program with hash 932146867, occurence #1 [2024-11-21 11:29:56,217 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:29:56,217 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:29:56,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:29:56,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1272731622, now seen corresponding path program 2 times [2024-11-21 11:29:56,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:29:56,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903539776] [2024-11-21 11:29:56,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:29:56,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:29:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:29:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:29:56,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:29:56,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903539776] [2024-11-21 11:29:56,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903539776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:29:56,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:29:56,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:29:56,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418145217] [2024-11-21 11:29:56,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:29:56,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:29:56,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:29:56,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:29:56,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:29:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:56,659 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:29:56,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:29:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:29:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:29:56,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:30:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:30:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:30:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:30:08,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-11-21 11:30:08,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:30:08,720 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:30:08,720 INFO L139 ounterexampleChecker]: Examining path program with hash -1358558788, occurence #1 [2024-11-21 11:30:08,720 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:30:08,720 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:30:08,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:30:08,720 INFO L85 PathProgramCache]: Analyzing trace with hash 497996286, now seen corresponding path program 1 times [2024-11-21 11:30:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:30:08,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267142872] [2024-11-21 11:30:08,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:30:08,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:30:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:30:08,784 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:30:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:30:08,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:30:08,897 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:30:08,897 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:30:08,897 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:30:08,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-11-21 11:30:08,899 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:30:08,899 WARN L246 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:30:08,899 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2024-11-21 11:30:08,971 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:30:08,974 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:30:09,026 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:30:09,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:30:09,027 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:30:09,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:30:20,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:30:20,846 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:30:20,846 INFO L139 ounterexampleChecker]: Examining path program with hash 523157801, occurence #1 [2024-11-21 11:30:20,846 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:30:20,846 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:30:20,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:30:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1285511199, now seen corresponding path program 1 times [2024-11-21 11:30:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:30:20,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270746926] [2024-11-21 11:30:20,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:30:20,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:30:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:30:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:30:20,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:30:20,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270746926] [2024-11-21 11:30:20,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270746926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:30:20,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:30:20,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:30:20,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295692923] [2024-11-21 11:30:20,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:30:20,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:30:20,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:30:20,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:30:20,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:30:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:30:20,903 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:30:20,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:30:20,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:30:51,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:30:51,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-11-21 11:30:51,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:30:51,893 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:30:51,893 INFO L139 ounterexampleChecker]: Examining path program with hash -1704368070, occurence #1 [2024-11-21 11:30:51,893 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:30:51,893 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:30:51,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:30:51,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1379882779, now seen corresponding path program 1 times [2024-11-21 11:30:51,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:30:51,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215528752] [2024-11-21 11:30:51,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:30:51,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:30:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:30:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:30:52,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:30:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215528752] [2024-11-21 11:30:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215528752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:30:52,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:30:52,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:30:52,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869157533] [2024-11-21 11:30:52,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:30:52,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:30:52,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:30:52,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:30:52,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:30:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:30:52,192 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:30:52,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:30:52,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:30:52,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:30:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:30:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:30:53,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-11-21 11:30:53,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:30:53,644 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:30:53,645 INFO L139 ounterexampleChecker]: Examining path program with hash -991629792, occurence #1 [2024-11-21 11:30:53,645 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:30:53,645 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:30:53,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:30:53,645 INFO L85 PathProgramCache]: Analyzing trace with hash 98759345, now seen corresponding path program 2 times [2024-11-21 11:30:53,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:30:53,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188852950] [2024-11-21 11:30:53,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:30:53,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:30:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:30:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:30:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:30:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188852950] [2024-11-21 11:30:54,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188852950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:30:54,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:30:54,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:30:54,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820458863] [2024-11-21 11:30:54,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:30:54,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:30:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:30:54,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:30:54,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:30:54,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:30:54,120 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:30:54,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:30:54,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:30:54,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:30:54,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:31:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:31:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:31:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 11:31:07,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-11-21 11:31:07,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:31:07,092 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:31:07,093 INFO L139 ounterexampleChecker]: Examining path program with hash 1223561320, occurence #1 [2024-11-21 11:31:07,093 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:31:07,093 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:31:07,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:31:07,093 INFO L85 PathProgramCache]: Analyzing trace with hash 869078508, now seen corresponding path program 1 times [2024-11-21 11:31:07,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:31:07,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130508379] [2024-11-21 11:31:07,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:31:07,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:31:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:31:07,165 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 11:31:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 11:31:07,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 11:31:07,275 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 11:31:07,275 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-11-21 11:31:07,275 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 11:31:07,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-11-21 11:31:07,277 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2024-11-21 11:31:07,278 WARN L246 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 11:31:07,278 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2024-11-21 11:31:07,341 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 11:31:07,344 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:31:07,397 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 11:31:07,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 11:31:07,398 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e75c28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 11:31:07,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 11:31:19,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:31:19,781 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:31:19,782 INFO L139 ounterexampleChecker]: Examining path program with hash 149822602, occurence #1 [2024-11-21 11:31:19,782 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:31:19,782 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:31:19,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:31:19,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1336883535, now seen corresponding path program 1 times [2024-11-21 11:31:19,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:31:19,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889396575] [2024-11-21 11:31:19,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:31:19,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:31:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:31:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:31:19,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:31:19,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889396575] [2024-11-21 11:31:19,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889396575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:31:19,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:31:19,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 11:31:19,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072019065] [2024-11-21 11:31:19,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:31:19,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 11:31:19,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:31:19,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 11:31:19,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 11:31:19,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:31:19,844 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:31:19,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:31:19,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:31:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:31:53,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-11-21 11:31:53,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:31:53,615 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:31:53,615 INFO L139 ounterexampleChecker]: Examining path program with hash 1286398226, occurence #1 [2024-11-21 11:31:53,615 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:31:53,615 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:31:53,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:31:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1866585592, now seen corresponding path program 1 times [2024-11-21 11:31:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:31:53,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671433282] [2024-11-21 11:31:53,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:31:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:31:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:31:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:31:54,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:31:54,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671433282] [2024-11-21 11:31:54,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671433282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:31:54,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:31:54,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 11:31:54,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815910960] [2024-11-21 11:31:54,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:31:54,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 11:31:54,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:31:54,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 11:31:54,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 11:31:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:31:54,048 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:31:54,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:31:54,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:31:54,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:31:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:31:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:31:55,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-11-21 11:31:55,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-21 11:31:55,505 INFO L303 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-11-21 11:31:55,506 INFO L139 ounterexampleChecker]: Examining path program with hash -1348881330, occurence #1 [2024-11-21 11:31:55,506 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-11-21 11:31:55,506 INFO L314 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-11-21 11:31:55,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 11:31:55,506 INFO L85 PathProgramCache]: Analyzing trace with hash 867847602, now seen corresponding path program 2 times [2024-11-21 11:31:55,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 11:31:55,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647689932] [2024-11-21 11:31:55,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 11:31:55,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 11:31:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 11:31:56,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 11:31:56,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 11:31:56,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647689932] [2024-11-21 11:31:56,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647689932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 11:31:56,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 11:31:56,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 11:31:56,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754344629] [2024-11-21 11:31:56,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 11:31:56,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 11:31:56,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 11:31:56,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 11:31:56,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 11:31:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:31:56,108 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 11:31:56,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 11:31:56,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 11:31:56,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 11:31:56,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15