./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_06-cond_racing1.i --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 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 ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_06-cond_racing1.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 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-24 00:21:44,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-24 00:21:44,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-24 00:21:44,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-24 00:21:44,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-24 00:21:44,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-24 00:21:44,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-24 00:21:44,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-24 00:21:44,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-24 00:21:44,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-24 00:21:44,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-24 00:21:44,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-24 00:21:44,934 INFO L153 SettingsManager]: * Use SBE=true [2025-01-24 00:21:44,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-24 00:21:44,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-24 00:21:44,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-24 00:21:44,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-24 00:21:44,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-24 00:21:44,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-24 00:21:44,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-24 00:21:44,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-24 00:21:44,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-24 00:21:44,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-24 00:21:44,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-24 00:21:44,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-24 00:21:44,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-24 00:21:44,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-24 00:21:44,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 00:21:44,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-24 00:21:44,936 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-24 00:21:44,936 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 -> 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2025-01-24 00:21:45,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-24 00:21:45,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-24 00:21:45,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-24 00:21:45,190 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-24 00:21:45,190 INFO L274 PluginConnector]: CDTParser initialized [2025-01-24 00:21:45,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_06-cond_racing1.i [2025-01-24 00:21:46,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/5866ec7e1/9648e5f82b97484c889a1bf0a5370314/FLAG125a86da0 [2025-01-24 00:21:46,476 INFO L384 CDTParser]: Found 1 translation units. [2025-01-24 00:21:46,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_06-cond_racing1.i [2025-01-24 00:21:46,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/5866ec7e1/9648e5f82b97484c889a1bf0a5370314/FLAG125a86da0 [2025-01-24 00:21:46,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/5866ec7e1/9648e5f82b97484c889a1bf0a5370314 [2025-01-24 00:21:46,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-24 00:21:46,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-24 00:21:46,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-24 00:21:46,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-24 00:21:46,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-24 00:21:46,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:21:46" (1/1) ... [2025-01-24 00:21:46,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c12005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:46, skipping insertion in model container [2025-01-24 00:21:46,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:21:46" (1/1) ... [2025-01-24 00:21:46,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-24 00:21:47,098 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_06-cond_racing1.i[41322,41335] [2025-01-24 00:21:47,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 00:21:47,122 INFO L200 MainTranslator]: Completed pre-run [2025-01-24 00:21:47,185 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/goblint-regression/28-race_reach_06-cond_racing1.i[41322,41335] [2025-01-24 00:21:47,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-24 00:21:47,251 INFO L204 MainTranslator]: Completed translation [2025-01-24 00:21:47,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47 WrapperNode [2025-01-24 00:21:47,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-24 00:21:47,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-24 00:21:47,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-24 00:21:47,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-24 00:21:47,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (1/1) ... [2025-01-24 00:21:47,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (1/1) ... [2025-01-24 00:21:47,286 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-01-24 00:21:47,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-24 00:21:47,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-24 00:21:47,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-24 00:21:47,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-24 00:21:47,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (1/1) ... [2025-01-24 00:21:47,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (1/1) ... [2025-01-24 00:21:47,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (1/1) ... [2025-01-24 00:21:47,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (1/1) ... [2025-01-24 00:21:47,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (1/1) ... [2025-01-24 00:21:47,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (1/1) ... [2025-01-24 00:21:47,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (1/1) ... [2025-01-24 00:21:47,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (1/1) ... [2025-01-24 00:21:47,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (1/1) ... [2025-01-24 00:21:47,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-24 00:21:47,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-24 00:21:47,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-24 00:21:47,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-24 00:21:47,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (1/1) ... [2025-01-24 00:21:47,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-24 00:21:47,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 00:21:47,341 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) [2025-01-24 00:21:47,343 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 [2025-01-24 00:21:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-24 00:21:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-24 00:21:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-24 00:21:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-24 00:21:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-24 00:21:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-24 00:21:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-24 00:21:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-24 00:21:47,359 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-24 00:21:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-24 00:21:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-24 00:21:47,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-24 00:21:47,360 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-24 00:21:47,454 INFO L234 CfgBuilder]: Building ICFG [2025-01-24 00:21:47,456 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-24 00:21:47,606 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-24 00:21:47,606 INFO L283 CfgBuilder]: Performing block encoding [2025-01-24 00:21:47,696 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-24 00:21:47,697 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-24 00:21:47,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:21:47 BoogieIcfgContainer [2025-01-24 00:21:47,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-24 00:21:47,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-24 00:21:47,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-24 00:21:47,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-24 00:21:47,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:21:46" (1/3) ... [2025-01-24 00:21:47,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288d3a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:21:47, skipping insertion in model container [2025-01-24 00:21:47,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:47" (2/3) ... [2025-01-24 00:21:47,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288d3a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:21:47, skipping insertion in model container [2025-01-24 00:21:47,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:21:47" (3/3) ... [2025-01-24 00:21:47,705 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_06-cond_racing1.i [2025-01-24 00:21:47,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-24 00:21:47,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_06-cond_racing1.i that has 2 procedures, 43 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-24 00:21:47,715 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-24 00:21:47,742 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-24 00:21:47,770 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:47,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-24 00:21:47,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-24 00:21:47,772 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) [2025-01-24 00:21:47,773 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 [2025-01-24 00:21:47,835 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:21:47,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:21:47,853 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:47,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:21:47,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:47,967 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:47,967 INFO L139 ounterexampleChecker]: Examining path program with hash -1165970183, occurence #1 [2025-01-24 00:21:47,967 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:47,967 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:47,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:47,971 INFO L85 PathProgramCache]: Analyzing trace with hash -428894221, now seen corresponding path program 1 times [2025-01-24 00:21:47,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:47,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765064943] [2025-01-24 00:21:47,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:47,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:48,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-24 00:21:48,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-24 00:21:48,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:48,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:48,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:48,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765064943] [2025-01-24 00:21:48,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765064943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:48,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:48,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:21:48,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737335937] [2025-01-24 00:21:48,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:48,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:21:48,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:48,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:21:48,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:21:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:48,124 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:48,125 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) [2025-01-24 00:21:48,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:48,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:48,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-24 00:21:48,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:48,192 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:48,192 INFO L139 ounterexampleChecker]: Examining path program with hash 663607228, occurence #1 [2025-01-24 00:21:48,192 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:48,192 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:48,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:48,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1233964943, now seen corresponding path program 1 times [2025-01-24 00:21:48,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:48,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959320384] [2025-01-24 00:21:48,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:48,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:48,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-24 00:21:48,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-24 00:21:48,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:48,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:21:48,233 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:21:48,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-24 00:21:48,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-24 00:21:48,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:48,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:21:48,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:21:48,274 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:21:48,275 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:21:48,276 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:21:48,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-24 00:21:48,282 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-24 00:21:48,283 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:21:48,283 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-24 00:21:48,298 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-24 00:21:48,304 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:48,310 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:21:48,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:21:48,311 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:48,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:21:48,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:48,496 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:48,496 INFO L139 ounterexampleChecker]: Examining path program with hash 610620342, occurence #1 [2025-01-24 00:21:48,496 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:48,496 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:48,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:48,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1677193316, now seen corresponding path program 1 times [2025-01-24 00:21:48,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:48,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599442306] [2025-01-24 00:21:48,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:48,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:48,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-24 00:21:48,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-24 00:21:48,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:48,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:48,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:48,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599442306] [2025-01-24 00:21:48,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599442306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:48,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:48,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:21:48,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361839201] [2025-01-24 00:21:48,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:48,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:21:48,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:48,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:21:48,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:21:48,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:48,549 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:48,549 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) [2025-01-24 00:21:48,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:48,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-24 00:21:48,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:48,819 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:48,819 INFO L139 ounterexampleChecker]: Examining path program with hash -1831521482, occurence #1 [2025-01-24 00:21:48,819 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:48,819 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:48,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:48,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1894801174, now seen corresponding path program 1 times [2025-01-24 00:21:48,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:48,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440386091] [2025-01-24 00:21:48,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:48,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:48,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-24 00:21:48,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-24 00:21:48,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:48,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:48,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:48,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440386091] [2025-01-24 00:21:48,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440386091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:48,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:48,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:21:48,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652809734] [2025-01-24 00:21:48,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:48,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:21:48,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:48,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:21:48,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:21:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:48,939 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:48,939 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) [2025-01-24 00:21:48,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:48,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:49,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-24 00:21:49,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:49,036 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:49,036 INFO L139 ounterexampleChecker]: Examining path program with hash -927677922, occurence #1 [2025-01-24 00:21:49,036 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:49,036 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:49,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 994183279, now seen corresponding path program 1 times [2025-01-24 00:21:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:49,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429367792] [2025-01-24 00:21:49,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:49,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-24 00:21:49,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-24 00:21:49,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:49,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:49,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:49,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429367792] [2025-01-24 00:21:49,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429367792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:49,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:49,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-24 00:21:49,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256397503] [2025-01-24 00:21:49,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:49,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-24 00:21:49,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:49,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-24 00:21:49,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-24 00:21:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:49,207 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:49,207 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) [2025-01-24 00:21:49,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:49,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:49,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:21:49,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-24 00:21:49,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:49,272 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:49,272 INFO L139 ounterexampleChecker]: Examining path program with hash -712165706, occurence #1 [2025-01-24 00:21:49,272 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:49,272 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:49,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:49,272 INFO L85 PathProgramCache]: Analyzing trace with hash 917232622, now seen corresponding path program 1 times [2025-01-24 00:21:49,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:49,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905316463] [2025-01-24 00:21:49,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:49,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:49,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-24 00:21:49,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-24 00:21:49,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:49,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:21:49,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:21:49,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-24 00:21:49,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-24 00:21:49,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:49,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:21:49,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:21:49,309 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:21:49,309 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:21:49,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:21:49,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-24 00:21:49,310 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:21:49,310 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:21:49,310 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-24 00:21:49,322 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-24 00:21:49,325 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:49,331 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:21:49,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:21:49,332 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:49,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:21:49,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:49,600 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:49,601 INFO L139 ounterexampleChecker]: Examining path program with hash -1439197423, occurence #1 [2025-01-24 00:21:49,601 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:49,601 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:49,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2043634724, now seen corresponding path program 1 times [2025-01-24 00:21:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:49,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605009151] [2025-01-24 00:21:49,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:49,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-24 00:21:49,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-24 00:21:49,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:49,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:49,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:49,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605009151] [2025-01-24 00:21:49,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605009151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:49,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:49,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:21:49,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110011959] [2025-01-24 00:21:49,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:49,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:21:49,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:49,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:21:49,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:21:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:49,634 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:49,634 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) [2025-01-24 00:21:49,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:50,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-24 00:21:50,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:50,212 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:50,212 INFO L139 ounterexampleChecker]: Examining path program with hash 1558743612, occurence #1 [2025-01-24 00:21:50,212 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:50,212 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:50,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1567603608, now seen corresponding path program 1 times [2025-01-24 00:21:50,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:50,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185100402] [2025-01-24 00:21:50,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:50,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:50,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-24 00:21:50,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-24 00:21:50,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:50,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:50,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:50,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185100402] [2025-01-24 00:21:50,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185100402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:50,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:50,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:21:50,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718783111] [2025-01-24 00:21:50,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:50,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:21:50,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:50,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:21:50,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:21:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:50,301 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:50,301 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) [2025-01-24 00:21:50,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:50,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:50,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:50,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:50,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-24 00:21:50,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:50,422 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:50,422 INFO L139 ounterexampleChecker]: Examining path program with hash 1629927974, occurence #1 [2025-01-24 00:21:50,422 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:50,422 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:50,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1010270613, now seen corresponding path program 1 times [2025-01-24 00:21:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:50,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511964739] [2025-01-24 00:21:50,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:50,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-24 00:21:50,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-24 00:21:50,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:50,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:50,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:50,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:50,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511964739] [2025-01-24 00:21:50,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511964739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:50,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:50,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:21:50,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624370021] [2025-01-24 00:21:50,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:50,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:21:50,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:50,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:21:50,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:21:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:50,558 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:50,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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) [2025-01-24 00:21:50,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:50,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:50,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:50,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:21:50,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-24 00:21:50,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:50,690 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:50,690 INFO L139 ounterexampleChecker]: Examining path program with hash 636916650, occurence #1 [2025-01-24 00:21:50,690 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:50,690 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:50,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:50,691 INFO L85 PathProgramCache]: Analyzing trace with hash -998248132, now seen corresponding path program 1 times [2025-01-24 00:21:50,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:50,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266213126] [2025-01-24 00:21:50,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:50,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:50,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-24 00:21:50,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-24 00:21:50,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:50,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:21:50,705 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:21:50,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-24 00:21:50,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-24 00:21:50,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:50,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:21:50,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:21:50,720 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:21:50,720 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:21:50,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:21:50,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-24 00:21:50,721 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:21:50,722 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:21:50,722 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-24 00:21:50,739 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-24 00:21:50,741 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:50,759 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:21:50,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:21:50,759 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:50,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:21:51,131 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:51,131 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:51,131 INFO L139 ounterexampleChecker]: Examining path program with hash -1794892938, occurence #1 [2025-01-24 00:21:51,131 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:51,131 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:51,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1002476322, now seen corresponding path program 1 times [2025-01-24 00:21:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063338810] [2025-01-24 00:21:51,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:51,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-24 00:21:51,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-24 00:21:51,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:51,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:51,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:51,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063338810] [2025-01-24 00:21:51,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063338810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:51,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:51,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:21:51,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125809844] [2025-01-24 00:21:51,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:51,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:21:51,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:51,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:21:51,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:21:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:51,165 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:51,166 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) [2025-01-24 00:21:51,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:52,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:52,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-24 00:21:52,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:52,065 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:52,065 INFO L139 ounterexampleChecker]: Examining path program with hash -1712798132, occurence #1 [2025-01-24 00:21:52,065 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:52,065 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:52,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1949613459, now seen corresponding path program 1 times [2025-01-24 00:21:52,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:52,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570448048] [2025-01-24 00:21:52,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:52,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:52,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-24 00:21:52,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-24 00:21:52,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:52,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:52,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:52,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570448048] [2025-01-24 00:21:52,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570448048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:52,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:52,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:21:52,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455897190] [2025-01-24 00:21:52,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:52,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:21:52,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:52,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:21:52,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:21:52,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:52,151 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:52,151 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) [2025-01-24 00:21:52,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:52,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:52,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:52,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-24 00:21:52,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:52,317 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:52,317 INFO L139 ounterexampleChecker]: Examining path program with hash 603075574, occurence #1 [2025-01-24 00:21:52,317 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:52,317 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:52,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1428836519, now seen corresponding path program 1 times [2025-01-24 00:21:52,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:52,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612334757] [2025-01-24 00:21:52,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:52,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:52,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-24 00:21:52,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-24 00:21:52,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:52,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:52,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:52,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612334757] [2025-01-24 00:21:52,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612334757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:52,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:52,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:21:52,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041934344] [2025-01-24 00:21:52,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:52,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:21:52,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:52,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:21:52,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:21:52,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:52,458 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:52,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 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) [2025-01-24 00:21:52,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:52,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:52,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:21:52,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-24 00:21:52,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:52,614 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:52,615 INFO L139 ounterexampleChecker]: Examining path program with hash -806768874, occurence #1 [2025-01-24 00:21:52,615 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:52,615 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:52,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:52,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2048922776, now seen corresponding path program 1 times [2025-01-24 00:21:52,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:52,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005597636] [2025-01-24 00:21:52,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:52,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:52,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-24 00:21:52,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-24 00:21:52,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:52,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:21:52,633 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:21:52,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-24 00:21:52,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-24 00:21:52,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:52,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:21:52,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:21:52,646 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:21:52,646 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:21:52,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:21:52,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-24 00:21:52,647 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:21:52,647 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:21:52,647 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-01-24 00:21:52,660 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-01-24 00:21:52,663 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:52,673 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:21:52,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:21:52,675 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:52,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:21:53,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:53,099 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:53,099 INFO L139 ounterexampleChecker]: Examining path program with hash 453632538, occurence #1 [2025-01-24 00:21:53,099 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:53,099 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:53,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:53,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1860991283, now seen corresponding path program 1 times [2025-01-24 00:21:53,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:53,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110655741] [2025-01-24 00:21:53,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:53,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:53,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-24 00:21:53,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-24 00:21:53,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:53,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:53,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:53,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110655741] [2025-01-24 00:21:53,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110655741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:53,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:53,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:21:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480630349] [2025-01-24 00:21:53,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:53,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:21:53,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:53,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:21:53,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:21:53,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:53,122 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:53,122 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) [2025-01-24 00:21:53,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:54,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:54,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-24 00:21:54,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:54,388 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:54,388 INFO L139 ounterexampleChecker]: Examining path program with hash 1938295040, occurence #1 [2025-01-24 00:21:54,388 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:54,388 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:54,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash 502479761, now seen corresponding path program 1 times [2025-01-24 00:21:54,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:54,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385368079] [2025-01-24 00:21:54,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:54,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:54,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-24 00:21:54,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-24 00:21:54,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:54,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:54,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:54,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385368079] [2025-01-24 00:21:54,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385368079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:54,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:54,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:21:54,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391576036] [2025-01-24 00:21:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:54,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:21:54,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:54,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:21:54,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:21:54,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:54,476 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:54,476 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) [2025-01-24 00:21:54,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:54,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:54,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:54,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:54,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-24 00:21:54,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:54,697 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:54,697 INFO L139 ounterexampleChecker]: Examining path program with hash -505703406, occurence #1 [2025-01-24 00:21:54,697 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:54,697 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:54,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1559979234, now seen corresponding path program 1 times [2025-01-24 00:21:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:54,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369838896] [2025-01-24 00:21:54,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:54,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-24 00:21:54,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-24 00:21:54,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:54,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:54,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:54,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369838896] [2025-01-24 00:21:54,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369838896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:54,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:54,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:21:54,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110994198] [2025-01-24 00:21:54,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:54,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:21:54,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:54,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:21:54,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:21:54,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:54,810 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:54,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 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) [2025-01-24 00:21:54,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:54,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:54,810 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:21:55,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-24 00:21:55,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:55,041 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:55,041 INFO L139 ounterexampleChecker]: Examining path program with hash 1691453351, occurence #1 [2025-01-24 00:21:55,041 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:55,041 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:55,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:55,042 INFO L85 PathProgramCache]: Analyzing trace with hash -904854289, now seen corresponding path program 1 times [2025-01-24 00:21:55,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:55,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539204915] [2025-01-24 00:21:55,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:55,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:55,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-24 00:21:55,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-24 00:21:55,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:55,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:21:55,073 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:21:55,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-24 00:21:55,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-24 00:21:55,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:55,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:21:55,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:21:55,095 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:21:55,095 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:21:55,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:21:55,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-24 00:21:55,096 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:21:55,096 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:21:55,096 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-01-24 00:21:55,110 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-01-24 00:21:55,111 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:55,120 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:21:55,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:21:55,120 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:55,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:21:55,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:55,607 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:55,607 INFO L139 ounterexampleChecker]: Examining path program with hash -84163253, occurence #1 [2025-01-24 00:21:55,608 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:55,608 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:55,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:55,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1181928096, now seen corresponding path program 1 times [2025-01-24 00:21:55,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:55,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491116005] [2025-01-24 00:21:55,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:55,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:55,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-24 00:21:55,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-24 00:21:55,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:55,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:55,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:55,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491116005] [2025-01-24 00:21:55,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491116005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:55,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:55,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:21:55,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677145696] [2025-01-24 00:21:55,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:55,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:21:55,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:55,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:21:55,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:21:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:55,627 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:55,627 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) [2025-01-24 00:21:55,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:57,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:57,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-24 00:21:57,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:57,084 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:57,084 INFO L139 ounterexampleChecker]: Examining path program with hash 1417231117, occurence #1 [2025-01-24 00:21:57,084 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:57,084 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:57,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1337318261, now seen corresponding path program 1 times [2025-01-24 00:21:57,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:57,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546717229] [2025-01-24 00:21:57,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:57,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:57,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-24 00:21:57,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-24 00:21:57,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:57,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:57,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:57,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546717229] [2025-01-24 00:21:57,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546717229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:57,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:57,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:21:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627925319] [2025-01-24 00:21:57,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:57,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:21:57,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:57,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:21:57,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:21:57,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:57,156 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:57,156 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) [2025-01-24 00:21:57,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:57,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:57,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:57,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:57,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-24 00:21:57,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:57,446 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:57,447 INFO L139 ounterexampleChecker]: Examining path program with hash 1486913167, occurence #1 [2025-01-24 00:21:57,447 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:57,447 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:57,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:57,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1288791455, now seen corresponding path program 1 times [2025-01-24 00:21:57,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:57,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776539169] [2025-01-24 00:21:57,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:57,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:57,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-24 00:21:57,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-24 00:21:57,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:57,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:57,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:57,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776539169] [2025-01-24 00:21:57,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776539169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:57,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:57,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:21:57,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407893081] [2025-01-24 00:21:57,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:57,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:21:57,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:57,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:21:57,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:21:57,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:57,557 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:57,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 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) [2025-01-24 00:21:57,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:57,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:57,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:21:57,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:21:57,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-24 00:21:57,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:57,981 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:57,981 INFO L139 ounterexampleChecker]: Examining path program with hash -1832804751, occurence #1 [2025-01-24 00:21:57,981 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:57,981 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:57,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:57,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2120595210, now seen corresponding path program 1 times [2025-01-24 00:21:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:57,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798633352] [2025-01-24 00:21:57,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:57,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-24 00:21:57,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-24 00:21:57,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:57,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:21:57,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:21:58,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-24 00:21:58,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-24 00:21:58,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:58,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:21:58,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:21:58,018 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:21:58,018 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:21:58,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:21:58,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-24 00:21:58,019 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:21:58,019 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:21:58,019 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-01-24 00:21:58,041 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-01-24 00:21:58,042 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:58,052 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:21:58,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:21:58,053 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:21:58,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:21:58,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:21:58,766 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:21:58,766 INFO L139 ounterexampleChecker]: Examining path program with hash 1825003187, occurence #1 [2025-01-24 00:21:58,766 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:21:58,766 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:21:58,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:21:58,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2116291290, now seen corresponding path program 1 times [2025-01-24 00:21:58,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:21:58,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316666693] [2025-01-24 00:21:58,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:21:58,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:21:58,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-24 00:21:58,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-24 00:21:58,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:21:58,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:21:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:21:58,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:21:58,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316666693] [2025-01-24 00:21:58,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316666693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:21:58,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:21:58,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:21:58,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434595744] [2025-01-24 00:21:58,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:21:58,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:21:58,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:21:58,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:21:58,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:21:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:21:58,789 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:21:58,789 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) [2025-01-24 00:21:58,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:00,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-24 00:22:00,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:00,718 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:00,718 INFO L139 ounterexampleChecker]: Examining path program with hash -643516904, occurence #1 [2025-01-24 00:22:00,718 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:00,718 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:00,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:00,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1574354962, now seen corresponding path program 1 times [2025-01-24 00:22:00,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:00,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326504546] [2025-01-24 00:22:00,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:00,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:00,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-24 00:22:00,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-24 00:22:00,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:00,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:00,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:00,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326504546] [2025-01-24 00:22:00,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326504546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:00,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:00,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:00,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452883323] [2025-01-24 00:22:00,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:00,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:22:00,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:00,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:22:00,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:22:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:00,825 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:00,825 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) [2025-01-24 00:22:00,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:00,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:01,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-24 00:22:01,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:01,148 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:01,148 INFO L139 ounterexampleChecker]: Examining path program with hash -1219188213, occurence #1 [2025-01-24 00:22:01,148 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:01,148 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:01,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1873104375, now seen corresponding path program 1 times [2025-01-24 00:22:01,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638648868] [2025-01-24 00:22:01,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:01,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-24 00:22:01,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-24 00:22:01,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:01,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:01,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:01,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638648868] [2025-01-24 00:22:01,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638648868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:01,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:01,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:01,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287502565] [2025-01-24 00:22:01,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:01,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:22:01,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:01,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:22:01,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:22:01,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:01,257 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:01,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 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) [2025-01-24 00:22:01,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:01,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:01,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:01,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:01,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:22:01,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-24 00:22:01,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:01,732 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:01,732 INFO L139 ounterexampleChecker]: Examining path program with hash -1719743057, occurence #1 [2025-01-24 00:22:01,732 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:01,732 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:01,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1472953335, now seen corresponding path program 1 times [2025-01-24 00:22:01,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:01,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977079926] [2025-01-24 00:22:01,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:01,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:01,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-24 00:22:01,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-24 00:22:01,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:01,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:01,756 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:22:01,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-24 00:22:01,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-24 00:22:01,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:01,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:01,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:22:01,782 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:22:01,783 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:22:01,783 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:22:01,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-24 00:22:01,785 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:22:01,785 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:22:01,785 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-01-24 00:22:01,808 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-24 00:22:01,813 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:01,824 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:22:01,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:22:01,825 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:01,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:22:02,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:02,613 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:02,613 INFO L139 ounterexampleChecker]: Examining path program with hash -431587874, occurence #1 [2025-01-24 00:22:02,613 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:02,613 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:02,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash -441016446, now seen corresponding path program 1 times [2025-01-24 00:22:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:02,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934087933] [2025-01-24 00:22:02,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:02,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-24 00:22:02,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-24 00:22:02,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:02,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:02,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:02,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934087933] [2025-01-24 00:22:02,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934087933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:02,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:02,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:22:02,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032171783] [2025-01-24 00:22:02,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:02,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:22:02,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:02,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:22:02,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:22:02,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:02,635 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:02,635 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) [2025-01-24 00:22:02,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:04,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-24 00:22:04,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:04,820 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:04,821 INFO L139 ounterexampleChecker]: Examining path program with hash -1075897324, occurence #1 [2025-01-24 00:22:04,821 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:04,821 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:04,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash 744837955, now seen corresponding path program 1 times [2025-01-24 00:22:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:04,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592392598] [2025-01-24 00:22:04,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:04,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-24 00:22:04,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-24 00:22:04,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:04,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:04,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:04,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592392598] [2025-01-24 00:22:04,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592392598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:04,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:04,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:04,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212652125] [2025-01-24 00:22:04,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:04,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:22:04,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:04,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:22:04,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:22:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:04,895 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:04,895 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) [2025-01-24 00:22:04,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:04,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:05,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-24 00:22:05,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:05,348 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:05,349 INFO L139 ounterexampleChecker]: Examining path program with hash 1281139765, occurence #1 [2025-01-24 00:22:05,349 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:05,349 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:05,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:05,349 INFO L85 PathProgramCache]: Analyzing trace with hash -625098034, now seen corresponding path program 1 times [2025-01-24 00:22:05,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:05,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056489932] [2025-01-24 00:22:05,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:05,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:05,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-24 00:22:05,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-24 00:22:05,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:05,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:05,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:05,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056489932] [2025-01-24 00:22:05,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056489932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:05,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:05,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:05,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677616532] [2025-01-24 00:22:05,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:05,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:22:05,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:05,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:22:05,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:22:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:05,515 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:05,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 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) [2025-01-24 00:22:05,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:05,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:05,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:06,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:06,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:06,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:22:06,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-24 00:22:06,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:06,042 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:06,042 INFO L139 ounterexampleChecker]: Examining path program with hash -1266932722, occurence #1 [2025-01-24 00:22:06,042 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:06,042 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:06,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:06,042 INFO L85 PathProgramCache]: Analyzing trace with hash 252211169, now seen corresponding path program 1 times [2025-01-24 00:22:06,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:06,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975875535] [2025-01-24 00:22:06,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:06,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:06,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-24 00:22:06,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-24 00:22:06,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:06,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:06,092 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:22:06,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-24 00:22:06,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-24 00:22:06,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:06,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:06,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:22:06,113 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:22:06,113 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:22:06,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:22:06,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-24 00:22:06,115 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:22:06,115 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:22:06,116 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-01-24 00:22:06,135 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2025-01-24 00:22:06,140 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:06,153 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:22:06,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:22:06,154 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:06,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:22:07,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:07,022 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:07,022 INFO L139 ounterexampleChecker]: Examining path program with hash -1673032385, occurence #1 [2025-01-24 00:22:07,022 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:07,022 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:07,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash 491524051, now seen corresponding path program 1 times [2025-01-24 00:22:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:07,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498548625] [2025-01-24 00:22:07,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:07,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-24 00:22:07,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-24 00:22:07,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:07,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:07,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:07,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498548625] [2025-01-24 00:22:07,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498548625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:07,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:07,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:22:07,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389833533] [2025-01-24 00:22:07,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:07,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:22:07,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:07,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:22:07,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:22:07,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:07,041 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:07,041 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) [2025-01-24 00:22:07,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:09,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-24 00:22:09,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:09,733 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:09,733 INFO L139 ounterexampleChecker]: Examining path program with hash 1695117195, occurence #1 [2025-01-24 00:22:09,733 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:09,733 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:09,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:09,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1990428099, now seen corresponding path program 1 times [2025-01-24 00:22:09,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:09,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500346945] [2025-01-24 00:22:09,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:09,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:09,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-24 00:22:09,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-24 00:22:09,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:09,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:09,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:09,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500346945] [2025-01-24 00:22:09,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500346945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:09,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:09,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:09,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675942876] [2025-01-24 00:22:09,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:09,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:22:09,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:09,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:22:09,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:22:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:09,818 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:09,818 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) [2025-01-24 00:22:09,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:09,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:10,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:10,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-24 00:22:10,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:10,242 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:10,242 INFO L139 ounterexampleChecker]: Examining path program with hash -1749050884, occurence #1 [2025-01-24 00:22:10,242 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:10,242 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:10,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:10,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1607204960, now seen corresponding path program 1 times [2025-01-24 00:22:10,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:10,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658303277] [2025-01-24 00:22:10,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:10,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:10,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-24 00:22:10,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-24 00:22:10,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:10,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:10,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:10,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658303277] [2025-01-24 00:22:10,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658303277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:10,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:10,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:10,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814222804] [2025-01-24 00:22:10,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:10,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:22:10,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:10,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:22:10,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:22:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:10,400 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:10,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 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) [2025-01-24 00:22:10,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:10,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:10,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:22:11,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-24 00:22:11,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:11,085 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:11,085 INFO L139 ounterexampleChecker]: Examining path program with hash 1093756481, occurence #1 [2025-01-24 00:22:11,085 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:11,085 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:11,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:11,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1235135371, now seen corresponding path program 1 times [2025-01-24 00:22:11,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:11,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524585925] [2025-01-24 00:22:11,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:11,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:11,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-24 00:22:11,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-24 00:22:11,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:11,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:11,104 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:22:11,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-24 00:22:11,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-24 00:22:11,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:11,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:11,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:22:11,121 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:22:11,122 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:22:11,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:22:11,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-24 00:22:11,123 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:22:11,123 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:22:11,123 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2025-01-24 00:22:11,142 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-01-24 00:22:11,143 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:11,155 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:22:11,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:22:11,156 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:11,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:22:12,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:12,263 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:12,263 INFO L139 ounterexampleChecker]: Examining path program with hash -729938234, occurence #1 [2025-01-24 00:22:12,263 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:12,263 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:12,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:12,263 INFO L85 PathProgramCache]: Analyzing trace with hash 389163822, now seen corresponding path program 1 times [2025-01-24 00:22:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:12,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936399747] [2025-01-24 00:22:12,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:12,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-24 00:22:12,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-24 00:22:12,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:12,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:12,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:12,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936399747] [2025-01-24 00:22:12,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936399747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:12,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:12,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:22:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497470733] [2025-01-24 00:22:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:12,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:22:12,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:12,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:22:12,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:22:12,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:12,281 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:12,281 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) [2025-01-24 00:22:12,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:15,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-24 00:22:15,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:15,512 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:15,512 INFO L139 ounterexampleChecker]: Examining path program with hash -776970392, occurence #1 [2025-01-24 00:22:15,512 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:15,512 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:15,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1052912727, now seen corresponding path program 1 times [2025-01-24 00:22:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475594595] [2025-01-24 00:22:15,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:15,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-24 00:22:15,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-24 00:22:15,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:15,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:15,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:15,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475594595] [2025-01-24 00:22:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475594595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:15,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:15,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355669265] [2025-01-24 00:22:15,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:15,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:22:15,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:15,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:22:15,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:22:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:15,626 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:15,626 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) [2025-01-24 00:22:15,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:15,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:16,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-24 00:22:16,119 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:16,120 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:16,120 INFO L139 ounterexampleChecker]: Examining path program with hash -828025440, occurence #1 [2025-01-24 00:22:16,120 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:16,120 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:16,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash -953059311, now seen corresponding path program 1 times [2025-01-24 00:22:16,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:16,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607176315] [2025-01-24 00:22:16,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:16,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:16,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-24 00:22:16,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-24 00:22:16,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:16,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:16,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:16,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607176315] [2025-01-24 00:22:16,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607176315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:16,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:16,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:16,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985118638] [2025-01-24 00:22:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:16,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:22:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:16,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:22:16,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:22:16,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:16,235 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:16,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 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) [2025-01-24 00:22:16,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:16,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:16,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:17,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:17,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:17,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:22:17,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-24 00:22:17,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:17,026 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:17,026 INFO L139 ounterexampleChecker]: Examining path program with hash -405810661, occurence #1 [2025-01-24 00:22:17,026 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:17,026 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:17,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:17,026 INFO L85 PathProgramCache]: Analyzing trace with hash 278763547, now seen corresponding path program 1 times [2025-01-24 00:22:17,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:17,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297082318] [2025-01-24 00:22:17,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:17,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:17,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-24 00:22:17,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-24 00:22:17,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:17,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:17,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:22:17,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-24 00:22:17,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-24 00:22:17,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:17,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:17,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:22:17,066 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:22:17,066 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:22:17,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:22:17,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-24 00:22:17,067 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:22:17,068 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:22:17,068 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2025-01-24 00:22:17,088 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2025-01-24 00:22:17,090 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:17,105 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:22:17,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:22:17,105 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:17,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:22:18,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:18,329 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:18,329 INFO L139 ounterexampleChecker]: Examining path program with hash 458520084, occurence #1 [2025-01-24 00:22:18,329 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:18,329 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:18,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:18,329 INFO L85 PathProgramCache]: Analyzing trace with hash -747532856, now seen corresponding path program 1 times [2025-01-24 00:22:18,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:18,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837285379] [2025-01-24 00:22:18,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:18,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:18,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-24 00:22:18,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-24 00:22:18,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:18,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:18,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:18,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837285379] [2025-01-24 00:22:18,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837285379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:18,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:18,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:22:18,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214411568] [2025-01-24 00:22:18,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:18,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:22:18,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:18,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:22:18,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:22:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:18,348 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:18,348 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) [2025-01-24 00:22:18,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:21,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-24 00:22:21,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:21,937 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:21,937 INFO L139 ounterexampleChecker]: Examining path program with hash 50106578, occurence #1 [2025-01-24 00:22:21,937 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:21,937 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:21,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1191457796, now seen corresponding path program 1 times [2025-01-24 00:22:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:21,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915176706] [2025-01-24 00:22:21,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:21,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-24 00:22:21,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-24 00:22:21,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:21,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:22,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:22,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915176706] [2025-01-24 00:22:22,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915176706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:22,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:22,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:22,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580984661] [2025-01-24 00:22:22,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:22,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:22:22,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:22,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:22:22,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:22:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:22,017 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:22,017 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) [2025-01-24 00:22:22,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:22,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:22,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-24 00:22:22,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:22,563 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:22,563 INFO L139 ounterexampleChecker]: Examining path program with hash 1943442767, occurence #1 [2025-01-24 00:22:22,563 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:22,563 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:22,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:22,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1624519772, now seen corresponding path program 1 times [2025-01-24 00:22:22,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:22,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308954006] [2025-01-24 00:22:22,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:22,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:22,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-24 00:22:22,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-24 00:22:22,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:22,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:22,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308954006] [2025-01-24 00:22:22,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308954006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:22,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:22,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:22,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675424691] [2025-01-24 00:22:22,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:22,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:22:22,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:22,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:22:22,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:22:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:22,687 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:22,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 3 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) [2025-01-24 00:22:22,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:22,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:22,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:23,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:23,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:23,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:22:23,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-24 00:22:23,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:23,636 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:23,636 INFO L139 ounterexampleChecker]: Examining path program with hash -156035230, occurence #1 [2025-01-24 00:22:23,636 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:23,636 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:23,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1287835300, now seen corresponding path program 1 times [2025-01-24 00:22:23,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:23,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340256229] [2025-01-24 00:22:23,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:23,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:23,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-24 00:22:23,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-24 00:22:23,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:23,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:23,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:22:23,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-24 00:22:23,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-24 00:22:23,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:23,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:23,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:22:23,672 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:22:23,673 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:22:23,673 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:22:23,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-24 00:22:23,674 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:22:23,674 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:22:23,674 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2025-01-24 00:22:23,696 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-01-24 00:22:23,699 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:23,715 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:22:23,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:22:23,717 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:23,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:22:25,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:25,193 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:25,193 INFO L139 ounterexampleChecker]: Examining path program with hash 1116565862, occurence #1 [2025-01-24 00:22:25,193 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:25,193 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1175255216, now seen corresponding path program 1 times [2025-01-24 00:22:25,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:25,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299997566] [2025-01-24 00:22:25,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:25,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:25,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-24 00:22:25,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-24 00:22:25,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:25,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:25,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:25,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299997566] [2025-01-24 00:22:25,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299997566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:25,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:25,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:22:25,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273282785] [2025-01-24 00:22:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:25,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:22:25,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:25,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:22:25,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:22:25,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:25,214 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:25,214 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) [2025-01-24 00:22:25,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:29,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:29,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-24 00:22:29,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:29,510 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:29,510 INFO L139 ounterexampleChecker]: Examining path program with hash -496751608, occurence #1 [2025-01-24 00:22:29,510 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:29,510 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:29,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1725222006, now seen corresponding path program 1 times [2025-01-24 00:22:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:29,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664547849] [2025-01-24 00:22:29,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:29,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:29,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-24 00:22:29,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-24 00:22:29,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:29,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:29,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664547849] [2025-01-24 00:22:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664547849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:29,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383652194] [2025-01-24 00:22:29,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:29,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:22:29,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:29,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:22:29,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:22:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:29,593 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:29,593 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) [2025-01-24 00:22:29,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:29,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:30,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-24 00:22:30,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:30,246 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:30,247 INFO L139 ounterexampleChecker]: Examining path program with hash 1663477643, occurence #1 [2025-01-24 00:22:30,247 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:30,247 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:30,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:30,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1489320816, now seen corresponding path program 1 times [2025-01-24 00:22:30,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:30,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928270282] [2025-01-24 00:22:30,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:30,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:30,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-24 00:22:30,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-24 00:22:30,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:30,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:30,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:30,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928270282] [2025-01-24 00:22:30,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928270282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:30,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:30,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:30,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550341728] [2025-01-24 00:22:30,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:30,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:22:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:30,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:22:30,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:22:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:30,383 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:30,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 3 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) [2025-01-24 00:22:30,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:30,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:30,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:31,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:22:31,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-24 00:22:31,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:31,569 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:31,569 INFO L139 ounterexampleChecker]: Examining path program with hash -249069041, occurence #1 [2025-01-24 00:22:31,569 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:31,569 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:31,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash 348142887, now seen corresponding path program 1 times [2025-01-24 00:22:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744823927] [2025-01-24 00:22:31,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:31,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:31,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-24 00:22:31,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-24 00:22:31,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:31,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:31,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:22:31,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-24 00:22:31,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-24 00:22:31,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:31,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:31,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:22:31,611 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:22:31,611 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:22:31,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:22:31,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-24 00:22:31,613 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:22:31,613 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:22:31,613 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2025-01-24 00:22:31,638 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2025-01-24 00:22:31,640 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:31,656 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:22:31,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:22:31,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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:31,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:22:33,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:33,357 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:33,357 INFO L139 ounterexampleChecker]: Examining path program with hash -2022012810, occurence #1 [2025-01-24 00:22:33,357 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:33,357 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:33,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:33,357 INFO L85 PathProgramCache]: Analyzing trace with hash 336392621, now seen corresponding path program 1 times [2025-01-24 00:22:33,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:33,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290802456] [2025-01-24 00:22:33,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:33,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:33,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-24 00:22:33,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-24 00:22:33,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:33,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290802456] [2025-01-24 00:22:33,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290802456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:33,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:33,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:22:33,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242919160] [2025-01-24 00:22:33,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:33,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:22:33,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:33,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:22:33,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:22:33,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:33,380 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:33,380 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) [2025-01-24 00:22:33,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:38,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-24 00:22:38,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:38,266 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:38,266 INFO L139 ounterexampleChecker]: Examining path program with hash 332429270, occurence #1 [2025-01-24 00:22:38,266 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:38,266 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:38,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash -638528726, now seen corresponding path program 1 times [2025-01-24 00:22:38,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:38,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602181212] [2025-01-24 00:22:38,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:38,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-24 00:22:38,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-24 00:22:38,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:38,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:38,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:38,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602181212] [2025-01-24 00:22:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602181212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:38,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:38,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:38,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444490039] [2025-01-24 00:22:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:38,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:22:38,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:38,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:22:38,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:22:38,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:38,365 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:38,365 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) [2025-01-24 00:22:38,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:38,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:39,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-24 00:22:39,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:39,042 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:39,042 INFO L139 ounterexampleChecker]: Examining path program with hash 1681467695, occurence #1 [2025-01-24 00:22:39,042 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:39,042 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:39,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:39,042 INFO L85 PathProgramCache]: Analyzing trace with hash -985031961, now seen corresponding path program 1 times [2025-01-24 00:22:39,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:39,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428826187] [2025-01-24 00:22:39,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:39,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:39,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-24 00:22:39,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-24 00:22:39,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:39,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:39,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428826187] [2025-01-24 00:22:39,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428826187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:39,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:39,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:39,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944502624] [2025-01-24 00:22:39,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:39,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:22:39,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:39,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:22:39,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:22:39,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:39,188 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:39,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 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) [2025-01-24 00:22:39,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:39,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:39,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:40,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:40,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:40,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:22:40,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-24 00:22:40,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:40,515 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:40,515 INFO L139 ounterexampleChecker]: Examining path program with hash -2094435991, occurence #1 [2025-01-24 00:22:40,515 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:40,515 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:40,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:40,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1048194980, now seen corresponding path program 1 times [2025-01-24 00:22:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:40,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285807831] [2025-01-24 00:22:40,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:40,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:40,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-24 00:22:40,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-24 00:22:40,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:40,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:40,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:22:40,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-24 00:22:40,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-24 00:22:40,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:40,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:40,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:22:40,558 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:22:40,558 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:22:40,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:22:40,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-24 00:22:40,561 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:22:40,561 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:22:40,561 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2025-01-24 00:22:40,586 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2025-01-24 00:22:40,588 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:40,607 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:22:40,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:22:40,607 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:40,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:22:42,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:42,553 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:42,553 INFO L139 ounterexampleChecker]: Examining path program with hash 1209310369, occurence #1 [2025-01-24 00:22:42,553 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:42,553 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:42,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:42,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1130307718, now seen corresponding path program 1 times [2025-01-24 00:22:42,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:42,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723587331] [2025-01-24 00:22:42,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:42,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:42,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-24 00:22:42,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-24 00:22:42,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:42,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:42,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:42,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723587331] [2025-01-24 00:22:42,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723587331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:42,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:42,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:22:42,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176416438] [2025-01-24 00:22:42,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:42,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:22:42,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:42,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:22:42,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:22:42,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:42,575 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:42,575 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) [2025-01-24 00:22:42,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:48,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:48,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-24 00:22:48,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:48,008 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:48,009 INFO L139 ounterexampleChecker]: Examining path program with hash -367456444, occurence #1 [2025-01-24 00:22:48,009 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:48,009 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:48,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:48,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2130106537, now seen corresponding path program 1 times [2025-01-24 00:22:48,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:48,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554457229] [2025-01-24 00:22:48,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:48,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:48,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-24 00:22:48,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-24 00:22:48,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:48,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:48,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:48,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554457229] [2025-01-24 00:22:48,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554457229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:48,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:48,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:48,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013693691] [2025-01-24 00:22:48,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:48,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:22:48,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:48,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:22:48,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:22:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:48,170 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:48,171 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) [2025-01-24 00:22:48,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:48,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:48,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-24 00:22:48,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:48,943 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:48,943 INFO L139 ounterexampleChecker]: Examining path program with hash -229182017, occurence #1 [2025-01-24 00:22:48,943 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:48,943 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:48,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2108874495, now seen corresponding path program 1 times [2025-01-24 00:22:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:48,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170515496] [2025-01-24 00:22:48,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:48,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:48,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-01-24 00:22:48,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-01-24 00:22:48,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:48,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:49,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:49,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170515496] [2025-01-24 00:22:49,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170515496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:49,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:49,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:49,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127286421] [2025-01-24 00:22:49,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:49,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:22:49,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:49,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:22:49,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:22:49,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:49,115 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:49,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 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) [2025-01-24 00:22:49,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:49,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:49,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:22:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:22:50,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-01-24 00:22:50,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:50,851 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:50,851 INFO L139 ounterexampleChecker]: Examining path program with hash 172583745, occurence #1 [2025-01-24 00:22:50,851 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:50,851 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:50,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:50,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1388068024, now seen corresponding path program 1 times [2025-01-24 00:22:50,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:50,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991515150] [2025-01-24 00:22:50,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:50,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-24 00:22:50,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-24 00:22:50,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:50,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:50,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:22:50,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-24 00:22:50,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-24 00:22:50,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:50,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:22:50,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:22:50,898 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:22:50,898 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:22:50,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:22:50,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-24 00:22:50,899 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-24 00:22:50,900 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:22:50,900 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2025-01-24 00:22:50,924 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2025-01-24 00:22:50,926 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:50,946 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:22:50,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:22:50,946 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:22:50,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:22:53,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:53,092 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:53,092 INFO L139 ounterexampleChecker]: Examining path program with hash -1706697828, occurence #1 [2025-01-24 00:22:53,092 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:53,092 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:53,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1947834186, now seen corresponding path program 1 times [2025-01-24 00:22:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:53,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051251511] [2025-01-24 00:22:53,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:53,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:53,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-24 00:22:53,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-24 00:22:53,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:53,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:53,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:53,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051251511] [2025-01-24 00:22:53,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051251511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:53,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:53,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:22:53,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663813078] [2025-01-24 00:22:53,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:53,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:22:53,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:53,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:22:53,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:22:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:53,118 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:53,118 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) [2025-01-24 00:22:53,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:59,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:59,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-01-24 00:22:59,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:22:59,431 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:22:59,431 INFO L139 ounterexampleChecker]: Examining path program with hash -1478363493, occurence #1 [2025-01-24 00:22:59,431 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:22:59,431 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:22:59,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:22:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1537459426, now seen corresponding path program 1 times [2025-01-24 00:22:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:22:59,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361064976] [2025-01-24 00:22:59,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:22:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:22:59,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-24 00:22:59,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-24 00:22:59,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:22:59,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:22:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:22:59,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:22:59,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361064976] [2025-01-24 00:22:59,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361064976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:22:59,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:22:59,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:22:59,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717202973] [2025-01-24 00:22:59,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:22:59,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:22:59,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:22:59,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:22:59,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:22:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:59,555 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:22:59,555 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) [2025-01-24 00:22:59,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:22:59,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:23:00,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-01-24 00:23:00,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:00,530 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:00,530 INFO L139 ounterexampleChecker]: Examining path program with hash -1956247993, occurence #1 [2025-01-24 00:23:00,530 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:00,530 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:00,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash 157229866, now seen corresponding path program 2 times [2025-01-24 00:23:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:00,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121538773] [2025-01-24 00:23:00,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:23:00,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:00,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 282 statements into 1 equivalence classes. [2025-01-24 00:23:00,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-24 00:23:00,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:23:00,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:23:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:23:00,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:23:00,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121538773] [2025-01-24 00:23:00,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121538773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:23:00,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:23:00,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:23:00,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345158693] [2025-01-24 00:23:00,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:23:00,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:23:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:23:00,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:23:00,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:23:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:00,707 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:23:00,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) 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) [2025-01-24 00:23:00,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:00,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:23:00,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:23:02,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:23:02,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-01-24 00:23:02,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:02,720 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:02,720 INFO L139 ounterexampleChecker]: Examining path program with hash -603353476, occurence #1 [2025-01-24 00:23:02,720 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:02,720 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:02,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:02,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1538136686, now seen corresponding path program 1 times [2025-01-24 00:23:02,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:02,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676258132] [2025-01-24 00:23:02,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:23:02,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:02,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-24 00:23:02,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-24 00:23:02,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:02,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:23:02,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:23:02,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-24 00:23:02,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-24 00:23:02,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:02,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:23:02,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:23:02,780 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:23:02,780 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:23:02,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:23:02,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-01-24 00:23:02,782 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:23:02,782 WARN L246 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:23:02,782 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2025-01-24 00:23:02,821 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2025-01-24 00:23:02,824 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:23:02,845 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:23:02,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:23:02,846 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:23:02,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:23:05,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:05,400 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:05,400 INFO L139 ounterexampleChecker]: Examining path program with hash 1784209153, occurence #1 [2025-01-24 00:23:05,400 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:05,400 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:05,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:05,400 INFO L85 PathProgramCache]: Analyzing trace with hash -590234872, now seen corresponding path program 1 times [2025-01-24 00:23:05,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:05,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675982380] [2025-01-24 00:23:05,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:23:05,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:05,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-24 00:23:05,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-24 00:23:05,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:05,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:23:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:23:05,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:23:05,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675982380] [2025-01-24 00:23:05,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675982380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:23:05,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:23:05,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:23:05,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145575699] [2025-01-24 00:23:05,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:23:05,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:23:05,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:23:05,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:23:05,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:23:05,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:05,424 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:23:05,424 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) [2025-01-24 00:23:05,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:12,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:12,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-01-24 00:23:12,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:12,478 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:12,478 INFO L139 ounterexampleChecker]: Examining path program with hash -2110562980, occurence #1 [2025-01-24 00:23:12,478 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:12,478 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:12,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1884148286, now seen corresponding path program 1 times [2025-01-24 00:23:12,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:12,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257056637] [2025-01-24 00:23:12,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:23:12,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:12,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-24 00:23:12,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-24 00:23:12,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:12,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:23:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:23:12,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:23:12,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257056637] [2025-01-24 00:23:12,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257056637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:23:12,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:23:12,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:23:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394913951] [2025-01-24 00:23:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:23:12,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:23:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:23:12,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:23:12,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:23:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:12,638 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:23:12,638 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) [2025-01-24 00:23:12,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:12,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:23:13,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-01-24 00:23:13,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:13,576 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:13,576 INFO L139 ounterexampleChecker]: Examining path program with hash -512010424, occurence #1 [2025-01-24 00:23:13,576 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:13,576 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:13,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2053416272, now seen corresponding path program 2 times [2025-01-24 00:23:13,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:13,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665636722] [2025-01-24 00:23:13,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:23:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:13,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 302 statements into 1 equivalence classes. [2025-01-24 00:23:13,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-24 00:23:13,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:23:13,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:23:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:23:13,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:23:13,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665636722] [2025-01-24 00:23:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665636722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:23:13,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:23:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:23:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304227912] [2025-01-24 00:23:13,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:23:13,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:23:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:23:13,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:23:13,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:23:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:13,763 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:23:13,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) 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) [2025-01-24 00:23:13,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:13,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:23:13,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:23:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:23:16,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-01-24 00:23:16,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:16,066 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:16,066 INFO L139 ounterexampleChecker]: Examining path program with hash 1394778131, occurence #1 [2025-01-24 00:23:16,066 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:16,066 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:16,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1569665709, now seen corresponding path program 1 times [2025-01-24 00:23:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267177977] [2025-01-24 00:23:16,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:23:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:16,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-24 00:23:16,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-24 00:23:16,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:16,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:23:16,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:23:16,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-24 00:23:16,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-24 00:23:16,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:16,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:23:16,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:23:16,121 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:23:16,121 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:23:16,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:23:16,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-01-24 00:23:16,122 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:23:16,122 WARN L246 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:23:16,122 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2025-01-24 00:23:16,154 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2025-01-24 00:23:16,156 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:23:16,185 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:23:16,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:23:16,185 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:23:16,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:23:18,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:18,940 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:18,940 INFO L139 ounterexampleChecker]: Examining path program with hash 524424985, occurence #1 [2025-01-24 00:23:18,940 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:18,940 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:18,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:18,941 INFO L85 PathProgramCache]: Analyzing trace with hash 509575087, now seen corresponding path program 1 times [2025-01-24 00:23:18,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:18,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889632463] [2025-01-24 00:23:18,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:23:18,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:18,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-24 00:23:18,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-24 00:23:18,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:18,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:23:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:23:18,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:23:18,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889632463] [2025-01-24 00:23:18,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889632463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:23:18,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:23:18,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:23:18,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632156787] [2025-01-24 00:23:18,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:23:18,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:23:18,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:23:18,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:23:18,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:23:18,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:18,967 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:23:18,967 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) [2025-01-24 00:23:18,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:26,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-01-24 00:23:26,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:26,750 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:26,750 INFO L139 ounterexampleChecker]: Examining path program with hash 465749288, occurence #1 [2025-01-24 00:23:26,750 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:26,750 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:26,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:26,751 INFO L85 PathProgramCache]: Analyzing trace with hash -222440905, now seen corresponding path program 1 times [2025-01-24 00:23:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:26,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262004754] [2025-01-24 00:23:26,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:23:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:26,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-24 00:23:26,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-24 00:23:26,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:26,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:23:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:23:26,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:23:26,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262004754] [2025-01-24 00:23:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262004754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:23:26,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:23:26,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:23:26,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294775956] [2025-01-24 00:23:26,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:23:26,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:23:26,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:23:26,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:23:26,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:23:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:26,876 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:23:26,876 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) [2025-01-24 00:23:26,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:26,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:23:27,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-01-24 00:23:27,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:27,748 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:27,749 INFO L139 ounterexampleChecker]: Examining path program with hash -1787745281, occurence #1 [2025-01-24 00:23:27,749 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:27,749 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:27,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1612685087, now seen corresponding path program 2 times [2025-01-24 00:23:27,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:27,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230656845] [2025-01-24 00:23:27,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:23:27,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:27,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 322 statements into 1 equivalence classes. [2025-01-24 00:23:27,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-24 00:23:27,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:23:27,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:23:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:23:28,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:23:28,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230656845] [2025-01-24 00:23:28,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230656845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:23:28,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:23:28,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:23:28,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65337952] [2025-01-24 00:23:28,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:23:28,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:23:28,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:23:28,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:23:28,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:23:28,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:28,072 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:23:28,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) 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) [2025-01-24 00:23:28,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:28,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:23:28,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:30,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:30,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:23:30,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:23:30,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-01-24 00:23:30,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:30,751 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:30,751 INFO L139 ounterexampleChecker]: Examining path program with hash -945357383, occurence #1 [2025-01-24 00:23:30,751 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:30,751 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:30,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash 259315947, now seen corresponding path program 1 times [2025-01-24 00:23:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:30,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985354239] [2025-01-24 00:23:30,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:23:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:30,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-24 00:23:30,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-24 00:23:30,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:30,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:23:30,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:23:30,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-24 00:23:30,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-24 00:23:30,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:30,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:23:30,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:23:30,808 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:23:30,809 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:23:30,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:23:30,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-01-24 00:23:30,810 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:23:30,810 WARN L246 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:23:30,810 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2025-01-24 00:23:30,840 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-01-24 00:23:30,842 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:23:30,867 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:23:30,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:23:30,867 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:23:30,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:23:34,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:34,275 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:34,275 INFO L139 ounterexampleChecker]: Examining path program with hash 1701689816, occurence #1 [2025-01-24 00:23:34,275 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:34,275 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:34,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:34,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1280301578, now seen corresponding path program 1 times [2025-01-24 00:23:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:34,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507503627] [2025-01-24 00:23:34,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:23:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:34,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-24 00:23:34,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-24 00:23:34,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:34,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:23:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:23:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:23:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507503627] [2025-01-24 00:23:34,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507503627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:23:34,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:23:34,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:23:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207427930] [2025-01-24 00:23:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:23:34,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:23:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:23:34,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:23:34,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:23:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:34,304 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:23:34,304 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) [2025-01-24 00:23:34,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:42,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-01-24 00:23:42,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:42,753 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:42,753 INFO L139 ounterexampleChecker]: Examining path program with hash 292742489, occurence #1 [2025-01-24 00:23:42,753 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:42,753 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:42,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:42,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1712913637, now seen corresponding path program 1 times [2025-01-24 00:23:42,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:42,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034337024] [2025-01-24 00:23:42,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:23:42,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:42,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-24 00:23:42,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-24 00:23:42,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:42,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:23:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:23:43,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:23:43,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034337024] [2025-01-24 00:23:43,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034337024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:23:43,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:23:43,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:23:43,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011441746] [2025-01-24 00:23:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:23:43,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:23:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:23:43,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:23:43,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:23:43,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:43,023 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:23:43,023 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) [2025-01-24 00:23:43,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:43,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:23:43,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-01-24 00:23:43,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:43,984 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:43,984 INFO L139 ounterexampleChecker]: Examining path program with hash -1972106903, occurence #1 [2025-01-24 00:23:43,984 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:43,984 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:43,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash -65570779, now seen corresponding path program 2 times [2025-01-24 00:23:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:43,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484727280] [2025-01-24 00:23:43,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:23:43,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:44,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 342 statements into 1 equivalence classes. [2025-01-24 00:23:44,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-24 00:23:44,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:23:44,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:23:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:23:44,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:23:44,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484727280] [2025-01-24 00:23:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484727280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:23:44,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:23:44,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:23:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533581414] [2025-01-24 00:23:44,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:23:44,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:23:44,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:23:44,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:23:44,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:23:44,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:44,198 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:23:44,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) 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) [2025-01-24 00:23:44,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:44,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:23:44,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:23:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:23:47,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-01-24 00:23:47,293 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:47,293 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:47,293 INFO L139 ounterexampleChecker]: Examining path program with hash -533628429, occurence #1 [2025-01-24 00:23:47,293 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:47,293 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:47,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:47,293 INFO L85 PathProgramCache]: Analyzing trace with hash -580860480, now seen corresponding path program 1 times [2025-01-24 00:23:47,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:47,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460167984] [2025-01-24 00:23:47,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:23:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:47,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-24 00:23:47,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-24 00:23:47,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:47,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:23:47,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:23:47,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-24 00:23:47,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-24 00:23:47,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:47,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:23:47,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:23:47,361 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:23:47,361 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:23:47,361 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:23:47,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-01-24 00:23:47,362 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:23:47,362 WARN L246 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:23:47,363 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2025-01-24 00:23:47,397 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2025-01-24 00:23:47,399 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:23:47,424 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:23:47,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:23:47,425 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:23:47,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:23:50,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:23:50,917 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:23:50,917 INFO L139 ounterexampleChecker]: Examining path program with hash 2082101541, occurence #1 [2025-01-24 00:23:50,917 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:23:50,917 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:23:50,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:23:50,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1572965620, now seen corresponding path program 1 times [2025-01-24 00:23:50,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:23:50,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753176552] [2025-01-24 00:23:50,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:23:50,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:23:50,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-24 00:23:50,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-24 00:23:50,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:23:50,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:23:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:23:50,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:23:50,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753176552] [2025-01-24 00:23:50,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753176552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:23:50,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:23:50,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:23:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202102743] [2025-01-24 00:23:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:23:50,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:23:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:23:50,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:23:50,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:23:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:23:50,947 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:23:50,947 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) [2025-01-24 00:23:50,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:00,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:00,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-01-24 00:24:00,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:24:00,390 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:24:00,391 INFO L139 ounterexampleChecker]: Examining path program with hash 998159302, occurence #1 [2025-01-24 00:24:00,391 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:24:00,391 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:24:00,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:24:00,391 INFO L85 PathProgramCache]: Analyzing trace with hash 758038337, now seen corresponding path program 1 times [2025-01-24 00:24:00,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:24:00,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505647707] [2025-01-24 00:24:00,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:24:00,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:24:00,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-24 00:24:00,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-24 00:24:00,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:24:00,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:24:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:24:00,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:24:00,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505647707] [2025-01-24 00:24:00,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505647707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:24:00,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:24:00,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:24:00,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318332376] [2025-01-24 00:24:00,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:24:00,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:24:00,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:24:00,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:24:00,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:24:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:00,541 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:24:00,541 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) [2025-01-24 00:24:00,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:00,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:24:01,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-01-24 00:24:01,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:24:01,463 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:24:01,463 INFO L139 ounterexampleChecker]: Examining path program with hash 1074638183, occurence #1 [2025-01-24 00:24:01,463 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:24:01,463 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:24:01,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:24:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash -752686377, now seen corresponding path program 2 times [2025-01-24 00:24:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:24:01,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315963963] [2025-01-24 00:24:01,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:24:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:24:01,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 362 statements into 1 equivalence classes. [2025-01-24 00:24:01,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-24 00:24:01,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:24:01,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:24:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:24:01,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:24:01,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315963963] [2025-01-24 00:24:01,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315963963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:24:01,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:24:01,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:24:01,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635632772] [2025-01-24 00:24:01,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:24:01,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:24:01,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:24:01,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:24:01,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:24:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:01,892 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:24:01,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) 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) [2025-01-24 00:24:01,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:01,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:24:01,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:24:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:24:05,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-01-24 00:24:05,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:24:05,518 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:24:05,518 INFO L139 ounterexampleChecker]: Examining path program with hash 1195947485, occurence #1 [2025-01-24 00:24:05,518 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:24:05,518 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:24:05,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:24:05,518 INFO L85 PathProgramCache]: Analyzing trace with hash -740106580, now seen corresponding path program 1 times [2025-01-24 00:24:05,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:24:05,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974693212] [2025-01-24 00:24:05,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:24:05,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:24:05,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-24 00:24:05,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-24 00:24:05,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:24:05,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:24:05,548 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:24:05,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-24 00:24:05,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-24 00:24:05,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:24:05,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:24:05,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:24:05,588 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:24:05,588 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:24:05,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:24:05,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-01-24 00:24:05,590 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:24:05,590 WARN L246 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:24:05,590 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2025-01-24 00:24:05,631 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2025-01-24 00:24:05,633 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:24:05,661 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:24:05,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:24:05,661 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:24:05,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:24:09,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:24:09,495 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:24:09,495 INFO L139 ounterexampleChecker]: Examining path program with hash 1280590863, occurence #1 [2025-01-24 00:24:09,495 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:24:09,495 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:24:09,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:24:09,495 INFO L85 PathProgramCache]: Analyzing trace with hash 515074038, now seen corresponding path program 1 times [2025-01-24 00:24:09,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:24:09,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077752122] [2025-01-24 00:24:09,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:24:09,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:24:09,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-24 00:24:09,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-24 00:24:09,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:24:09,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:24:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:24:09,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:24:09,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077752122] [2025-01-24 00:24:09,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077752122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:24:09,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:24:09,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:24:09,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247038747] [2025-01-24 00:24:09,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:24:09,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:24:09,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:24:09,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:24:09,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:24:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:09,527 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:24:09,527 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) [2025-01-24 00:24:09,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:20,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-01-24 00:24:20,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:24:20,047 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:24:20,047 INFO L139 ounterexampleChecker]: Examining path program with hash -112344892, occurence #1 [2025-01-24 00:24:20,047 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:24:20,047 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:24:20,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:24:20,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1422412834, now seen corresponding path program 1 times [2025-01-24 00:24:20,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:24:20,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968538305] [2025-01-24 00:24:20,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:24:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:24:20,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-24 00:24:20,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-24 00:24:20,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:24:20,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:24:20,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:24:20,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:24:20,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968538305] [2025-01-24 00:24:20,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968538305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:24:20,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:24:20,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:24:20,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768972564] [2025-01-24 00:24:20,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:24:20,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:24:20,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:24:20,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:24:20,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:24:20,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:20,197 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:24:20,197 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) [2025-01-24 00:24:20,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:20,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:21,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:21,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:24:21,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-01-24 00:24:21,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:24:21,251 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:24:21,251 INFO L139 ounterexampleChecker]: Examining path program with hash -1702999701, occurence #1 [2025-01-24 00:24:21,251 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:24:21,251 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:24:21,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:24:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1935289316, now seen corresponding path program 2 times [2025-01-24 00:24:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:24:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828220275] [2025-01-24 00:24:21,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:24:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:24:21,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 382 statements into 1 equivalence classes. [2025-01-24 00:24:21,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-24 00:24:21,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:24:21,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:24:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:24:21,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:24:21,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828220275] [2025-01-24 00:24:21,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828220275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:24:21,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:24:21,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:24:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293459874] [2025-01-24 00:24:21,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:24:21,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:24:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:24:21,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:24:21,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:24:21,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:21,484 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:24:21,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) 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) [2025-01-24 00:24:21,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:21,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:24:21,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:25,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:25,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:24:25,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:24:25,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-01-24 00:24:25,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:24:25,371 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:24:25,371 INFO L139 ounterexampleChecker]: Examining path program with hash 715472781, occurence #1 [2025-01-24 00:24:25,371 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:24:25,371 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:24:25,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:24:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash 58813349, now seen corresponding path program 1 times [2025-01-24 00:24:25,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:24:25,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402621078] [2025-01-24 00:24:25,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:24:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:24:25,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-24 00:24:25,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-24 00:24:25,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:24:25,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:24:25,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:24:25,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-24 00:24:25,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-24 00:24:25,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:24:25,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:24:25,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:24:25,441 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:24:25,441 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:24:25,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:24:25,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-01-24 00:24:25,443 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:24:25,443 WARN L246 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:24:25,443 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2025-01-24 00:24:25,483 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2025-01-24 00:24:25,485 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:24:25,507 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:24:25,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:24:25,508 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:24:25,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:24:29,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:24:29,681 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:24:29,681 INFO L139 ounterexampleChecker]: Examining path program with hash 975824990, occurence #1 [2025-01-24 00:24:29,681 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:24:29,681 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:24:29,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:24:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1810795347, now seen corresponding path program 1 times [2025-01-24 00:24:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:24:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659266585] [2025-01-24 00:24:29,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:24:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:24:29,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-24 00:24:29,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-24 00:24:29,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:24:29,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:24:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:24:29,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:24:29,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659266585] [2025-01-24 00:24:29,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659266585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:24:29,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:24:29,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:24:29,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872686590] [2025-01-24 00:24:29,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:24:29,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:24:29,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:24:29,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:24:29,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:24:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:29,713 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:24:29,713 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) [2025-01-24 00:24:29,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:41,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-01-24 00:24:41,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:24:41,130 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:24:41,131 INFO L139 ounterexampleChecker]: Examining path program with hash -1319096629, occurence #1 [2025-01-24 00:24:41,131 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:24:41,131 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:24:41,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:24:41,131 INFO L85 PathProgramCache]: Analyzing trace with hash -26113498, now seen corresponding path program 1 times [2025-01-24 00:24:41,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:24:41,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574844171] [2025-01-24 00:24:41,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:24:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:24:41,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-01-24 00:24:41,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-01-24 00:24:41,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:24:41,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:24:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:24:41,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:24:41,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574844171] [2025-01-24 00:24:41,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574844171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:24:41,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:24:41,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:24:41,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614714891] [2025-01-24 00:24:41,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:24:41,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:24:41,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:24:41,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:24:41,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:24:41,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:41,290 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:24:41,290 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) [2025-01-24 00:24:41,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:41,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:24:42,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-01-24 00:24:42,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:24:42,239 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:24:42,240 INFO L139 ounterexampleChecker]: Examining path program with hash -1028095489, occurence #1 [2025-01-24 00:24:42,240 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:24:42,240 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:24:42,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:24:42,240 INFO L85 PathProgramCache]: Analyzing trace with hash -303948262, now seen corresponding path program 2 times [2025-01-24 00:24:42,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:24:42,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389218864] [2025-01-24 00:24:42,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:24:42,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:24:42,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 1 equivalence classes. [2025-01-24 00:24:42,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-01-24 00:24:42,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:24:42,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:24:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:24:42,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:24:42,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389218864] [2025-01-24 00:24:42,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389218864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:24:42,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:24:42,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:24:42,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019585548] [2025-01-24 00:24:42,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:24:42,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:24:42,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:24:42,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:24:42,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:24:42,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:42,495 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:24:42,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) 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) [2025-01-24 00:24:42,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:42,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:24:42,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:24:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:24:46,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-01-24 00:24:46,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:24:46,886 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:24:46,886 INFO L139 ounterexampleChecker]: Examining path program with hash -1059576269, occurence #1 [2025-01-24 00:24:46,886 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:24:46,886 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:24:46,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:24:46,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2130196961, now seen corresponding path program 1 times [2025-01-24 00:24:46,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:24:46,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828802976] [2025-01-24 00:24:46,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:24:46,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:24:46,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-24 00:24:46,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-24 00:24:46,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:24:46,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:24:46,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:24:46,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-24 00:24:46,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-24 00:24:46,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:24:46,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:24:46,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:24:46,960 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:24:46,960 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:24:46,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:24:46,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-01-24 00:24:46,962 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:24:46,962 WARN L246 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:24:46,962 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2025-01-24 00:24:46,998 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2025-01-24 00:24:47,001 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:24:47,026 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:24:47,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:24:47,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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:24:47,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:24:51,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:24:51,598 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:24:51,599 INFO L139 ounterexampleChecker]: Examining path program with hash 1725814876, occurence #1 [2025-01-24 00:24:51,599 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:24:51,599 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:24:51,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:24:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1822266544, now seen corresponding path program 1 times [2025-01-24 00:24:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:24:51,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927324005] [2025-01-24 00:24:51,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:24:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:24:51,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-24 00:24:51,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-24 00:24:51,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:24:51,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:24:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:24:51,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:24:51,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927324005] [2025-01-24 00:24:51,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927324005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:24:51,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:24:51,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:24:51,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865875637] [2025-01-24 00:24:51,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:24:51,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:24:51,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:24:51,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:24:51,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:24:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:24:51,631 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:24:51,631 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) [2025-01-24 00:24:51,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:04,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-01-24 00:25:04,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:25:04,270 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:25:04,270 INFO L139 ounterexampleChecker]: Examining path program with hash 1624944766, occurence #1 [2025-01-24 00:25:04,270 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:25:04,270 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:25:04,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:25:04,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1182881816, now seen corresponding path program 1 times [2025-01-24 00:25:04,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:25:04,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861900400] [2025-01-24 00:25:04,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:25:04,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:25:04,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-01-24 00:25:04,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-24 00:25:04,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:25:04,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:25:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:25:04,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:25:04,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861900400] [2025-01-24 00:25:04,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861900400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:25:04,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:25:04,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:25:04,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484057395] [2025-01-24 00:25:04,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:25:04,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:25:04,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:25:04,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:25:04,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:25:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:04,440 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:25:04,440 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) [2025-01-24 00:25:04,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:04,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:05,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:05,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:25:05,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-01-24 00:25:05,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:25:05,445 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:25:05,445 INFO L139 ounterexampleChecker]: Examining path program with hash -666851092, occurence #1 [2025-01-24 00:25:05,445 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:25:05,445 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:25:05,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:25:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash 484040798, now seen corresponding path program 2 times [2025-01-24 00:25:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:25:05,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678239054] [2025-01-24 00:25:05,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:25:05,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:25:05,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 422 statements into 1 equivalence classes. [2025-01-24 00:25:05,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-24 00:25:05,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:25:05,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:25:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:25:05,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:25:05,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678239054] [2025-01-24 00:25:05,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678239054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:25:05,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:25:05,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:25:05,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057526226] [2025-01-24 00:25:05,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:25:05,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:25:05,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:25:05,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:25:05,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:25:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:05,707 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:25:05,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) 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) [2025-01-24 00:25:05,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:05,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:25:05,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:25:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:25:10,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-01-24 00:25:10,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:25:10,420 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:25:10,420 INFO L139 ounterexampleChecker]: Examining path program with hash 957323225, occurence #1 [2025-01-24 00:25:10,420 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:25:10,420 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:25:10,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:25:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1073281603, now seen corresponding path program 1 times [2025-01-24 00:25:10,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:25:10,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653316300] [2025-01-24 00:25:10,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:25:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:25:10,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-24 00:25:10,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-24 00:25:10,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:25:10,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:25:10,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:25:10,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-24 00:25:10,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-24 00:25:10,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:25:10,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:25:10,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:25:10,508 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:25:10,508 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:25:10,508 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:25:10,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-01-24 00:25:10,510 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:25:10,510 WARN L246 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:25:10,510 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2025-01-24 00:25:10,549 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2025-01-24 00:25:10,552 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:25:10,580 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:25:10,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:25:10,582 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:25:10,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:25:15,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:25:15,676 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:25:15,676 INFO L139 ounterexampleChecker]: Examining path program with hash 472565346, occurence #1 [2025-01-24 00:25:15,676 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:25:15,676 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:25:15,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:25:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1289317526, now seen corresponding path program 1 times [2025-01-24 00:25:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:25:15,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108676545] [2025-01-24 00:25:15,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:25:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:25:15,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-24 00:25:15,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-24 00:25:15,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:25:15,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:25:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:25:15,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:25:15,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108676545] [2025-01-24 00:25:15,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108676545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:25:15,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:25:15,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:25:15,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711941264] [2025-01-24 00:25:15,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:25:15,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:25:15,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:25:15,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:25:15,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:25:15,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:15,711 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:25:15,711 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) [2025-01-24 00:25:15,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:29,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-01-24 00:25:29,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:25:29,181 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:25:29,181 INFO L139 ounterexampleChecker]: Examining path program with hash -1428367807, occurence #1 [2025-01-24 00:25:29,181 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:25:29,181 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:25:29,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:25:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash 671536857, now seen corresponding path program 1 times [2025-01-24 00:25:29,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:25:29,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922292124] [2025-01-24 00:25:29,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:25:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:25:29,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-24 00:25:29,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-24 00:25:29,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:25:29,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:25:29,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:25:29,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:25:29,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922292124] [2025-01-24 00:25:29,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922292124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:25:29,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:25:29,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:25:29,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589246358] [2025-01-24 00:25:29,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:25:29,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:25:29,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:25:29,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:25:29,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:25:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:29,363 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:25:29,363 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) [2025-01-24 00:25:29,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:29,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:30,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:30,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:25:30,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-01-24 00:25:30,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:25:30,370 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:25:30,370 INFO L139 ounterexampleChecker]: Examining path program with hash -582496457, occurence #1 [2025-01-24 00:25:30,370 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:25:30,370 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:25:30,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:25:30,371 INFO L85 PathProgramCache]: Analyzing trace with hash -505924239, now seen corresponding path program 2 times [2025-01-24 00:25:30,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:25:30,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631352399] [2025-01-24 00:25:30,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:25:30,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:25:30,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 442 statements into 1 equivalence classes. [2025-01-24 00:25:30,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-24 00:25:30,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:25:30,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:25:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:25:30,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:25:30,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631352399] [2025-01-24 00:25:30,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631352399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:25:30,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:25:30,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:25:30,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205554348] [2025-01-24 00:25:30,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:25:30,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:25:30,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:25:30,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:25:30,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:25:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:30,649 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:25:30,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) 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) [2025-01-24 00:25:30,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:30,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:25:30,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:25:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:25:35,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-01-24 00:25:35,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:25:35,918 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:25:35,918 INFO L139 ounterexampleChecker]: Examining path program with hash -2110640385, occurence #1 [2025-01-24 00:25:35,918 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:25:35,918 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:25:35,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:25:35,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1582580372, now seen corresponding path program 1 times [2025-01-24 00:25:35,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:25:35,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508529300] [2025-01-24 00:25:35,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:25:35,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:25:35,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-24 00:25:35,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-24 00:25:35,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:25:35,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:25:35,950 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:25:35,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-24 00:25:35,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-24 00:25:35,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:25:35,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:25:36,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:25:36,001 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:25:36,001 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:25:36,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:25:36,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-01-24 00:25:36,002 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:25:36,003 WARN L246 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:25:36,003 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2025-01-24 00:25:36,042 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2025-01-24 00:25:36,045 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:25:36,078 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:25:36,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:25:36,078 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:25:36,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:25:41,524 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:25:41,525 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:25:41,525 INFO L139 ounterexampleChecker]: Examining path program with hash -610026888, occurence #1 [2025-01-24 00:25:41,525 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:25:41,525 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:25:41,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:25:41,525 INFO L85 PathProgramCache]: Analyzing trace with hash -504724318, now seen corresponding path program 1 times [2025-01-24 00:25:41,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:25:41,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588802320] [2025-01-24 00:25:41,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:25:41,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:25:41,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-24 00:25:41,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-24 00:25:41,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:25:41,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:25:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:25:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:25:41,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588802320] [2025-01-24 00:25:41,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588802320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:25:41,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:25:41,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:25:41,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404373253] [2025-01-24 00:25:41,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:25:41,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:25:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:25:41,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:25:41,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:25:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:41,562 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:25:41,562 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) [2025-01-24 00:25:41,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:56,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-01-24 00:25:56,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:25:56,077 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:25:56,078 INFO L139 ounterexampleChecker]: Examining path program with hash -121881695, occurence #1 [2025-01-24 00:25:56,078 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:25:56,078 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:25:56,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:25:56,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1644557181, now seen corresponding path program 1 times [2025-01-24 00:25:56,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:25:56,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140129082] [2025-01-24 00:25:56,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:25:56,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:25:56,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-01-24 00:25:56,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-24 00:25:56,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:25:56,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:25:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:25:56,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:25:56,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140129082] [2025-01-24 00:25:56,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140129082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:25:56,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:25:56,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:25:56,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177719920] [2025-01-24 00:25:56,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:25:56,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:25:56,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:25:56,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:25:56,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:25:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:56,264 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:25:56,264 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) [2025-01-24 00:25:56,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:56,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:25:57,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-01-24 00:25:57,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:25:57,292 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:25:57,292 INFO L139 ounterexampleChecker]: Examining path program with hash 1340781931, occurence #1 [2025-01-24 00:25:57,292 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:25:57,292 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:25:57,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:25:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash 858294999, now seen corresponding path program 2 times [2025-01-24 00:25:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:25:57,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892223972] [2025-01-24 00:25:57,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:25:57,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:25:57,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 462 statements into 1 equivalence classes. [2025-01-24 00:25:57,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-01-24 00:25:57,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:25:57,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:25:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:25:57,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:25:57,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892223972] [2025-01-24 00:25:57,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892223972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:25:57,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:25:57,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:25:57,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554508912] [2025-01-24 00:25:57,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:25:57,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:25:57,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:25:57,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:25:57,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:25:57,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:57,710 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:25:57,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) 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) [2025-01-24 00:25:57,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:25:57,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:25:57,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:03,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:03,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:26:03,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:26:03,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-01-24 00:26:03,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:26:03,546 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:26:03,546 INFO L139 ounterexampleChecker]: Examining path program with hash -83583618, occurence #1 [2025-01-24 00:26:03,546 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:26:03,546 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:26:03,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:26:03,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1905115785, now seen corresponding path program 1 times [2025-01-24 00:26:03,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:26:03,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563405138] [2025-01-24 00:26:03,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:26:03,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:26:03,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-24 00:26:03,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-24 00:26:03,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:26:03,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:26:03,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:26:03,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-24 00:26:03,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-24 00:26:03,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:26:03,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:26:03,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:26:03,638 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:26:03,638 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:26:03,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:26:03,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-01-24 00:26:03,639 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:26:03,639 WARN L246 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:26:03,639 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2025-01-24 00:26:03,678 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2025-01-24 00:26:03,681 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:26:03,712 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:26:03,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:26:03,712 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:26:03,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:26:09,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:26:09,636 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:26:09,636 INFO L139 ounterexampleChecker]: Examining path program with hash 89771000, occurence #1 [2025-01-24 00:26:09,636 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:26:09,636 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:26:09,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:26:09,636 INFO L85 PathProgramCache]: Analyzing trace with hash -824558373, now seen corresponding path program 1 times [2025-01-24 00:26:09,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:26:09,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167306697] [2025-01-24 00:26:09,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:26:09,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:26:09,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-24 00:26:09,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-24 00:26:09,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:26:09,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:26:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:26:09,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:26:09,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167306697] [2025-01-24 00:26:09,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167306697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:26:09,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:26:09,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:26:09,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140158408] [2025-01-24 00:26:09,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:26:09,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:26:09,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:26:09,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:26:09,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:26:09,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:09,675 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:26:09,675 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) [2025-01-24 00:26:09,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:25,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-01-24 00:26:25,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:26:25,348 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:26:25,348 INFO L139 ounterexampleChecker]: Examining path program with hash 1990111282, occurence #1 [2025-01-24 00:26:25,348 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:26:25,348 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:26:25,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:26:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash 560421081, now seen corresponding path program 1 times [2025-01-24 00:26:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:26:25,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82917127] [2025-01-24 00:26:25,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:26:25,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:26:25,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-01-24 00:26:25,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-01-24 00:26:25,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:26:25,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:26:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:26:25,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:26:25,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82917127] [2025-01-24 00:26:25,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82917127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:26:25,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:26:25,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:26:25,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366264916] [2025-01-24 00:26:25,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:26:25,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:26:25,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:26:25,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:26:25,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:26:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:25,546 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:26:25,546 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) [2025-01-24 00:26:25,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:25,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:26,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:26,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:26:26,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-01-24 00:26:26,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:26:26,543 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:26:26,543 INFO L139 ounterexampleChecker]: Examining path program with hash 1254140500, occurence #1 [2025-01-24 00:26:26,543 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:26:26,543 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:26:26,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:26:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash -766128819, now seen corresponding path program 2 times [2025-01-24 00:26:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:26:26,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593125687] [2025-01-24 00:26:26,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:26:26,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:26:26,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 482 statements into 1 equivalence classes. [2025-01-24 00:26:26,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-01-24 00:26:26,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:26:26,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:26:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:26:26,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:26:26,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593125687] [2025-01-24 00:26:26,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593125687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:26:26,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:26:26,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:26:26,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960621313] [2025-01-24 00:26:26,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:26:26,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:26:26,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:26:26,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:26:26,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:26:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:26,851 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:26:26,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) 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) [2025-01-24 00:26:26,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:26,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:26:26,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:32,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:32,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:26:32,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:26:32,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-01-24 00:26:32,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:26:32,902 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:26:32,903 INFO L139 ounterexampleChecker]: Examining path program with hash -1365101793, occurence #1 [2025-01-24 00:26:32,903 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:26:32,903 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:26:32,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:26:32,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1981060132, now seen corresponding path program 1 times [2025-01-24 00:26:32,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:26:32,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060733529] [2025-01-24 00:26:32,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:26:32,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:26:32,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-24 00:26:32,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-24 00:26:32,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:26:32,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:26:32,947 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:26:32,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-24 00:26:32,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-24 00:26:32,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:26:32,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:26:33,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:26:33,008 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:26:33,008 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:26:33,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:26:33,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-01-24 00:26:33,010 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:26:33,010 WARN L246 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:26:33,010 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2025-01-24 00:26:33,049 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2025-01-24 00:26:33,051 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:26:33,084 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:26:33,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:26:33,085 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:26:33,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:26:39,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:26:39,540 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:26:39,540 INFO L139 ounterexampleChecker]: Examining path program with hash -425548628, occurence #1 [2025-01-24 00:26:39,540 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:26:39,540 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:26:39,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:26:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1658934918, now seen corresponding path program 1 times [2025-01-24 00:26:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:26:39,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785503643] [2025-01-24 00:26:39,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:26:39,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:26:39,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-24 00:26:39,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-24 00:26:39,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:26:39,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:26:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:26:39,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:26:39,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785503643] [2025-01-24 00:26:39,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785503643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:26:39,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:26:39,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:26:39,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650850495] [2025-01-24 00:26:39,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:26:39,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:26:39,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:26:39,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:26:39,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:26:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:39,582 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:26:39,582 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) [2025-01-24 00:26:39,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:56,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-01-24 00:26:56,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:26:56,339 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:26:56,340 INFO L139 ounterexampleChecker]: Examining path program with hash 259460086, occurence #1 [2025-01-24 00:26:56,340 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:26:56,340 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:26:56,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:26:56,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1242057446, now seen corresponding path program 1 times [2025-01-24 00:26:56,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:26:56,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012420448] [2025-01-24 00:26:56,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:26:56,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:26:56,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-01-24 00:26:56,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-24 00:26:56,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:26:56,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:26:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:26:56,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:26:56,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012420448] [2025-01-24 00:26:56,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012420448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:26:56,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:26:56,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:26:56,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840473413] [2025-01-24 00:26:56,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:26:56,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:26:56,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:26:56,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:26:56,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:26:56,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:56,554 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:26:56,554 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) [2025-01-24 00:26:56,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:56,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:57,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:26:57,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-01-24 00:26:57,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:26:57,667 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:26:57,667 INFO L139 ounterexampleChecker]: Examining path program with hash -1297511110, occurence #1 [2025-01-24 00:26:57,667 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:26:57,667 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:26:57,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:26:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1763836230, now seen corresponding path program 2 times [2025-01-24 00:26:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:26:57,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035166893] [2025-01-24 00:26:57,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:26:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:26:57,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 502 statements into 1 equivalence classes. [2025-01-24 00:26:57,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-01-24 00:26:57,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:26:57,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:26:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:26:58,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:26:58,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035166893] [2025-01-24 00:26:58,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035166893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:26:58,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:26:58,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:26:58,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7734055] [2025-01-24 00:26:58,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:26:58,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:26:58,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:26:58,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:26:58,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:26:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:58,133 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:26:58,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) 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) [2025-01-24 00:26:58,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:26:58,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:26:58,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:27:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:27:04,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-01-24 00:27:04,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:27:04,877 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:27:04,877 INFO L139 ounterexampleChecker]: Examining path program with hash 1405442341, occurence #1 [2025-01-24 00:27:04,877 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:27:04,877 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:27:04,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:27:04,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1284660936, now seen corresponding path program 1 times [2025-01-24 00:27:04,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:27:04,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487837672] [2025-01-24 00:27:04,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:27:04,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:27:04,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-24 00:27:04,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-24 00:27:04,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:27:04,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:27:04,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:27:04,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-24 00:27:04,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-24 00:27:04,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:27:04,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:27:04,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:27:04,979 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:27:04,979 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:27:04,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:27:04,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-01-24 00:27:04,981 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:27:04,981 WARN L246 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:27:04,981 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2025-01-24 00:27:05,023 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2025-01-24 00:27:05,026 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:27:05,056 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:27:05,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:27:05,056 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:27:05,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:27:11,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:27:11,911 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:27:11,911 INFO L139 ounterexampleChecker]: Examining path program with hash 620664218, occurence #1 [2025-01-24 00:27:11,911 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:27:11,911 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:27:11,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:27:11,911 INFO L85 PathProgramCache]: Analyzing trace with hash 61078420, now seen corresponding path program 1 times [2025-01-24 00:27:11,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:27:11,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848242248] [2025-01-24 00:27:11,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:27:11,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:27:11,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-01-24 00:27:11,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-01-24 00:27:11,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:27:11,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:27:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:27:11,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:27:11,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848242248] [2025-01-24 00:27:11,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848242248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:27:11,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:27:11,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:27:11,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954720133] [2025-01-24 00:27:11,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:27:11,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:27:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:27:11,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:27:11,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:27:11,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:11,955 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:27:11,955 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) [2025-01-24 00:27:11,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:30,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-01-24 00:27:30,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:27:30,706 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:27:30,707 INFO L139 ounterexampleChecker]: Examining path program with hash -1541467844, occurence #1 [2025-01-24 00:27:30,707 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:27:30,707 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:27:30,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:27:30,707 INFO L85 PathProgramCache]: Analyzing trace with hash 335084882, now seen corresponding path program 1 times [2025-01-24 00:27:30,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:27:30,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260908499] [2025-01-24 00:27:30,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:27:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:27:30,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-01-24 00:27:30,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-01-24 00:27:30,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:27:30,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:27:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:27:30,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:27:30,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260908499] [2025-01-24 00:27:30,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260908499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:27:30,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:27:30,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:27:30,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820049490] [2025-01-24 00:27:30,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:27:30,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:27:30,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:27:30,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:27:30,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:27:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:30,925 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:27:30,926 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) [2025-01-24 00:27:30,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:30,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:32,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:32,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:27:32,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-01-24 00:27:32,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:27:32,014 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:27:32,015 INFO L139 ounterexampleChecker]: Examining path program with hash -1731456440, occurence #1 [2025-01-24 00:27:32,015 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:27:32,015 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:27:32,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:27:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1233544462, now seen corresponding path program 2 times [2025-01-24 00:27:32,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:27:32,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151159241] [2025-01-24 00:27:32,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:27:32,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:27:32,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 522 statements into 1 equivalence classes. [2025-01-24 00:27:32,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-01-24 00:27:32,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:27:32,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:27:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:27:32,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:27:32,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151159241] [2025-01-24 00:27:32,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151159241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:27:32,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:27:32,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:27:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140023061] [2025-01-24 00:27:32,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:27:32,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:27:32,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:27:32,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:27:32,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:27:32,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:32,477 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:27:32,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) 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) [2025-01-24 00:27:32,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:32,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:27:32,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:39,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:39,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:27:39,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:27:39,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-01-24 00:27:39,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:27:39,945 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:27:39,945 INFO L139 ounterexampleChecker]: Examining path program with hash -1067646038, occurence #1 [2025-01-24 00:27:39,945 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:27:39,945 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:27:39,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:27:39,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1235440968, now seen corresponding path program 1 times [2025-01-24 00:27:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:27:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002676035] [2025-01-24 00:27:39,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:27:39,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:27:39,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-01-24 00:27:39,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-01-24 00:27:39,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:27:39,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:27:39,986 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:27:39,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-01-24 00:27:40,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-01-24 00:27:40,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:27:40,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:27:40,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:27:40,057 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:27:40,057 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:27:40,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:27:40,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-01-24 00:27:40,059 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:27:40,059 WARN L246 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:27:40,060 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2025-01-24 00:27:40,107 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2025-01-24 00:27:40,110 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:27:40,147 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:27:40,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:27:40,148 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:27:40,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:27:48,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:27:48,024 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:27:48,025 INFO L139 ounterexampleChecker]: Examining path program with hash -592147916, occurence #1 [2025-01-24 00:27:48,025 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:27:48,025 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:27:48,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:27:48,025 INFO L85 PathProgramCache]: Analyzing trace with hash 810946788, now seen corresponding path program 1 times [2025-01-24 00:27:48,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:27:48,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504081163] [2025-01-24 00:27:48,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:27:48,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:27:48,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-24 00:27:48,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-24 00:27:48,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:27:48,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:27:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:27:48,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:27:48,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504081163] [2025-01-24 00:27:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504081163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:27:48,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:27:48,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:27:48,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050241312] [2025-01-24 00:27:48,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:27:48,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:27:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:27:48,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:27:48,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:27:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:27:48,070 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:27:48,071 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) [2025-01-24 00:27:48,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:09,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:09,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-01-24 00:28:09,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:28:09,390 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:28:09,390 INFO L139 ounterexampleChecker]: Examining path program with hash 2123689578, occurence #1 [2025-01-24 00:28:09,390 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:28:09,390 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:28:09,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:28:09,390 INFO L85 PathProgramCache]: Analyzing trace with hash 823240753, now seen corresponding path program 1 times [2025-01-24 00:28:09,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:28:09,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607829330] [2025-01-24 00:28:09,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:28:09,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:28:09,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-01-24 00:28:09,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-01-24 00:28:09,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:28:09,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:28:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:28:09,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:28:09,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607829330] [2025-01-24 00:28:09,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607829330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:28:09,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:28:09,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:28:09,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914794491] [2025-01-24 00:28:09,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:28:09,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:28:09,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:28:09,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:28:09,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:28:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:09,628 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:28:09,628 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) [2025-01-24 00:28:09,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:09,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:10,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:10,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:28:10,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-01-24 00:28:10,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:28:10,794 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:28:10,795 INFO L139 ounterexampleChecker]: Examining path program with hash 110997314, occurence #1 [2025-01-24 00:28:10,795 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:28:10,795 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:28:10,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:28:10,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1191340319, now seen corresponding path program 2 times [2025-01-24 00:28:10,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:28:10,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034939778] [2025-01-24 00:28:10,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:28:10,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:28:10,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 542 statements into 1 equivalence classes. [2025-01-24 00:28:10,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-01-24 00:28:10,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:28:10,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:28:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:28:11,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:28:11,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034939778] [2025-01-24 00:28:11,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034939778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:28:11,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:28:11,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:28:11,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655666215] [2025-01-24 00:28:11,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:28:11,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:28:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:28:11,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:28:11,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:28:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:11,156 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:28:11,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) 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) [2025-01-24 00:28:11,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:11,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:28:11,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:28:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:28:19,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-01-24 00:28:19,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:28:19,103 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:28:19,104 INFO L139 ounterexampleChecker]: Examining path program with hash 1831431893, occurence #1 [2025-01-24 00:28:19,104 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:28:19,104 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:28:19,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:28:19,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1395409210, now seen corresponding path program 1 times [2025-01-24 00:28:19,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:28:19,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366595441] [2025-01-24 00:28:19,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:28:19,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:28:19,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-24 00:28:19,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-24 00:28:19,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:28:19,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:28:19,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:28:19,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-24 00:28:19,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-24 00:28:19,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:28:19,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:28:19,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:28:19,220 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:28:19,220 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:28:19,220 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:28:19,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-01-24 00:28:19,222 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:28:19,222 WARN L246 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:28:19,223 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2025-01-24 00:28:19,276 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2025-01-24 00:28:19,279 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:28:19,315 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:28:19,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:28:19,315 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:28:19,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:28:27,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:28:27,395 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:28:27,395 INFO L139 ounterexampleChecker]: Examining path program with hash 1167923457, occurence #1 [2025-01-24 00:28:27,395 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:28:27,395 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:28:27,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:28:27,395 INFO L85 PathProgramCache]: Analyzing trace with hash 858456989, now seen corresponding path program 1 times [2025-01-24 00:28:27,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:28:27,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793533969] [2025-01-24 00:28:27,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:28:27,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:28:27,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-01-24 00:28:27,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-01-24 00:28:27,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:28:27,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:28:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:28:27,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:28:27,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793533969] [2025-01-24 00:28:27,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793533969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:28:27,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:28:27,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:28:27,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004400416] [2025-01-24 00:28:27,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:28:27,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:28:27,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:28:27,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:28:27,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:28:27,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:27,442 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:28:27,442 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) [2025-01-24 00:28:27,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:48,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-01-24 00:28:48,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:28:48,621 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:28:48,622 INFO L139 ounterexampleChecker]: Examining path program with hash 1033037675, occurence #1 [2025-01-24 00:28:48,622 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:28:48,622 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:28:48,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:28:48,622 INFO L85 PathProgramCache]: Analyzing trace with hash -177343475, now seen corresponding path program 1 times [2025-01-24 00:28:48,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:28:48,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959520936] [2025-01-24 00:28:48,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:28:48,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:28:48,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-01-24 00:28:48,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-01-24 00:28:48,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:28:48,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:28:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:28:48,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:28:48,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959520936] [2025-01-24 00:28:48,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959520936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:28:48,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:28:48,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:28:48,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519944308] [2025-01-24 00:28:48,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:28:48,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:28:48,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:28:48,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:28:48,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:28:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:48,863 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:28:48,863 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) [2025-01-24 00:28:48,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:48,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:28:49,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-01-24 00:28:49,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:28:49,993 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:28:49,994 INFO L139 ounterexampleChecker]: Examining path program with hash 56496572, occurence #1 [2025-01-24 00:28:49,994 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:28:49,994 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:28:49,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:28:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash 166868151, now seen corresponding path program 2 times [2025-01-24 00:28:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:28:49,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747444504] [2025-01-24 00:28:49,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:28:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:28:50,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 562 statements into 1 equivalence classes. [2025-01-24 00:28:50,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-01-24 00:28:50,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:28:50,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:28:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:28:50,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:28:50,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747444504] [2025-01-24 00:28:50,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747444504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:28:50,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:28:50,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:28:50,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720974901] [2025-01-24 00:28:50,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:28:50,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:28:50,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:28:50,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:28:50,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:28:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:50,367 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:28:50,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) 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) [2025-01-24 00:28:50,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:50,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:28:50,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:28:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:28:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:28:59,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-01-24 00:28:59,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:28:59,205 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:28:59,205 INFO L139 ounterexampleChecker]: Examining path program with hash 1206148746, occurence #1 [2025-01-24 00:28:59,205 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:28:59,205 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:28:59,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:28:59,206 INFO L85 PathProgramCache]: Analyzing trace with hash -749794879, now seen corresponding path program 1 times [2025-01-24 00:28:59,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:28:59,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707807532] [2025-01-24 00:28:59,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:28:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:28:59,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-24 00:28:59,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-24 00:28:59,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:28:59,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:28:59,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:28:59,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-24 00:28:59,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-24 00:28:59,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:28:59,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:28:59,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:28:59,325 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:28:59,326 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:28:59,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:28:59,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-01-24 00:28:59,327 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:28:59,328 WARN L246 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:28:59,328 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2025-01-24 00:28:59,377 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2025-01-24 00:28:59,380 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:28:59,415 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:28:59,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:28:59,416 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:28:59,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:29:08,074 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:29:08,074 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:29:08,074 INFO L139 ounterexampleChecker]: Examining path program with hash 105087321, occurence #1 [2025-01-24 00:29:08,074 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:29:08,074 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:29:08,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:29:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1370311030, now seen corresponding path program 1 times [2025-01-24 00:29:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:29:08,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384708180] [2025-01-24 00:29:08,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:29:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:29:08,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-24 00:29:08,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-24 00:29:08,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:29:08,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:29:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:29:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:29:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384708180] [2025-01-24 00:29:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384708180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:29:08,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:29:08,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:29:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358942146] [2025-01-24 00:29:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:29:08,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:29:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:29:08,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:29:08,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:29:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:29:08,123 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:29:08,123 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) [2025-01-24 00:29:08,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:29:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:29:30,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-01-24 00:29:30,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:29:30,491 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:29:30,491 INFO L139 ounterexampleChecker]: Examining path program with hash -983509221, occurence #1 [2025-01-24 00:29:30,491 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:29:30,491 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:29:30,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:29:30,492 INFO L85 PathProgramCache]: Analyzing trace with hash -105110219, now seen corresponding path program 1 times [2025-01-24 00:29:30,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:29:30,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833845169] [2025-01-24 00:29:30,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:29:30,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:29:30,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-01-24 00:29:30,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-01-24 00:29:30,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:29:30,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:29:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:29:30,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:29:30,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833845169] [2025-01-24 00:29:30,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833845169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:29:30,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:29:30,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:29:30,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347107387] [2025-01-24 00:29:30,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:29:30,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:29:30,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:29:30,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:29:30,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:29:30,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:29:30,736 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:29:30,736 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) [2025-01-24 00:29:30,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:29:30,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:29:31,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:29:31,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:29:31,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-01-24 00:29:31,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:29:31,984 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:29:31,984 INFO L139 ounterexampleChecker]: Examining path program with hash 1182266418, occurence #1 [2025-01-24 00:29:31,984 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:29:31,984 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:29:31,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:29:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash 184459101, now seen corresponding path program 2 times [2025-01-24 00:29:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:29:31,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958633686] [2025-01-24 00:29:31,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:29:31,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:29:32,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 582 statements into 1 equivalence classes. [2025-01-24 00:29:32,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-01-24 00:29:32,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:29:32,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:29:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:29:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:29:32,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958633686] [2025-01-24 00:29:32,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958633686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:29:32,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:29:32,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:29:32,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146862751] [2025-01-24 00:29:32,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:29:32,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:29:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:29:32,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:29:32,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:29:32,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:29:32,362 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:29:32,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) 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) [2025-01-24 00:29:32,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:29:32,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:29:32,363 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:29:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:29:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:29:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:29:41,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-01-24 00:29:41,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:29:41,727 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:29:41,727 INFO L139 ounterexampleChecker]: Examining path program with hash -1077176059, occurence #1 [2025-01-24 00:29:41,727 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:29:41,727 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:29:41,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:29:41,727 INFO L85 PathProgramCache]: Analyzing trace with hash -230113398, now seen corresponding path program 1 times [2025-01-24 00:29:41,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:29:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537804196] [2025-01-24 00:29:41,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:29:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:29:41,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-24 00:29:41,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-24 00:29:41,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:29:41,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:29:41,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:29:41,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-24 00:29:41,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-24 00:29:41,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:29:41,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:29:41,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:29:41,862 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:29:41,862 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:29:41,862 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:29:41,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-01-24 00:29:41,864 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:29:41,864 WARN L246 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:29:41,864 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2025-01-24 00:29:41,914 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2025-01-24 00:29:41,917 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:29:41,956 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:29:41,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:29:41,956 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:29:41,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:29:51,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:29:51,153 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:29:51,153 INFO L139 ounterexampleChecker]: Examining path program with hash 1513977057, occurence #1 [2025-01-24 00:29:51,153 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:29:51,153 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:29:51,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:29:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1054236270, now seen corresponding path program 1 times [2025-01-24 00:29:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:29:51,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079162426] [2025-01-24 00:29:51,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:29:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:29:51,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-24 00:29:51,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-24 00:29:51,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:29:51,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:29:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:29:51,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:29:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079162426] [2025-01-24 00:29:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079162426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:29:51,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:29:51,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:29:51,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603690590] [2025-01-24 00:29:51,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:29:51,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:29:51,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:29:51,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:29:51,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:29:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:29:51,205 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:29:51,205 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) [2025-01-24 00:29:51,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:30:14,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:30:14,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-01-24 00:30:14,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:30:14,760 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:30:14,760 INFO L139 ounterexampleChecker]: Examining path program with hash -2047220270, occurence #1 [2025-01-24 00:30:14,760 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:30:14,760 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:30:14,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:30:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash -806063502, now seen corresponding path program 1 times [2025-01-24 00:30:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:30:14,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355309888] [2025-01-24 00:30:14,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:30:14,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:30:14,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-01-24 00:30:14,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-01-24 00:30:14,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:30:14,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:30:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:30:15,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:30:15,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355309888] [2025-01-24 00:30:15,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355309888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:30:15,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:30:15,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:30:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594479548] [2025-01-24 00:30:15,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:30:15,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:30:15,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:30:15,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:30:15,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:30:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:30:15,016 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:30:15,016 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) [2025-01-24 00:30:15,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:30:15,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:30:16,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:30:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:30:16,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2025-01-24 00:30:16,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:30:16,238 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:30:16,239 INFO L139 ounterexampleChecker]: Examining path program with hash -1948092601, occurence #1 [2025-01-24 00:30:16,239 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:30:16,239 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:30:16,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:30:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1418278616, now seen corresponding path program 2 times [2025-01-24 00:30:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:30:16,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103637463] [2025-01-24 00:30:16,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:30:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:30:16,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 602 statements into 1 equivalence classes. [2025-01-24 00:30:16,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-01-24 00:30:16,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:30:16,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:30:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:30:16,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:30:16,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103637463] [2025-01-24 00:30:16,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103637463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:30:16,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:30:16,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:30:16,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176156533] [2025-01-24 00:30:16,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:30:16,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:30:16,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:30:16,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:30:16,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:30:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:30:16,633 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:30:16,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.0) 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) [2025-01-24 00:30:16,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:30:16,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:30:16,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:30:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:30:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:30:26,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:30:26,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-01-24 00:30:26,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:30:26,506 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:30:26,506 INFO L139 ounterexampleChecker]: Examining path program with hash -890958596, occurence #1 [2025-01-24 00:30:26,506 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:30:26,506 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:30:26,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:30:26,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2003608668, now seen corresponding path program 1 times [2025-01-24 00:30:26,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:30:26,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135647250] [2025-01-24 00:30:26,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:30:26,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:30:26,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-24 00:30:26,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-24 00:30:26,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:30:26,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:30:26,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:30:26,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-01-24 00:30:26,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-01-24 00:30:26,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:30:26,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:30:26,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:30:26,654 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:30:26,654 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:30:26,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:30:26,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2025-01-24 00:30:26,657 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:30:26,657 WARN L246 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:30:26,657 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2025-01-24 00:30:26,706 INFO L143 ThreadInstanceAdder]: Constructed 32 joinOtherThreadTransitions. [2025-01-24 00:30:26,709 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:30:26,745 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:30:26,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:30:26,745 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:30:26,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:30:36,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:30:36,391 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:30:36,392 INFO L139 ounterexampleChecker]: Examining path program with hash 568818416, occurence #1 [2025-01-24 00:30:36,392 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:30:36,392 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:30:36,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:30:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2006184302, now seen corresponding path program 1 times [2025-01-24 00:30:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:30:36,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583387780] [2025-01-24 00:30:36,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:30:36,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:30:36,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-24 00:30:36,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-24 00:30:36,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:30:36,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:30:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:30:36,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:30:36,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583387780] [2025-01-24 00:30:36,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583387780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:30:36,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:30:36,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:30:36,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780120303] [2025-01-24 00:30:36,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:30:36,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:30:36,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:30:36,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:30:36,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:30:36,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:30:36,446 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:30:36,446 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) [2025-01-24 00:30:36,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:02,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:02,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-01-24 00:31:02,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:31:02,077 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:31:02,077 INFO L139 ounterexampleChecker]: Examining path program with hash 992885704, occurence #1 [2025-01-24 00:31:02,077 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:31:02,077 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:31:02,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:31:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1091413183, now seen corresponding path program 1 times [2025-01-24 00:31:02,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:31:02,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124366498] [2025-01-24 00:31:02,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:31:02,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:31:02,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-01-24 00:31:02,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-01-24 00:31:02,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:31:02,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:31:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:31:02,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:31:02,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124366498] [2025-01-24 00:31:02,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124366498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:31:02,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:31:02,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:31:02,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257923417] [2025-01-24 00:31:02,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:31:02,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:31:02,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:31:02,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:31:02,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:31:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:02,350 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:31:02,350 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) [2025-01-24 00:31:02,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:02,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:03,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:03,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:31:03,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-01-24 00:31:03,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:31:03,547 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:31:03,548 INFO L139 ounterexampleChecker]: Examining path program with hash -803894701, occurence #1 [2025-01-24 00:31:03,548 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:31:03,548 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:31:03,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:31:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash -521263165, now seen corresponding path program 2 times [2025-01-24 00:31:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:31:03,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664042993] [2025-01-24 00:31:03,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:31:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:31:03,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 622 statements into 1 equivalence classes. [2025-01-24 00:31:03,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-01-24 00:31:03,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:31:03,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:31:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:31:03,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:31:03,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664042993] [2025-01-24 00:31:03,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664042993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:31:03,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:31:03,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:31:03,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803423685] [2025-01-24 00:31:03,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:31:03,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:31:03,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:31:03,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:31:03,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:31:03,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:03,961 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:31:03,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.5) 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) [2025-01-24 00:31:03,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:03,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:31:03,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:14,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:14,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:31:14,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:31:14,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-01-24 00:31:14,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:31:14,465 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:31:14,466 INFO L139 ounterexampleChecker]: Examining path program with hash -203585909, occurence #1 [2025-01-24 00:31:14,466 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:31:14,466 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:31:14,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:31:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1773482251, now seen corresponding path program 1 times [2025-01-24 00:31:14,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:31:14,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006485983] [2025-01-24 00:31:14,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:31:14,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:31:14,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-24 00:31:14,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-24 00:31:14,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:31:14,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:31:14,518 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:31:14,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-24 00:31:14,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-24 00:31:14,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:31:14,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:31:14,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:31:14,616 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:31:14,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:31:14,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:31:14,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-01-24 00:31:14,618 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:31:14,619 WARN L246 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:31:14,619 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2025-01-24 00:31:14,671 INFO L143 ThreadInstanceAdder]: Constructed 33 joinOtherThreadTransitions. [2025-01-24 00:31:14,675 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:31:14,716 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:31:14,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:31:14,717 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:31:14,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:31:25,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:31:25,080 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:31:25,080 INFO L139 ounterexampleChecker]: Examining path program with hash -217647926, occurence #1 [2025-01-24 00:31:25,080 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:31:25,080 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:31:25,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:31:25,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1402480671, now seen corresponding path program 1 times [2025-01-24 00:31:25,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:31:25,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484175647] [2025-01-24 00:31:25,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:31:25,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:31:25,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-24 00:31:25,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-24 00:31:25,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:31:25,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:31:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:31:25,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:31:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484175647] [2025-01-24 00:31:25,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484175647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:31:25,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:31:25,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:31:25,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799512519] [2025-01-24 00:31:25,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:31:25,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:31:25,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:31:25,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:31:25,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:31:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:25,138 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:31:25,138 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) [2025-01-24 00:31:25,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:51,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-01-24 00:31:51,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:31:51,390 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:31:51,391 INFO L139 ounterexampleChecker]: Examining path program with hash 1161646560, occurence #1 [2025-01-24 00:31:51,391 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:31:51,391 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:31:51,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:31:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1126961990, now seen corresponding path program 1 times [2025-01-24 00:31:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:31:51,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127676957] [2025-01-24 00:31:51,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:31:51,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:31:51,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-01-24 00:31:51,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-01-24 00:31:51,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:31:51,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:31:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:31:51,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:31:51,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127676957] [2025-01-24 00:31:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127676957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:31:51,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:31:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:31:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345857683] [2025-01-24 00:31:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:31:51,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:31:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:31:51,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:31:51,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:31:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:51,682 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:31:51,682 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) [2025-01-24 00:31:51,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:51,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:31:52,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2025-01-24 00:31:52,915 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:31:52,915 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:31:52,916 INFO L139 ounterexampleChecker]: Examining path program with hash -900072354, occurence #1 [2025-01-24 00:31:52,916 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:31:52,916 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:31:52,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:31:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1291475928, now seen corresponding path program 2 times [2025-01-24 00:31:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:31:52,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103787929] [2025-01-24 00:31:52,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:31:52,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:31:52,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 642 statements into 1 equivalence classes. [2025-01-24 00:31:52,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-01-24 00:31:52,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:31:52,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:31:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:31:53,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:31:53,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103787929] [2025-01-24 00:31:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103787929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:31:53,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:31:53,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:31:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331880974] [2025-01-24 00:31:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:31:53,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:31:53,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:31:53,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:31:53,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:31:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:53,471 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:31:53,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.0) 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) [2025-01-24 00:31:53,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:31:53,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:31:53,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:32:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:32:04,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-01-24 00:32:04,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:32:04,575 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:32:04,576 INFO L139 ounterexampleChecker]: Examining path program with hash -1462457467, occurence #1 [2025-01-24 00:32:04,576 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:32:04,576 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:32:04,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:32:04,576 INFO L85 PathProgramCache]: Analyzing trace with hash -999166517, now seen corresponding path program 1 times [2025-01-24 00:32:04,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:32:04,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405196114] [2025-01-24 00:32:04,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:32:04,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:32:04,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-24 00:32:04,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-24 00:32:04,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:32:04,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:32:04,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:32:04,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-24 00:32:04,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-24 00:32:04,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:32:04,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:32:04,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:32:04,742 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:32:04,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:32:04,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:32:04,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-01-24 00:32:04,744 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:32:04,744 WARN L246 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:32:04,744 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2025-01-24 00:32:04,794 INFO L143 ThreadInstanceAdder]: Constructed 34 joinOtherThreadTransitions. [2025-01-24 00:32:04,799 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:32:04,836 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:32:04,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:32:04,836 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:32:04,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:32:15,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:32:15,762 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:32:15,762 INFO L139 ounterexampleChecker]: Examining path program with hash -855330006, occurence #1 [2025-01-24 00:32:15,762 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:32:15,762 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:32:15,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:32:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash -724719508, now seen corresponding path program 1 times [2025-01-24 00:32:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:32:15,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529413926] [2025-01-24 00:32:15,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:32:15,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:32:15,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-24 00:32:15,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-24 00:32:15,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:32:15,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:32:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:32:15,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:32:15,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529413926] [2025-01-24 00:32:15,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529413926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:32:15,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:32:15,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:32:15,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275593428] [2025-01-24 00:32:15,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:32:15,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:32:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:32:15,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:32:15,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:32:15,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:15,818 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:32:15,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 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) [2025-01-24 00:32:15,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:43,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-01-24 00:32:43,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:32:43,488 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:32:43,488 INFO L139 ounterexampleChecker]: Examining path program with hash 850834236, occurence #1 [2025-01-24 00:32:43,488 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:32:43,488 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:32:43,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:32:43,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1145356266, now seen corresponding path program 1 times [2025-01-24 00:32:43,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:32:43,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634270006] [2025-01-24 00:32:43,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:32:43,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:32:43,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-01-24 00:32:43,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-24 00:32:43,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:32:43,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:32:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:32:43,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:32:43,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634270006] [2025-01-24 00:32:43,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634270006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:32:43,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:32:43,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:32:43,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854099232] [2025-01-24 00:32:43,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:32:43,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:32:43,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:32:43,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:32:43,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:32:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:43,779 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:32:43,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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) [2025-01-24 00:32:43,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:43,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:44,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:44,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:32:44,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2025-01-24 00:32:44,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:32:44,980 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:32:44,981 INFO L139 ounterexampleChecker]: Examining path program with hash -621191329, occurence #1 [2025-01-24 00:32:44,981 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:32:44,981 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:32:44,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:32:44,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1094895382, now seen corresponding path program 2 times [2025-01-24 00:32:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:32:44,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127087142] [2025-01-24 00:32:44,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:32:44,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:32:45,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 662 statements into 1 equivalence classes. [2025-01-24 00:32:45,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-01-24 00:32:45,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:32:45,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:32:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:32:45,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:32:45,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127087142] [2025-01-24 00:32:45,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127087142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:32:45,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:32:45,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:32:45,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708479639] [2025-01-24 00:32:45,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:32:45,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:32:45,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:32:45,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:32:45,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:32:45,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:45,461 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:32:45,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.5) internal successors, (598), 3 states have internal predecessors, (598), 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) [2025-01-24 00:32:45,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:45,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:32:45,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:32:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:32:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:32:56,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2025-01-24 00:32:56,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:32:56,887 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:32:56,888 INFO L139 ounterexampleChecker]: Examining path program with hash -729308651, occurence #1 [2025-01-24 00:32:56,888 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:32:56,888 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:32:56,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:32:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1708448160, now seen corresponding path program 1 times [2025-01-24 00:32:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:32:56,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054243972] [2025-01-24 00:32:56,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:32:56,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:32:56,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-24 00:32:56,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-24 00:32:56,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:32:56,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:32:56,945 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:32:56,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-24 00:32:56,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-24 00:32:56,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:32:56,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:32:57,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:32:57,060 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:32:57,060 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:32:57,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:32:57,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2025-01-24 00:32:57,063 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:32:57,064 WARN L246 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:32:57,064 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2025-01-24 00:32:57,120 INFO L143 ThreadInstanceAdder]: Constructed 35 joinOtherThreadTransitions. [2025-01-24 00:32:57,123 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:32:57,168 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:32:57,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:32:57,168 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:32:57,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:33:08,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:33:08,787 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:33:08,787 INFO L139 ounterexampleChecker]: Examining path program with hash -1504757209, occurence #1 [2025-01-24 00:33:08,787 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:33:08,787 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:33:08,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:33:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2146030912, now seen corresponding path program 1 times [2025-01-24 00:33:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:33:08,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275753781] [2025-01-24 00:33:08,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:33:08,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:33:08,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-24 00:33:08,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-24 00:33:08,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:33:08,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:33:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:33:08,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:33:08,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275753781] [2025-01-24 00:33:08,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275753781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:33:08,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:33:08,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:33:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307286821] [2025-01-24 00:33:08,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:33:08,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:33:08,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:33:08,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:33:08,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:33:08,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:33:08,847 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:33:08,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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) [2025-01-24 00:33:08,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:33:39,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:33:39,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2025-01-24 00:33:39,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:33:39,081 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:33:39,081 INFO L139 ounterexampleChecker]: Examining path program with hash -1198501772, occurence #1 [2025-01-24 00:33:39,081 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:33:39,081 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:33:39,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:33:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1260939399, now seen corresponding path program 1 times [2025-01-24 00:33:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:33:39,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516437981] [2025-01-24 00:33:39,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:33:39,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:33:39,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-01-24 00:33:39,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-01-24 00:33:39,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:33:39,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:33:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:33:39,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:33:39,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516437981] [2025-01-24 00:33:39,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516437981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:33:39,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:33:39,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:33:39,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450951412] [2025-01-24 00:33:39,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:33:39,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:33:39,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:33:39,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:33:39,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:33:39,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:33:39,382 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:33:39,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 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) [2025-01-24 00:33:39,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:33:39,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:33:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:33:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:33:40,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2025-01-24 00:33:40,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:33:40,895 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:33:40,896 INFO L139 ounterexampleChecker]: Examining path program with hash 1608767888, occurence #1 [2025-01-24 00:33:40,896 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:33:40,896 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:33:40,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:33:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1651723043, now seen corresponding path program 2 times [2025-01-24 00:33:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:33:40,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656910935] [2025-01-24 00:33:40,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:33:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:33:40,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 682 statements into 1 equivalence classes. [2025-01-24 00:33:40,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-01-24 00:33:40,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:33:40,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:33:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:33:41,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:33:41,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656910935] [2025-01-24 00:33:41,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656910935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:33:41,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:33:41,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:33:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514873905] [2025-01-24 00:33:41,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:33:41,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:33:41,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:33:41,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:33:41,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:33:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:33:41,365 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:33:41,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 3 states have internal predecessors, (616), 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) [2025-01-24 00:33:41,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:33:41,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:33:41,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:33:53,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:33:53,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:33:53,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:33:53,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2025-01-24 00:33:53,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:33:53,996 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:33:53,996 INFO L139 ounterexampleChecker]: Examining path program with hash 169704834, occurence #1 [2025-01-24 00:33:53,996 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:33:53,996 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:33:53,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:33:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1946759702, now seen corresponding path program 1 times [2025-01-24 00:33:53,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:33:53,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097194142] [2025-01-24 00:33:53,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:33:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:33:54,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-24 00:33:54,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-24 00:33:54,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:33:54,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:33:54,052 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:33:54,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-24 00:33:54,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-24 00:33:54,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:33:54,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:33:54,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:33:54,169 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:33:54,169 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:33:54,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:33:54,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2025-01-24 00:33:54,172 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:33:54,172 WARN L246 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:33:54,172 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2025-01-24 00:33:54,229 INFO L143 ThreadInstanceAdder]: Constructed 36 joinOtherThreadTransitions. [2025-01-24 00:33:54,234 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:33:54,273 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:33:54,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:33:54,274 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:33:54,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-24 00:34:06,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:34:06,404 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:34:06,404 INFO L139 ounterexampleChecker]: Examining path program with hash 1017107353, occurence #1 [2025-01-24 00:34:06,404 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:34:06,404 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:34:06,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:34:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash -201044474, now seen corresponding path program 1 times [2025-01-24 00:34:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:34:06,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732502930] [2025-01-24 00:34:06,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:34:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:34:06,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-24 00:34:06,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-24 00:34:06,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:34:06,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:34:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:34:06,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:34:06,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732502930] [2025-01-24 00:34:06,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732502930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:34:06,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:34:06,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-24 00:34:06,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194896764] [2025-01-24 00:34:06,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:34:06,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-24 00:34:06,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:34:06,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-24 00:34:06,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-24 00:34:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:34:06,467 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:34:06,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.0) internal successors, (258), 2 states have internal predecessors, (258), 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) [2025-01-24 00:34:06,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:34:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:34:38,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2025-01-24 00:34:38,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:34:38,490 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:34:38,491 INFO L139 ounterexampleChecker]: Examining path program with hash 963240681, occurence #1 [2025-01-24 00:34:38,491 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:34:38,491 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:34:38,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:34:38,491 INFO L85 PathProgramCache]: Analyzing trace with hash -529934597, now seen corresponding path program 1 times [2025-01-24 00:34:38,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:34:38,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668453941] [2025-01-24 00:34:38,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:34:38,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:34:38,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-01-24 00:34:38,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-24 00:34:38,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:34:38,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:34:38,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:34:38,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:34:38,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668453941] [2025-01-24 00:34:38,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668453941] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:34:38,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:34:38,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:34:38,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793538341] [2025-01-24 00:34:38,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:34:38,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-24 00:34:38,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:34:38,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-24 00:34:38,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-24 00:34:38,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:34:38,813 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:34:38,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 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) [2025-01-24 00:34:38,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:34:38,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:34:40,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:34:40,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:34:40,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2025-01-24 00:34:40,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:34:40,040 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:34:40,040 INFO L139 ounterexampleChecker]: Examining path program with hash -2090938849, occurence #1 [2025-01-24 00:34:40,040 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:34:40,040 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:34:40,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:34:40,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1578744223, now seen corresponding path program 2 times [2025-01-24 00:34:40,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:34:40,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817683774] [2025-01-24 00:34:40,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-24 00:34:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:34:40,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 702 statements into 1 equivalence classes. [2025-01-24 00:34:40,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-01-24 00:34:40,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-24 00:34:40,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-24 00:34:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-24 00:34:40,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-24 00:34:40,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817683774] [2025-01-24 00:34:40,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817683774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-24 00:34:40,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-24 00:34:40,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-24 00:34:40,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561585490] [2025-01-24 00:34:40,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-24 00:34:40,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-24 00:34:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-24 00:34:40,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-24 00:34:40,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-24 00:34:40,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:34:40,633 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-24 00:34:40,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.5) internal successors, (634), 3 states have internal predecessors, (634), 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) [2025-01-24 00:34:40,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:34:40,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:34:40,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:34:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-24 00:34:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-24 00:34:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-24 00:34:54,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2025-01-24 00:34:54,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-24 00:34:54,272 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-24 00:34:54,273 INFO L139 ounterexampleChecker]: Examining path program with hash -1378867750, occurence #1 [2025-01-24 00:34:54,273 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-24 00:34:54,273 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-24 00:34:54,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-24 00:34:54,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1390590765, now seen corresponding path program 1 times [2025-01-24 00:34:54,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-24 00:34:54,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481266953] [2025-01-24 00:34:54,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-24 00:34:54,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-24 00:34:54,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-01-24 00:34:54,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-01-24 00:34:54,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:34:54,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:34:54,338 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-24 00:34:54,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-01-24 00:34:54,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-01-24 00:34:54,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-24 00:34:54,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-24 00:34:54,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-24 00:34:54,544 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-24 00:34:54,545 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-24 00:34:54,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-01-24 00:34:54,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2025-01-24 00:34:54,548 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-01-24 00:34:54,548 WARN L246 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-24 00:34:54,548 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2025-01-24 00:34:54,617 INFO L143 ThreadInstanceAdder]: Constructed 37 joinOtherThreadTransitions. [2025-01-24 00:34:54,620 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:34:54,676 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-24 00:34:54,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-24 00:34:54,678 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;@1318f630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-24 00:34:54,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. Killed by 15