./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 42d87675 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 02:41:09,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 02:41:10,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 02:41:10,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 02:41:10,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 02:41:10,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 02:41:10,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 02:41:10,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 02:41:10,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 02:41:10,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 02:41:10,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 02:41:10,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 02:41:10,038 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 02:41:10,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 02:41:10,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 02:41:10,039 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 02:41:10,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 02:41:10,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 02:41:10,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 02:41:10,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 02:41:10,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 02:41:10,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 02:41:10,039 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 02:41:10,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 02:41:10,040 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 02:41:10,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 02:41:10,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 02:41:10,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 02:41:10,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 02:41:10,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 02:41:10,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:41:10,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 02:41:10,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 02:41:10,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 02:41:10,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 02:41:10,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:41:10,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 02:41:10,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 02:41:10,041 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 02:41:10,041 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 02:41:10,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 02:41:10,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 02:41:10,041 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 02:41:10,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 02:41:10,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 02:41:10,042 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 02:41:10,042 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 02:41:10,042 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/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 -> 1eea0d699fc30cae440905f5eeea19b8e9e5d0b5cc249e9ffded8d356549b279 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-04-25 02:41:10,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 02:41:10,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 02:41:10,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 02:41:10,266 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 02:41:10,266 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 02:41:10,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i [2025-04-25 02:41:11,533 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3264388e5/f93ea475e1f241c6b42918b071384db0/FLAGd943330c9 [2025-04-25 02:41:11,804 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 02:41:11,805 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i [2025-04-25 02:41:11,820 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3264388e5/f93ea475e1f241c6b42918b071384db0/FLAGd943330c9 [2025-04-25 02:41:12,582 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/3264388e5/f93ea475e1f241c6b42918b071384db0 [2025-04-25 02:41:12,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 02:41:12,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 02:41:12,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 02:41:12,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 02:41:12,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 02:41:12,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709dfdbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12, skipping insertion in model container [2025-04-25 02:41:12,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 02:41:12,803 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i[30176,30189] [2025-04-25 02:41:12,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 02:41:12,828 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 02:41:12,869 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_24-sound_lock_racing.i[30176,30189] [2025-04-25 02:41:12,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 02:41:12,903 INFO L204 MainTranslator]: Completed translation [2025-04-25 02:41:12,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12 WrapperNode [2025-04-25 02:41:12,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 02:41:12,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 02:41:12,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 02:41:12,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 02:41:12,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,939 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2025-04-25 02:41:12,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 02:41:12,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 02:41:12,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 02:41:12,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 02:41:12,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,952 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 02:41:12,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 02:41:12,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 02:41:12,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 02:41:12,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (1/1) ... [2025-04-25 02:41:12,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:41:12,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:41:12,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 02:41:12,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 02:41:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-25 02:41:13,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-25 02:41:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-25 02:41:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 02:41:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-25 02:41:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-25 02:41:13,010 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-25 02:41:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-25 02:41:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 02:41:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-25 02:41:13,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 02:41:13,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 02:41:13,011 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 02:41:13,095 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 02:41:13,096 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 02:41:13,251 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 02:41:13,251 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 02:41:13,388 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 02:41:13,388 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-25 02:41:13,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:41:13 BoogieIcfgContainer [2025-04-25 02:41:13,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 02:41:13,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 02:41:13,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 02:41:13,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 02:41:13,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 02:41:12" (1/3) ... [2025-04-25 02:41:13,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722715f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 02:41:13, skipping insertion in model container [2025-04-25 02:41:13,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:41:12" (2/3) ... [2025-04-25 02:41:13,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722715f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 02:41:13, skipping insertion in model container [2025-04-25 02:41:13,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:41:13" (3/3) ... [2025-04-25 02:41:13,396 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_24-sound_lock_racing.i [2025-04-25 02:41:13,405 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 02:41:13,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_24-sound_lock_racing.i that has 2 procedures, 39 locations, 48 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-25 02:41:13,407 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 02:41:13,446 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-25 02:41:13,493 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:13,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 02:41:13,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:41:13,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-25 02:41:13,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-25 02:41:13,560 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:13,569 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:13,574 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:13,574 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:13,629 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:13,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:13,635 INFO L85 PathProgramCache]: Analyzing trace with hash 965262931, now seen corresponding path program 1 times [2025-04-25 02:41:13,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:13,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219347211] [2025-04-25 02:41:13,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:13,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:13,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-25 02:41:13,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-25 02:41:13,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:13,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:13,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:13,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-25 02:41:13,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-25 02:41:13,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:13,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:13,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:13,793 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:13,794 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:13,795 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:13,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 02:41:13,802 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-25 02:41:13,805 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:13,805 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-25 02:41:13,822 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-25 02:41:13,825 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:13,833 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:13,835 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:13,835 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:13,835 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:13,926 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:13,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:13,926 INFO L85 PathProgramCache]: Analyzing trace with hash -733610006, now seen corresponding path program 1 times [2025-04-25 02:41:13,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:13,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401076058] [2025-04-25 02:41:13,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:13,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-25 02:41:13,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-25 02:41:13,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:13,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:14,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:14,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401076058] [2025-04-25 02:41:14,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401076058] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:14,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:14,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:14,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605817002] [2025-04-25 02:41:14,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:14,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:14,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:14,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:14,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:14,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,037 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:14,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-04-25 02:41:14,038 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 02:41:14,091 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:14,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:14,091 INFO L85 PathProgramCache]: Analyzing trace with hash 653225064, now seen corresponding path program 1 times [2025-04-25 02:41:14,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:14,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072621073] [2025-04-25 02:41:14,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:14,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:14,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-25 02:41:14,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-25 02:41:14,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:14,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:14,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:14,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072621073] [2025-04-25 02:41:14,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072621073] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:14,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:14,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:14,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079582184] [2025-04-25 02:41:14,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:14,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:14,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:14,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:14,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:14,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,285 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:14,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-04-25 02:41:14,285 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,285 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:14,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 02:41:14,331 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:14,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1028611561, now seen corresponding path program 1 times [2025-04-25 02:41:14,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:14,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054926037] [2025-04-25 02:41:14,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:14,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-25 02:41:14,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-25 02:41:14,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:14,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:14,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:14,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-25 02:41:14,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-25 02:41:14,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:14,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:14,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:14,376 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:14,376 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:14,376 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:14,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 02:41:14,377 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-25 02:41:14,377 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:14,377 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-25 02:41:14,394 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-25 02:41:14,397 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:14,403 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:14,404 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:14,404 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:14,405 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:14,509 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:14,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash -379957920, now seen corresponding path program 1 times [2025-04-25 02:41:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:14,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021962115] [2025-04-25 02:41:14,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:14,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-25 02:41:14,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 02:41:14,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:14,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:14,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-04-25 02:41:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:14,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021962115] [2025-04-25 02:41:14,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021962115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:14,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:14,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668897643] [2025-04-25 02:41:14,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:14,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:14,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:14,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:14,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,546 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:14,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-04-25 02:41:14,546 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-25 02:41:14,636 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:14,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 26212530, now seen corresponding path program 1 times [2025-04-25 02:41:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:14,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969939507] [2025-04-25 02:41:14,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:14,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:14,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-25 02:41:14,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-25 02:41:14,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:14,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:14,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:14,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969939507] [2025-04-25 02:41:14,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969939507] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:14,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:14,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:14,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891084148] [2025-04-25 02:41:14,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:14,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:14,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:14,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:14,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:14,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,763 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:14,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-04-25 02:41:14,763 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,763 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:14,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-25 02:41:14,817 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:14,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1622918983, now seen corresponding path program 1 times [2025-04-25 02:41:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:14,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519142811] [2025-04-25 02:41:14,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:14,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:14,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 02:41:14,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 02:41:14,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:14,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:14,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:14,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519142811] [2025-04-25 02:41:14,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519142811] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:14,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:14,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 02:41:14,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474029985] [2025-04-25 02:41:14,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:14,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 02:41:14,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:14,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 02:41:14,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 02:41:14,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,960 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:14,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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-04-25 02:41:14,961 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:14,961 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:14,961 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:15,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:15,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-25 02:41:15,002 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:15,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:15,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1994981928, now seen corresponding path program 1 times [2025-04-25 02:41:15,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:15,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243840340] [2025-04-25 02:41:15,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:15,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-25 02:41:15,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 02:41:15,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:15,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:15,022 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:15,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-25 02:41:15,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 02:41:15,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:15,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:15,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:15,047 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:15,048 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:15,048 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:15,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-25 02:41:15,049 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-25 02:41:15,049 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:15,049 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-25 02:41:15,064 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-25 02:41:15,066 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:15,073 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:15,074 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:15,074 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:15,074 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:15,190 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:15,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash 386170058, now seen corresponding path program 1 times [2025-04-25 02:41:15,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:15,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355389740] [2025-04-25 02:41:15,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:15,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:15,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-25 02:41:15,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-25 02:41:15,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:15,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:15,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:15,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355389740] [2025-04-25 02:41:15,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355389740] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:15,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:15,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:15,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965062719] [2025-04-25 02:41:15,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:15,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:15,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:15,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:15,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:15,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,221 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:15,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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-04-25 02:41:15,221 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-25 02:41:15,420 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:15,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash -402004652, now seen corresponding path program 1 times [2025-04-25 02:41:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:15,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817224012] [2025-04-25 02:41:15,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:15,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:15,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-25 02:41:15,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-25 02:41:15,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:15,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:15,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817224012] [2025-04-25 02:41:15,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817224012] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:15,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:15,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:15,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964702435] [2025-04-25 02:41:15,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:15,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:15,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:15,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:15,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:15,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,513 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:15,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-04-25 02:41:15,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,514 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:15,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-25 02:41:15,597 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:15,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1393083462, now seen corresponding path program 1 times [2025-04-25 02:41:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:15,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563046808] [2025-04-25 02:41:15,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:15,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:15,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-25 02:41:15,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-25 02:41:15,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:15,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:15,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:15,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563046808] [2025-04-25 02:41:15,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563046808] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:15,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:15,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38754787] [2025-04-25 02:41:15,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:15,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:15,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:15,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:15,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:15,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,796 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:15,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-04-25 02:41:15,796 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,796 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:15,796 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:15,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:15,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:15,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-25 02:41:15,842 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:15,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:15,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1163906036, now seen corresponding path program 1 times [2025-04-25 02:41:15,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:15,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276152766] [2025-04-25 02:41:15,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:15,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:15,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-25 02:41:15,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-25 02:41:15,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:15,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:15,861 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:15,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-25 02:41:15,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-25 02:41:15,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:15,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:15,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:15,892 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:15,894 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:15,894 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:15,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-25 02:41:15,895 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-25 02:41:15,896 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:15,897 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-25 02:41:15,916 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-25 02:41:15,918 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:15,928 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:15,928 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:15,929 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:15,929 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:16,096 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:16,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash 975440243, now seen corresponding path program 1 times [2025-04-25 02:41:16,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:16,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025645852] [2025-04-25 02:41:16,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:16,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:16,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-25 02:41:16,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-25 02:41:16,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:16,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:16,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:16,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025645852] [2025-04-25 02:41:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025645852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:16,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:16,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:16,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902728842] [2025-04-25 02:41:16,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:16,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:16,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:16,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:16,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:16,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:16,124 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:16,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-04-25 02:41:16,124 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:16,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:16,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-25 02:41:16,387 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:16,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1344452101, now seen corresponding path program 1 times [2025-04-25 02:41:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:16,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956896106] [2025-04-25 02:41:16,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:16,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-25 02:41:16,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-25 02:41:16,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:16,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:16,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-04-25 02:41:16,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:16,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956896106] [2025-04-25 02:41:16,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956896106] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:16,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:16,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:16,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589357616] [2025-04-25 02:41:16,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:16,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:16,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:16,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:16,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:16,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:16,495 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:16,495 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-04-25 02:41:16,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:16,495 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:16,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:16,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:16,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-25 02:41:16,581 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:16,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:16,581 INFO L85 PathProgramCache]: Analyzing trace with hash -203926229, now seen corresponding path program 1 times [2025-04-25 02:41:16,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:16,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131894547] [2025-04-25 02:41:16,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:16,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:16,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-25 02:41:16,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-25 02:41:16,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:16,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:16,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:16,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131894547] [2025-04-25 02:41:16,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131894547] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:16,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:16,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:16,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928114797] [2025-04-25 02:41:16,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:16,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:16,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:16,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:16,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:16,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:16,727 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:16,727 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-04-25 02:41:16,727 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:16,727 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:16,727 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:16,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:16,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:16,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:16,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-25 02:41:16,794 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:16,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:16,794 INFO L85 PathProgramCache]: Analyzing trace with hash -125514824, now seen corresponding path program 1 times [2025-04-25 02:41:16,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:16,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432933085] [2025-04-25 02:41:16,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:16,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:16,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-25 02:41:16,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-25 02:41:16,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:16,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:16,813 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:16,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-25 02:41:16,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-25 02:41:16,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:16,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:16,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:16,842 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:16,842 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:16,843 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:16,843 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-25 02:41:16,844 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-25 02:41:16,844 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:16,846 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-25 02:41:16,869 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-25 02:41:16,873 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:16,884 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:16,885 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:16,885 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:16,886 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:17,063 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:17,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:17,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2018341467, now seen corresponding path program 1 times [2025-04-25 02:41:17,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:17,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20235306] [2025-04-25 02:41:17,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:17,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:17,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-25 02:41:17,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-25 02:41:17,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:17,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:17,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:17,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20235306] [2025-04-25 02:41:17,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20235306] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:17,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:17,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:17,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082152167] [2025-04-25 02:41:17,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:17,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:17,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:17,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:17,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:17,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:17,102 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:17,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-04-25 02:41:17,102 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:17,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:17,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-25 02:41:17,551 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:17,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:17,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1137836620, now seen corresponding path program 1 times [2025-04-25 02:41:17,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:17,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197631902] [2025-04-25 02:41:17,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:17,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:17,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-25 02:41:17,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-25 02:41:17,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:17,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:17,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:17,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197631902] [2025-04-25 02:41:17,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197631902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:17,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:17,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:17,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693072429] [2025-04-25 02:41:17,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:17,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:17,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:17,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:17,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:17,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:17,658 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:17,658 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-04-25 02:41:17,658 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:17,659 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:17,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:17,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:17,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-25 02:41:17,763 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:17,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1798875556, now seen corresponding path program 1 times [2025-04-25 02:41:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:17,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721247585] [2025-04-25 02:41:17,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:17,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:17,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-04-25 02:41:17,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-04-25 02:41:17,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:17,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:17,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:17,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721247585] [2025-04-25 02:41:17,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721247585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:17,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:17,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 02:41:17,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134193768] [2025-04-25 02:41:17,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:17,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 02:41:17,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:17,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 02:41:17,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 02:41:17,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:17,896 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:17,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 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-04-25 02:41:17,896 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:17,896 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:17,896 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:17,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:17,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:17,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:17,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-25 02:41:17,978 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:17,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1216594081, now seen corresponding path program 1 times [2025-04-25 02:41:17,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:17,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158310651] [2025-04-25 02:41:17,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:17,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:17,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-25 02:41:17,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-25 02:41:17,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:17,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:17,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:18,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-25 02:41:18,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-25 02:41:18,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:18,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:18,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:18,023 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:18,023 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:18,023 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:18,023 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-25 02:41:18,025 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-25 02:41:18,026 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:18,026 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-25 02:41:18,057 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-04-25 02:41:18,059 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:18,070 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:18,070 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:18,071 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:18,071 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:18,283 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:18,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1131303770, now seen corresponding path program 1 times [2025-04-25 02:41:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:18,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778287495] [2025-04-25 02:41:18,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:18,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-25 02:41:18,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-25 02:41:18,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:18,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:18,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-04-25 02:41:18,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:18,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778287495] [2025-04-25 02:41:18,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778287495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:18,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:18,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:18,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605240916] [2025-04-25 02:41:18,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:18,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:18,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:18,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:18,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:18,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:18,304 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:18,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-04-25 02:41:18,304 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:18,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:18,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-25 02:41:18,760 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:18,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1244631256, now seen corresponding path program 1 times [2025-04-25 02:41:18,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:18,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609074012] [2025-04-25 02:41:18,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:18,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:18,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-25 02:41:18,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-25 02:41:18,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:18,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:18,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:18,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609074012] [2025-04-25 02:41:18,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609074012] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:18,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:18,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:18,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716955045] [2025-04-25 02:41:18,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:18,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:18,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:18,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:18,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:18,854 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:18,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-04-25 02:41:18,854 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:18,854 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:19,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:19,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:19,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-25 02:41:19,025 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:19,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:19,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1067111449, now seen corresponding path program 1 times [2025-04-25 02:41:19,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:19,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487659459] [2025-04-25 02:41:19,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:19,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-25 02:41:19,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-25 02:41:19,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:19,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:19,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-04-25 02:41:19,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:19,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487659459] [2025-04-25 02:41:19,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487659459] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:19,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:19,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:19,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308375821] [2025-04-25 02:41:19,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:19,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:19,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:19,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:19,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:19,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:19,189 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:19,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 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-04-25 02:41:19,189 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:19,189 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:19,189 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:19,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:19,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:19,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:19,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-25 02:41:19,287 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:19,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash -463562308, now seen corresponding path program 1 times [2025-04-25 02:41:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:19,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33850892] [2025-04-25 02:41:19,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:19,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:19,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-25 02:41:19,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-25 02:41:19,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:19,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:19,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:19,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-25 02:41:19,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-25 02:41:19,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:19,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:19,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:19,331 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:19,331 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:19,331 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:19,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-25 02:41:19,333 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-25 02:41:19,334 WARN L247 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:19,334 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2025-04-25 02:41:19,356 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-25 02:41:19,358 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:19,374 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:19,374 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:19,375 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:19,375 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:19,662 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:19,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash -890301726, now seen corresponding path program 1 times [2025-04-25 02:41:19,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:19,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058963769] [2025-04-25 02:41:19,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:19,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-04-25 02:41:19,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-04-25 02:41:19,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:19,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:19,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:19,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058963769] [2025-04-25 02:41:19,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058963769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:19,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:19,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:19,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213788589] [2025-04-25 02:41:19,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:19,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:19,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:19,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:19,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:19,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:19,688 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:19,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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-04-25 02:41:19,689 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:20,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:20,276 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-25 02:41:20,276 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:20,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1217699921, now seen corresponding path program 1 times [2025-04-25 02:41:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:20,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363982484] [2025-04-25 02:41:20,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:20,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:20,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-25 02:41:20,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-25 02:41:20,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:20,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:20,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-04-25 02:41:20,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:20,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363982484] [2025-04-25 02:41:20,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363982484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:20,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:20,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:20,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947067976] [2025-04-25 02:41:20,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:20,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:20,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:20,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:20,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:20,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:20,382 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:20,382 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-04-25 02:41:20,382 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:20,382 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:20,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:20,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:20,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-25 02:41:20,572 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:20,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:20,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1959798591, now seen corresponding path program 1 times [2025-04-25 02:41:20,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:20,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183613158] [2025-04-25 02:41:20,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:20,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:20,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-04-25 02:41:20,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-04-25 02:41:20,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:20,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:20,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:20,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183613158] [2025-04-25 02:41:20,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183613158] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:20,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:20,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642846770] [2025-04-25 02:41:20,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:20,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:20,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:20,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:20,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:20,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:20,717 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:20,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 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-04-25 02:41:20,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:20,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:20,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:20,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:20,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:20,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:20,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-25 02:41:20,830 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:20,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash 583170603, now seen corresponding path program 1 times [2025-04-25 02:41:20,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:20,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087097463] [2025-04-25 02:41:20,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:20,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:20,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-25 02:41:20,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-25 02:41:20,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:20,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:20,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:20,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-25 02:41:20,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-25 02:41:20,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:20,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:20,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:20,875 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:20,875 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:20,875 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:20,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-25 02:41:20,876 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-25 02:41:20,877 WARN L247 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:20,878 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2025-04-25 02:41:20,899 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2025-04-25 02:41:20,903 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:20,916 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:20,917 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:20,917 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:20,917 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:21,287 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:21,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:21,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1731431539, now seen corresponding path program 1 times [2025-04-25 02:41:21,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:21,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699177531] [2025-04-25 02:41:21,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:21,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:21,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-25 02:41:21,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-25 02:41:21,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:21,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:21,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:21,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699177531] [2025-04-25 02:41:21,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699177531] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:21,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:21,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:21,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921215937] [2025-04-25 02:41:21,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:21,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:21,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:21,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:21,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:21,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:21,318 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:21,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-04-25 02:41:21,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:22,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:22,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-25 02:41:22,028 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:22,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:22,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1414658637, now seen corresponding path program 1 times [2025-04-25 02:41:22,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:22,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661038280] [2025-04-25 02:41:22,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:22,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:22,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-04-25 02:41:22,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-04-25 02:41:22,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:22,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:22,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:22,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661038280] [2025-04-25 02:41:22,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661038280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:22,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:22,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:22,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907110690] [2025-04-25 02:41:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:22,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:22,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:22,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:22,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:22,136 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:22,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-04-25 02:41:22,136 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:22,136 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:22,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:22,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:22,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-25 02:41:22,322 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:22,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:22,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1749927209, now seen corresponding path program 1 times [2025-04-25 02:41:22,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:22,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514856992] [2025-04-25 02:41:22,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:22,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:22,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-04-25 02:41:22,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-04-25 02:41:22,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:22,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:22,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:22,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514856992] [2025-04-25 02:41:22,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514856992] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:22,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:22,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:22,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580289361] [2025-04-25 02:41:22,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:22,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:22,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:22,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:22,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:22,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:22,498 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:22,499 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 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-04-25 02:41:22,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:22,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:22,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:22,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:22,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:22,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:22,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-25 02:41:22,647 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:22,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:22,647 INFO L85 PathProgramCache]: Analyzing trace with hash -719122619, now seen corresponding path program 1 times [2025-04-25 02:41:22,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:22,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295554229] [2025-04-25 02:41:22,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:22,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:22,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-04-25 02:41:22,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-04-25 02:41:22,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:22,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:22,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:22,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-04-25 02:41:22,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-04-25 02:41:22,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:22,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:22,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:22,696 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:22,696 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:22,696 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:22,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-25 02:41:22,697 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-25 02:41:22,698 WARN L247 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:22,698 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2025-04-25 02:41:22,723 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-04-25 02:41:22,727 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:22,741 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:22,742 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:22,742 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:22,742 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:23,079 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:23,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1249233524, now seen corresponding path program 1 times [2025-04-25 02:41:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:23,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330335425] [2025-04-25 02:41:23,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:23,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:23,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-25 02:41:23,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-25 02:41:23,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:23,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:23,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:23,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330335425] [2025-04-25 02:41:23,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330335425] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:23,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:23,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832973162] [2025-04-25 02:41:23,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:23,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:23,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:23,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:23,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:23,105 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:23,105 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 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-04-25 02:41:23,105 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:23,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:23,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-25 02:41:23,890 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:23,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash 533896344, now seen corresponding path program 1 times [2025-04-25 02:41:23,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:23,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083002757] [2025-04-25 02:41:23,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:23,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:23,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-04-25 02:41:23,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-04-25 02:41:23,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:23,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:24,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:24,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083002757] [2025-04-25 02:41:24,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083002757] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:24,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:24,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:24,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132764029] [2025-04-25 02:41:24,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:24,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:24,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:24,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:24,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:24,044 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:24,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 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-04-25 02:41:24,044 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:24,044 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:24,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:24,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:24,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-25 02:41:24,305 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:24,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:24,306 INFO L85 PathProgramCache]: Analyzing trace with hash -636803807, now seen corresponding path program 1 times [2025-04-25 02:41:24,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:24,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432392048] [2025-04-25 02:41:24,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:24,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:24,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-04-25 02:41:24,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-04-25 02:41:24,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:24,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:24,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:24,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432392048] [2025-04-25 02:41:24,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432392048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:24,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:24,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 02:41:24,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638248266] [2025-04-25 02:41:24,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:24,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 02:41:24,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:24,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 02:41:24,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 02:41:24,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:24,507 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:24,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 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-04-25 02:41:24,508 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:24,508 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:24,508 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:24,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:24,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:24,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:24,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-25 02:41:24,697 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:24,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash -359008073, now seen corresponding path program 1 times [2025-04-25 02:41:24,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:24,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032040299] [2025-04-25 02:41:24,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:24,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:24,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-25 02:41:24,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-25 02:41:24,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:24,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:24,716 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:24,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-25 02:41:24,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-25 02:41:24,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:24,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:24,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:24,739 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:24,739 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:24,739 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:24,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-25 02:41:24,741 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-25 02:41:24,741 WARN L247 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:24,741 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2025-04-25 02:41:24,767 INFO L143 ThreadInstanceAdder]: Constructed 11 joinOtherThreadTransitions. [2025-04-25 02:41:24,769 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:24,785 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:24,786 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:24,786 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:24,786 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:25,189 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:25,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash 522034394, now seen corresponding path program 1 times [2025-04-25 02:41:25,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:25,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737406531] [2025-04-25 02:41:25,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:25,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-25 02:41:25,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-25 02:41:25,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:25,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:25,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:25,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737406531] [2025-04-25 02:41:25,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737406531] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:25,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:25,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:25,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053701367] [2025-04-25 02:41:25,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:25,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:25,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:25,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:25,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:25,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:25,214 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:25,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 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-04-25 02:41:25,214 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:26,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:26,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-25 02:41:26,158 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:26,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:26,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1005227717, now seen corresponding path program 1 times [2025-04-25 02:41:26,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:26,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101233629] [2025-04-25 02:41:26,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:26,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:26,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-04-25 02:41:26,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-04-25 02:41:26,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:26,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:26,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:26,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101233629] [2025-04-25 02:41:26,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101233629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:26,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:26,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:26,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16847910] [2025-04-25 02:41:26,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:26,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:26,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:26,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:26,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:26,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:26,270 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:26,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-04-25 02:41:26,271 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:26,271 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:26,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:26,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:26,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-25 02:41:26,537 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:26,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:26,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1873333495, now seen corresponding path program 1 times [2025-04-25 02:41:26,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:26,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916160714] [2025-04-25 02:41:26,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:26,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:26,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-04-25 02:41:26,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-04-25 02:41:26,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:26,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:26,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:26,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916160714] [2025-04-25 02:41:26,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916160714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:26,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:26,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:26,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147186109] [2025-04-25 02:41:26,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:26,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:26,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:26,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:26,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:26,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:26,686 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:26,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 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-04-25 02:41:26,686 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:26,687 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:26,687 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:26,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:26,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:26,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:26,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-25 02:41:26,931 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:26,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:26,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1465903970, now seen corresponding path program 1 times [2025-04-25 02:41:26,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:26,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90277847] [2025-04-25 02:41:26,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:26,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:26,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-25 02:41:26,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-25 02:41:26,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:26,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:26,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:26,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-04-25 02:41:26,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-04-25 02:41:26,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:26,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:26,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:26,991 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:26,992 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:26,992 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:26,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-25 02:41:26,993 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-25 02:41:26,993 WARN L247 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:26,993 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2025-04-25 02:41:27,024 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-04-25 02:41:27,028 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:27,044 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:27,045 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:27,045 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:27,045 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:27,457 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:27,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:27,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1321985411, now seen corresponding path program 1 times [2025-04-25 02:41:27,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:27,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821226161] [2025-04-25 02:41:27,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:27,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:27,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-25 02:41:27,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-25 02:41:27,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:27,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:27,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:27,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821226161] [2025-04-25 02:41:27,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821226161] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:27,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:27,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:27,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580902869] [2025-04-25 02:41:27,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:27,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:27,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:27,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:27,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:27,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:27,487 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:27,487 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 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-04-25 02:41:27,487 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:28,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:28,613 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-25 02:41:28,613 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:28,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash 142043767, now seen corresponding path program 1 times [2025-04-25 02:41:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:28,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183404446] [2025-04-25 02:41:28,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:28,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-04-25 02:41:28,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-04-25 02:41:28,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:28,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:28,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:28,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183404446] [2025-04-25 02:41:28,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183404446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:28,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:28,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:28,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701597225] [2025-04-25 02:41:28,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:28,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:28,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:28,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:28,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:28,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:28,716 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:28,716 INFO L486 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-04-25 02:41:28,716 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:28,717 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:29,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:29,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:29,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-25 02:41:29,028 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:29,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:29,029 INFO L85 PathProgramCache]: Analyzing trace with hash -405852539, now seen corresponding path program 1 times [2025-04-25 02:41:29,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:29,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563163962] [2025-04-25 02:41:29,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:29,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-04-25 02:41:29,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-04-25 02:41:29,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:29,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:29,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:29,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563163962] [2025-04-25 02:41:29,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563163962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:29,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:29,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:29,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472011918] [2025-04-25 02:41:29,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:29,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:29,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:29,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:29,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:29,242 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:29,242 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:29,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 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-04-25 02:41:29,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:29,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:29,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:29,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:29,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:29,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:29,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-25 02:41:29,518 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:29,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:29,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1299599628, now seen corresponding path program 1 times [2025-04-25 02:41:29,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:29,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150983720] [2025-04-25 02:41:29,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:29,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:29,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-04-25 02:41:29,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-04-25 02:41:29,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:29,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:29,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:29,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-04-25 02:41:29,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-04-25 02:41:29,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:29,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:29,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:29,574 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:29,574 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:29,574 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:29,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-25 02:41:29,576 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-25 02:41:29,576 WARN L247 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:29,576 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2025-04-25 02:41:29,606 INFO L143 ThreadInstanceAdder]: Constructed 13 joinOtherThreadTransitions. [2025-04-25 02:41:29,609 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:29,627 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:29,628 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:29,629 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:29,630 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:30,097 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:30,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1978259662, now seen corresponding path program 1 times [2025-04-25 02:41:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:30,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717311556] [2025-04-25 02:41:30,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:30,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:30,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-25 02:41:30,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-25 02:41:30,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:30,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:30,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:30,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717311556] [2025-04-25 02:41:30,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717311556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:30,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:30,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:30,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851533193] [2025-04-25 02:41:30,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:30,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:30,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:30,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:30,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:30,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:30,124 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:30,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 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-04-25 02:41:30,124 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:31,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:31,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-25 02:41:31,151 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:31,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:31,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1311696216, now seen corresponding path program 1 times [2025-04-25 02:41:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:31,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451486262] [2025-04-25 02:41:31,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:31,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-04-25 02:41:31,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-04-25 02:41:31,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:31,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:31,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451486262] [2025-04-25 02:41:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451486262] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:31,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:31,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:31,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975415411] [2025-04-25 02:41:31,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:31,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:31,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:31,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:31,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:31,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:31,314 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:31,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) 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-04-25 02:41:31,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:31,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:31,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:31,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:31,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-25 02:41:31,707 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:31,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:31,707 INFO L85 PathProgramCache]: Analyzing trace with hash -158499750, now seen corresponding path program 2 times [2025-04-25 02:41:31,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:31,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145178240] [2025-04-25 02:41:31,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:41:31,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:31,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 228 statements into 1 equivalence classes. [2025-04-25 02:41:31,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-04-25 02:41:31,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:41:31,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:31,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:31,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145178240] [2025-04-25 02:41:31,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145178240] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:31,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:31,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311966238] [2025-04-25 02:41:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:31,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:31,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:31,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:31,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:31,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:31,888 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:31,888 INFO L486 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-04-25 02:41:31,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:31,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:31,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:32,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:32,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:32,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:32,213 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-25 02:41:32,213 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:32,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:32,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1303683995, now seen corresponding path program 1 times [2025-04-25 02:41:32,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:32,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859800593] [2025-04-25 02:41:32,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:32,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:32,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-04-25 02:41:32,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-04-25 02:41:32,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:32,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:32,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:32,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-04-25 02:41:32,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-04-25 02:41:32,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:32,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:32,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:32,264 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:32,264 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:32,264 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:32,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-25 02:41:32,266 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:41:32,266 WARN L247 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:32,266 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2025-04-25 02:41:32,292 INFO L143 ThreadInstanceAdder]: Constructed 14 joinOtherThreadTransitions. [2025-04-25 02:41:32,295 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:32,317 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:32,317 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:32,317 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:32,317 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:32,920 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:32,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1304361423, now seen corresponding path program 1 times [2025-04-25 02:41:32,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:32,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943413677] [2025-04-25 02:41:32,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:32,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:32,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-04-25 02:41:32,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-04-25 02:41:32,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:32,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:32,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:32,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943413677] [2025-04-25 02:41:32,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943413677] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:32,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:32,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:32,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730867651] [2025-04-25 02:41:32,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:32,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:32,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:32,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:32,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:32,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:32,954 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:32,954 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 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-04-25 02:41:32,954 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:34,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:34,177 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-25 02:41:34,178 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:34,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:34,178 INFO L85 PathProgramCache]: Analyzing trace with hash 893125492, now seen corresponding path program 1 times [2025-04-25 02:41:34,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:34,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642603126] [2025-04-25 02:41:34,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:34,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:34,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-04-25 02:41:34,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-04-25 02:41:34,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:34,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:34,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:34,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642603126] [2025-04-25 02:41:34,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642603126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:34,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:34,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:34,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834480921] [2025-04-25 02:41:34,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:34,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:34,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:34,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:34,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:34,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:34,352 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:34,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-04-25 02:41:34,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:34,352 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:34,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:34,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:34,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-25 02:41:34,684 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:34,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:34,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1894892374, now seen corresponding path program 2 times [2025-04-25 02:41:34,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:34,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945096422] [2025-04-25 02:41:34,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:41:34,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:34,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 248 statements into 1 equivalence classes. [2025-04-25 02:41:34,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-04-25 02:41:34,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:41:34,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:34,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:34,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945096422] [2025-04-25 02:41:34,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945096422] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:34,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:34,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452888507] [2025-04-25 02:41:34,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:34,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:34,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:34,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:34,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:34,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:34,849 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:34,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 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-04-25 02:41:34,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:34,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:34,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:35,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:35,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:35,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:35,192 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-25 02:41:35,192 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:35,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:35,192 INFO L85 PathProgramCache]: Analyzing trace with hash 795513758, now seen corresponding path program 1 times [2025-04-25 02:41:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:35,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211554706] [2025-04-25 02:41:35,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:35,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:35,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-04-25 02:41:35,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-04-25 02:41:35,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:35,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:35,216 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:35,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-04-25 02:41:35,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-04-25 02:41:35,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:35,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:35,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:35,246 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:35,246 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:35,246 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:35,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-25 02:41:35,249 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:41:35,249 WARN L247 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:35,249 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2025-04-25 02:41:35,283 INFO L143 ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions. [2025-04-25 02:41:35,286 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:35,307 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:35,307 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:35,308 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:35,308 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:35,887 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:35,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:35,887 INFO L85 PathProgramCache]: Analyzing trace with hash -495658584, now seen corresponding path program 1 times [2025-04-25 02:41:35,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:35,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667152457] [2025-04-25 02:41:35,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:35,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:35,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-04-25 02:41:35,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-04-25 02:41:35,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:35,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:35,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:35,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667152457] [2025-04-25 02:41:35,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667152457] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:35,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:35,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:35,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604571508] [2025-04-25 02:41:35,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:35,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:35,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:35,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:35,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:35,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:35,913 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:35,913 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 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-04-25 02:41:35,914 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:37,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:37,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-25 02:41:37,171 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:37,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:37,171 INFO L85 PathProgramCache]: Analyzing trace with hash 333826120, now seen corresponding path program 1 times [2025-04-25 02:41:37,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:37,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702196887] [2025-04-25 02:41:37,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:37,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:37,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-04-25 02:41:37,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-04-25 02:41:37,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:37,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:37,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:37,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702196887] [2025-04-25 02:41:37,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702196887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:37,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:37,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:37,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91911545] [2025-04-25 02:41:37,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:37,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:37,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:37,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:37,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:37,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:37,361 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:37,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-04-25 02:41:37,362 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:37,362 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:37,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:37,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:37,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-25 02:41:37,689 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:37,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:37,689 INFO L85 PathProgramCache]: Analyzing trace with hash -958269774, now seen corresponding path program 2 times [2025-04-25 02:41:37,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:37,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680565220] [2025-04-25 02:41:37,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:41:37,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:37,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 268 statements into 1 equivalence classes. [2025-04-25 02:41:37,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-04-25 02:41:37,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:41:37,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:37,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:37,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680565220] [2025-04-25 02:41:37,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680565220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:37,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:37,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:37,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683126254] [2025-04-25 02:41:37,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:37,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:37,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:37,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:37,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:37,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:37,877 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:37,877 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 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-04-25 02:41:37,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:37,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:37,877 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:38,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:38,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:38,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:38,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-25 02:41:38,343 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:38,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash -387452828, now seen corresponding path program 1 times [2025-04-25 02:41:38,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:38,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313993156] [2025-04-25 02:41:38,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:38,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:38,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-04-25 02:41:38,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-04-25 02:41:38,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:38,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:38,367 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:38,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-04-25 02:41:38,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-04-25 02:41:38,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:38,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:38,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:38,402 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:38,402 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:38,402 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:38,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-25 02:41:38,403 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:41:38,404 WARN L247 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:38,404 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2025-04-25 02:41:38,442 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2025-04-25 02:41:38,445 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:38,465 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:38,466 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:38,466 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:38,466 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:39,195 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:39,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1430291239, now seen corresponding path program 1 times [2025-04-25 02:41:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:39,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041484762] [2025-04-25 02:41:39,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:39,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-04-25 02:41:39,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-04-25 02:41:39,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:39,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:39,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:39,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041484762] [2025-04-25 02:41:39,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041484762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:39,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:39,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201406086] [2025-04-25 02:41:39,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:39,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:39,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:39,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:39,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:39,234 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:39,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 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-04-25 02:41:39,234 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:40,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:40,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-25 02:41:40,775 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:40,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:40,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1865748762, now seen corresponding path program 1 times [2025-04-25 02:41:40,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:40,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359062949] [2025-04-25 02:41:40,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:40,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:40,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-04-25 02:41:40,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-04-25 02:41:40,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:40,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:40,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:40,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359062949] [2025-04-25 02:41:40,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359062949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:40,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:40,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:40,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157470872] [2025-04-25 02:41:40,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:40,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:40,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:40,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:40,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:40,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:40,896 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:40,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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-04-25 02:41:40,896 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:40,896 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:41,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:41,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:41,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-25 02:41:41,354 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:41,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2088437464, now seen corresponding path program 2 times [2025-04-25 02:41:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:41,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155367094] [2025-04-25 02:41:41,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:41:41,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:41,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 288 statements into 1 equivalence classes. [2025-04-25 02:41:41,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-04-25 02:41:41,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:41:41,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:41,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:41,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155367094] [2025-04-25 02:41:41,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155367094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:41,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:41,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 02:41:41,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691440025] [2025-04-25 02:41:41,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:41,548 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 02:41:41,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:41,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 02:41:41,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 02:41:41,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:41,549 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:41,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 4 states have internal predecessors, (261), 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-04-25 02:41:41,549 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:41,549 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:41,549 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:42,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:42,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:42,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:42,055 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-25 02:41:42,056 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:42,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:42,056 INFO L85 PathProgramCache]: Analyzing trace with hash 961548566, now seen corresponding path program 1 times [2025-04-25 02:41:42,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:42,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603979920] [2025-04-25 02:41:42,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:42,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:42,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-04-25 02:41:42,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-04-25 02:41:42,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:42,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:42,082 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:42,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-04-25 02:41:42,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-04-25 02:41:42,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:42,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:42,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:42,118 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:42,118 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:42,118 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:42,119 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-25 02:41:42,119 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:41:42,120 WARN L247 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:42,120 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2025-04-25 02:41:42,154 INFO L143 ThreadInstanceAdder]: Constructed 17 joinOtherThreadTransitions. [2025-04-25 02:41:42,157 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:42,177 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:42,177 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:42,177 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:42,177 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:42,835 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:42,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:42,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1381700913, now seen corresponding path program 1 times [2025-04-25 02:41:42,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:42,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522686909] [2025-04-25 02:41:42,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:42,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:42,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-04-25 02:41:42,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-04-25 02:41:42,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:42,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:42,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:42,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522686909] [2025-04-25 02:41:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522686909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:42,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:42,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:42,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55519404] [2025-04-25 02:41:42,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:42,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:42,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:42,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:42,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:42,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:42,864 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:42,864 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 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-04-25 02:41:42,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:44,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:44,612 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-25 02:41:44,613 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:44,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:44,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1924252831, now seen corresponding path program 1 times [2025-04-25 02:41:44,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:44,613 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497119508] [2025-04-25 02:41:44,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:44,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:44,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-04-25 02:41:44,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-04-25 02:41:44,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:44,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:44,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:44,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497119508] [2025-04-25 02:41:44,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497119508] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:44,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736016489] [2025-04-25 02:41:44,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:44,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:44,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:44,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:44,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:44,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:44,749 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:44,749 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-04-25 02:41:44,749 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:44,749 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:45,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:45,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:45,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-04-25 02:41:45,135 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:45,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash -206418175, now seen corresponding path program 2 times [2025-04-25 02:41:45,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:45,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297272316] [2025-04-25 02:41:45,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:41:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:45,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 308 statements into 1 equivalence classes. [2025-04-25 02:41:45,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-04-25 02:41:45,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:41:45,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:45,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-04-25 02:41:45,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:45,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297272316] [2025-04-25 02:41:45,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297272316] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:45,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:45,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803486102] [2025-04-25 02:41:45,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:45,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:45,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:45,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:45,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:45,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:45,446 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:45,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 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-04-25 02:41:45,446 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:45,446 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:45,446 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:45,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:45,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:45,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:45,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-25 02:41:45,961 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:45,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:45,961 INFO L85 PathProgramCache]: Analyzing trace with hash -345953669, now seen corresponding path program 1 times [2025-04-25 02:41:45,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:45,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457037561] [2025-04-25 02:41:45,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:45,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:45,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-04-25 02:41:45,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-04-25 02:41:45,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:45,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:45,988 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:45,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-04-25 02:41:46,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-04-25 02:41:46,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:46,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:46,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:46,027 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:46,028 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:46,028 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:46,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-25 02:41:46,029 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:41:46,030 WARN L247 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:46,030 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2025-04-25 02:41:46,064 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-04-25 02:41:46,066 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:46,090 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:46,090 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:46,090 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:46,090 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:46,812 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:46,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:46,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1320415813, now seen corresponding path program 1 times [2025-04-25 02:41:46,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:46,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31882244] [2025-04-25 02:41:46,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:46,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:46,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-04-25 02:41:46,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-04-25 02:41:46,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:46,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:46,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:46,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31882244] [2025-04-25 02:41:46,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31882244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:46,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:46,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:46,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152698289] [2025-04-25 02:41:46,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:46,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:46,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:46,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:46,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:46,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:46,842 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:46,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 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-04-25 02:41:46,842 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:48,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:48,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-25 02:41:48,946 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:48,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:48,946 INFO L85 PathProgramCache]: Analyzing trace with hash 678673270, now seen corresponding path program 1 times [2025-04-25 02:41:48,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:48,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496895379] [2025-04-25 02:41:48,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:48,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:48,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-04-25 02:41:48,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-04-25 02:41:48,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:48,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:49,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:49,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496895379] [2025-04-25 02:41:49,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496895379] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:49,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:49,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:49,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574985623] [2025-04-25 02:41:49,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:49,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:49,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:49,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:49,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:49,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:49,166 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:49,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-04-25 02:41:49,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:49,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:49,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:49,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:49,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-25 02:41:49,569 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:49,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:49,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1438576092, now seen corresponding path program 2 times [2025-04-25 02:41:49,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:49,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959377489] [2025-04-25 02:41:49,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:41:49,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:49,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 328 statements into 1 equivalence classes. [2025-04-25 02:41:49,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-04-25 02:41:49,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:41:49,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:49,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:49,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959377489] [2025-04-25 02:41:49,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959377489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:49,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:49,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:49,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459466486] [2025-04-25 02:41:49,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:49,792 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:49,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:49,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:49,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:49,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:49,793 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:49,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 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-04-25 02:41:49,793 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:49,793 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:49,793 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:50,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:50,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:50,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:50,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-25 02:41:50,464 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:50,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:50,464 INFO L85 PathProgramCache]: Analyzing trace with hash 871516775, now seen corresponding path program 1 times [2025-04-25 02:41:50,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:50,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964297012] [2025-04-25 02:41:50,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:50,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:50,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-04-25 02:41:50,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-04-25 02:41:50,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:50,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:50,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:50,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-04-25 02:41:50,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-04-25 02:41:50,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:50,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:50,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:50,532 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:50,532 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:50,533 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:50,533 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-25 02:41:50,535 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:41:50,535 WARN L247 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:50,535 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2025-04-25 02:41:50,575 INFO L143 ThreadInstanceAdder]: Constructed 19 joinOtherThreadTransitions. [2025-04-25 02:41:50,578 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:50,604 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:50,605 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:50,605 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:50,605 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:51,531 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:51,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:51,531 INFO L85 PathProgramCache]: Analyzing trace with hash -778887153, now seen corresponding path program 1 times [2025-04-25 02:41:51,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:51,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041719745] [2025-04-25 02:41:51,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:51,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:51,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-04-25 02:41:51,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-04-25 02:41:51,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:51,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:51,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:51,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041719745] [2025-04-25 02:41:51,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041719745] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:51,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:51,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:51,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094239508] [2025-04-25 02:41:51,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:51,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:51,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:51,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:51,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:51,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:51,589 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:51,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 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-04-25 02:41:51,590 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:53,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:53,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-25 02:41:53,601 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:53,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:53,601 INFO L85 PathProgramCache]: Analyzing trace with hash -607080369, now seen corresponding path program 1 times [2025-04-25 02:41:53,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:53,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982715004] [2025-04-25 02:41:53,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:53,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:53,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-04-25 02:41:53,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-04-25 02:41:53,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:53,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:53,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:53,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982715004] [2025-04-25 02:41:53,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982715004] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:53,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:53,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:53,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702696558] [2025-04-25 02:41:53,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:53,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:53,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:53,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:53,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:53,884 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:53,884 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:53,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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-04-25 02:41:53,885 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:53,885 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:54,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:54,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:54,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-25 02:41:54,280 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:54,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:54,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1924676695, now seen corresponding path program 2 times [2025-04-25 02:41:54,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:54,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660336153] [2025-04-25 02:41:54,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:41:54,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:54,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 348 statements into 1 equivalence classes. [2025-04-25 02:41:54,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-04-25 02:41:54,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:41:54,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:54,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:54,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660336153] [2025-04-25 02:41:54,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660336153] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:54,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:54,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:54,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074771135] [2025-04-25 02:41:54,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:54,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:54,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:54,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:54,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:54,526 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:54,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 3 states have internal predecessors, (315), 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-04-25 02:41:54,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:54,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:54,527 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:55,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:55,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:55,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:41:55,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-25 02:41:55,255 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:55,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:55,255 INFO L85 PathProgramCache]: Analyzing trace with hash -480920850, now seen corresponding path program 1 times [2025-04-25 02:41:55,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:55,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852574753] [2025-04-25 02:41:55,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:55,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:55,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-04-25 02:41:55,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-04-25 02:41:55,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:55,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:55,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:41:55,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-04-25 02:41:55,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-04-25 02:41:55,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:55,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:41:55,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:41:55,327 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:41:55,327 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:41:55,327 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:41:55,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-25 02:41:55,329 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:41:55,329 WARN L247 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:41:55,329 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2025-04-25 02:41:55,365 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2025-04-25 02:41:55,368 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:55,397 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:41:55,398 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:41:55,398 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:41:55,398 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:41:56,293 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:56,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:56,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1326857031, now seen corresponding path program 1 times [2025-04-25 02:41:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:56,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707789669] [2025-04-25 02:41:56,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:56,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:56,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-04-25 02:41:56,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-04-25 02:41:56,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:56,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:56,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:56,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707789669] [2025-04-25 02:41:56,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707789669] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:56,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:56,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:41:56,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737067871] [2025-04-25 02:41:56,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:56,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:41:56,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:56,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:41:56,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:41:56,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:56,327 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:56,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 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-04-25 02:41:56,327 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:58,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:58,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-25 02:41:58,622 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:58,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:58,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1908974188, now seen corresponding path program 1 times [2025-04-25 02:41:58,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:58,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979805218] [2025-04-25 02:41:58,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:41:58,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:58,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-04-25 02:41:58,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-04-25 02:41:58,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:41:58,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:58,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:58,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979805218] [2025-04-25 02:41:58,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979805218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:58,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:58,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:58,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126598126] [2025-04-25 02:41:58,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:58,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:41:58,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:58,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:41:58,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:41:58,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:58,775 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:58,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-04-25 02:41:58,776 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:58,776 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:59,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:59,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:59,192 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-04-25 02:41:59,192 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:41:59,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:41:59,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1885540706, now seen corresponding path program 2 times [2025-04-25 02:41:59,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:41:59,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366427486] [2025-04-25 02:41:59,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:41:59,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:41:59,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 368 statements into 1 equivalence classes. [2025-04-25 02:41:59,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-04-25 02:41:59,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:41:59,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:41:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:41:59,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:41:59,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366427486] [2025-04-25 02:41:59,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366427486] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:41:59,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:41:59,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:41:59,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470378609] [2025-04-25 02:41:59,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:41:59,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:41:59,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:41:59,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:41:59,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:41:59,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:59,621 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:41:59,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 3 states have internal predecessors, (333), 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-04-25 02:41:59,621 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:41:59,621 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:41:59,621 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:00,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:00,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:00,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:42:00,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-25 02:42:00,536 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:00,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1468077492, now seen corresponding path program 1 times [2025-04-25 02:42:00,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:00,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18289067] [2025-04-25 02:42:00,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:00,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:00,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-04-25 02:42:00,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-04-25 02:42:00,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:00,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:00,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:42:00,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-04-25 02:42:00,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-04-25 02:42:00,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:00,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:00,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:42:00,640 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:42:00,640 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:42:00,641 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:42:00,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-25 02:42:00,643 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:42:00,643 WARN L247 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:42:00,643 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2025-04-25 02:42:00,690 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2025-04-25 02:42:00,694 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:00,725 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:42:00,726 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:42:00,726 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:00,726 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:42:01,730 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:01,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1814883112, now seen corresponding path program 1 times [2025-04-25 02:42:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:01,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723338863] [2025-04-25 02:42:01,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:01,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:01,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-04-25 02:42:01,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-04-25 02:42:01,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:01,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:01,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:01,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723338863] [2025-04-25 02:42:01,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723338863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:01,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:01,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:42:01,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219410931] [2025-04-25 02:42:01,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:01,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:42:01,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:01,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:42:01,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:42:01,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:01,765 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:01,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 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-04-25 02:42:01,766 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:04,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:04,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-25 02:42:04,312 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:04,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:04,313 INFO L85 PathProgramCache]: Analyzing trace with hash -330713295, now seen corresponding path program 1 times [2025-04-25 02:42:04,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:04,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297484749] [2025-04-25 02:42:04,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:04,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:04,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-04-25 02:42:04,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-04-25 02:42:04,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:04,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:04,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:04,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297484749] [2025-04-25 02:42:04,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297484749] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:04,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802679363] [2025-04-25 02:42:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:04,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:42:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:04,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:42:04,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:42:04,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:04,478 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:04,479 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-04-25 02:42:04,479 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:04,479 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:04,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:04,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:04,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-04-25 02:42:04,900 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:04,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:04,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1983876847, now seen corresponding path program 2 times [2025-04-25 02:42:04,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:04,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773394412] [2025-04-25 02:42:04,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:42:04,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:04,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 388 statements into 1 equivalence classes. [2025-04-25 02:42:04,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-04-25 02:42:04,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:42:04,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:05,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:05,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:05,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773394412] [2025-04-25 02:42:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773394412] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:05,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871132190] [2025-04-25 02:42:05,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:05,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:42:05,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:05,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:42:05,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:42:05,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:05,173 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:05,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 3 states have internal predecessors, (351), 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-04-25 02:42:05,173 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:05,173 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:05,173 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:06,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:06,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:06,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:42:06,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-25 02:42:06,046 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:06,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:06,046 INFO L85 PathProgramCache]: Analyzing trace with hash -242013733, now seen corresponding path program 1 times [2025-04-25 02:42:06,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:06,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776195771] [2025-04-25 02:42:06,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:06,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:06,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-04-25 02:42:06,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-04-25 02:42:06,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:06,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:06,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:42:06,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-04-25 02:42:06,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-04-25 02:42:06,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:06,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:06,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:42:06,122 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:42:06,122 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:42:06,122 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:42:06,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-04-25 02:42:06,123 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:42:06,123 WARN L247 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:42:06,124 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2025-04-25 02:42:06,165 INFO L143 ThreadInstanceAdder]: Constructed 22 joinOtherThreadTransitions. [2025-04-25 02:42:06,168 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:06,195 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:42:06,195 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:42:06,195 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:06,195 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:42:07,403 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:07,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:07,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1439562514, now seen corresponding path program 1 times [2025-04-25 02:42:07,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:07,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86255401] [2025-04-25 02:42:07,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:07,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:07,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-04-25 02:42:07,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-04-25 02:42:07,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:07,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:07,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:07,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86255401] [2025-04-25 02:42:07,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86255401] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:07,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:07,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:42:07,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7986540] [2025-04-25 02:42:07,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:07,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:42:07,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:07,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:42:07,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:42:07,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:07,438 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:07,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 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-04-25 02:42:07,439 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:10,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:10,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-25 02:42:10,029 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:10,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:10,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1105296980, now seen corresponding path program 1 times [2025-04-25 02:42:10,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:10,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269878622] [2025-04-25 02:42:10,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:10,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:10,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-04-25 02:42:10,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-04-25 02:42:10,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:10,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:10,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269878622] [2025-04-25 02:42:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269878622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265121051] [2025-04-25 02:42:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:10,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:42:10,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:10,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:42:10,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:42:10,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:10,201 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:10,201 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-04-25 02:42:10,201 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:10,201 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:10,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:10,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:10,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-25 02:42:10,836 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:10,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1961583740, now seen corresponding path program 2 times [2025-04-25 02:42:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:10,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983869465] [2025-04-25 02:42:10,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:42:10,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:10,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 408 statements into 1 equivalence classes. [2025-04-25 02:42:10,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-04-25 02:42:10,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:42:10,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:11,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:11,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983869465] [2025-04-25 02:42:11,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983869465] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:11,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:11,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:11,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161016927] [2025-04-25 02:42:11,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:11,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:42:11,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:11,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:42:11,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:42:11,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:11,129 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:11,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 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-04-25 02:42:11,129 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:11,129 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:11,129 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:12,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:12,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:12,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:42:12,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-25 02:42:12,152 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:12,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:12,153 INFO L85 PathProgramCache]: Analyzing trace with hash 989545885, now seen corresponding path program 1 times [2025-04-25 02:42:12,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:12,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617156424] [2025-04-25 02:42:12,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:12,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:12,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-04-25 02:42:12,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-04-25 02:42:12,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:12,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:12,188 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:42:12,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-04-25 02:42:12,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-04-25 02:42:12,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:12,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:12,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:42:12,239 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:42:12,239 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:42:12,239 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:42:12,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-25 02:42:12,241 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:42:12,241 WARN L247 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:42:12,241 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2025-04-25 02:42:12,280 INFO L143 ThreadInstanceAdder]: Constructed 23 joinOtherThreadTransitions. [2025-04-25 02:42:12,284 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:12,312 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:42:12,312 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:42:12,312 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:12,312 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:42:13,696 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:13,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:13,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1577307265, now seen corresponding path program 1 times [2025-04-25 02:42:13,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:13,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901252982] [2025-04-25 02:42:13,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:13,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:13,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-04-25 02:42:13,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-04-25 02:42:13,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:13,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:13,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:13,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901252982] [2025-04-25 02:42:13,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901252982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:13,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:13,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:42:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334525024] [2025-04-25 02:42:13,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:13,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:42:13,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:13,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:42:13,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:42:13,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:13,752 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:13,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.0) internal successors, (164), 2 states have internal predecessors, (164), 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-04-25 02:42:13,752 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:16,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:16,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-25 02:42:16,714 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:16,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1901574641, now seen corresponding path program 1 times [2025-04-25 02:42:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:16,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522676385] [2025-04-25 02:42:16,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:16,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:16,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-04-25 02:42:16,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-04-25 02:42:16,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:16,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:16,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:16,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522676385] [2025-04-25 02:42:16,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522676385] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:16,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:16,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:16,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730094754] [2025-04-25 02:42:16,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:16,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:42:16,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:16,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:42:16,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:42:16,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:16,895 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:16,895 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-04-25 02:42:16,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:16,895 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:17,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:17,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:17,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-04-25 02:42:17,331 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:17,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:17,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1484790139, now seen corresponding path program 2 times [2025-04-25 02:42:17,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:17,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419110597] [2025-04-25 02:42:17,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:42:17,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:17,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 428 statements into 1 equivalence classes. [2025-04-25 02:42:17,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-04-25 02:42:17,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:42:17,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:17,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:17,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419110597] [2025-04-25 02:42:17,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419110597] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:17,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:17,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:17,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11259876] [2025-04-25 02:42:17,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:17,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:42:17,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:17,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:42:17,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:42:17,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:17,786 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:17,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 3 states have internal predecessors, (387), 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-04-25 02:42:17,786 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:17,786 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:17,786 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:18,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:18,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:18,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:42:18,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-25 02:42:18,873 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:18,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash 823365742, now seen corresponding path program 1 times [2025-04-25 02:42:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:18,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347613686] [2025-04-25 02:42:18,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:18,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-04-25 02:42:18,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-04-25 02:42:18,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:18,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:18,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:42:18,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-04-25 02:42:18,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-04-25 02:42:18,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:18,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:18,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:42:18,962 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:42:18,962 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:42:18,962 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:42:18,962 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-25 02:42:18,964 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:42:18,964 WARN L247 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:42:18,964 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2025-04-25 02:42:19,000 INFO L143 ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions. [2025-04-25 02:42:19,003 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:19,041 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:42:19,041 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:42:19,041 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:19,041 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:42:20,266 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:20,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1054130982, now seen corresponding path program 1 times [2025-04-25 02:42:20,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:20,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044312370] [2025-04-25 02:42:20,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:20,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:20,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-04-25 02:42:20,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-04-25 02:42:20,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:20,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:20,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:20,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044312370] [2025-04-25 02:42:20,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044312370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:20,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:20,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:42:20,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051132758] [2025-04-25 02:42:20,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:20,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:42:20,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:20,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:42:20,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:42:20,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:20,309 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:20,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 85.5) internal successors, (171), 2 states have internal predecessors, (171), 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-04-25 02:42:20,310 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:23,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:23,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-25 02:42:23,594 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:23,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash 70794979, now seen corresponding path program 1 times [2025-04-25 02:42:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:23,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146547053] [2025-04-25 02:42:23,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:23,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-04-25 02:42:23,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-04-25 02:42:23,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:23,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:23,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:23,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146547053] [2025-04-25 02:42:23,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146547053] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:23,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:23,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:23,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282265868] [2025-04-25 02:42:23,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:23,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:42:23,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:23,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:42:23,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:42:23,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:23,780 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:23,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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-04-25 02:42:23,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:23,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:24,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:24,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:24,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-04-25 02:42:24,230 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:24,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:24,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1149453297, now seen corresponding path program 2 times [2025-04-25 02:42:24,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:24,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870297548] [2025-04-25 02:42:24,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:42:24,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:24,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 448 statements into 1 equivalence classes. [2025-04-25 02:42:24,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-04-25 02:42:24,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:42:24,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:24,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-04-25 02:42:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:24,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870297548] [2025-04-25 02:42:24,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870297548] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:24,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:24,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 02:42:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768176200] [2025-04-25 02:42:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:24,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 02:42:24,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:24,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 02:42:24,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 02:42:24,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:24,546 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:24,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 4 states have internal predecessors, (405), 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-04-25 02:42:24,546 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:24,546 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:24,546 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:25,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:25,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:25,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:42:25,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-25 02:42:25,912 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:25,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:25,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1698010358, now seen corresponding path program 1 times [2025-04-25 02:42:25,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:25,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637181714] [2025-04-25 02:42:25,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:25,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:25,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-04-25 02:42:25,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-04-25 02:42:25,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:25,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:25,955 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:42:25,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-04-25 02:42:25,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-04-25 02:42:25,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:25,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:26,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:42:26,011 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:42:26,011 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:42:26,011 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:42:26,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-04-25 02:42:26,013 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:42:26,013 WARN L247 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:42:26,013 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2025-04-25 02:42:26,171 INFO L143 ThreadInstanceAdder]: Constructed 25 joinOtherThreadTransitions. [2025-04-25 02:42:26,176 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:26,218 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:42:26,218 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:42:26,219 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:26,219 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:42:27,928 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:27,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1014724311, now seen corresponding path program 1 times [2025-04-25 02:42:27,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:27,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779987124] [2025-04-25 02:42:27,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:27,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:27,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-04-25 02:42:27,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-04-25 02:42:27,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:27,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:27,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:27,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779987124] [2025-04-25 02:42:27,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779987124] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:27,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:27,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:42:27,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115335694] [2025-04-25 02:42:27,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:27,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:42:27,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:27,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:42:27,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:42:27,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:27,972 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:27,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 89.0) internal successors, (178), 2 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-04-25 02:42:27,972 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:31,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:31,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-25 02:42:31,480 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:31,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:31,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1180699814, now seen corresponding path program 1 times [2025-04-25 02:42:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:31,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695028876] [2025-04-25 02:42:31,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:31,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:31,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-04-25 02:42:31,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-04-25 02:42:31,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:31,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:31,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:31,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695028876] [2025-04-25 02:42:31,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695028876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:31,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:31,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:31,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483553210] [2025-04-25 02:42:31,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:31,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:42:31,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:31,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:42:31,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:42:31,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:31,815 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:31,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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-04-25 02:42:31,815 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:31,815 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:32,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:32,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:32,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-25 02:42:32,318 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:32,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:32,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1243650360, now seen corresponding path program 2 times [2025-04-25 02:42:32,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:32,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304706796] [2025-04-25 02:42:32,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:42:32,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:32,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 468 statements into 1 equivalence classes. [2025-04-25 02:42:32,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-04-25 02:42:32,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:42:32,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:32,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:32,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304706796] [2025-04-25 02:42:32,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304706796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:32,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:32,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:32,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073620025] [2025-04-25 02:42:32,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:32,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:42:32,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:32,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:42:32,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:42:32,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:32,631 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:32,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 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-04-25 02:42:32,631 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:32,631 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:32,631 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:34,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:34,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:34,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:42:34,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-25 02:42:34,025 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:34,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash -564565887, now seen corresponding path program 1 times [2025-04-25 02:42:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:34,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027796123] [2025-04-25 02:42:34,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:34,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-04-25 02:42:34,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-04-25 02:42:34,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:34,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:34,065 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:42:34,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-04-25 02:42:34,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-04-25 02:42:34,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:34,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:34,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:42:34,245 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:42:34,245 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:42:34,246 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:42:34,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-25 02:42:34,248 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:42:34,248 WARN L247 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:42:34,248 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2025-04-25 02:42:34,290 INFO L143 ThreadInstanceAdder]: Constructed 26 joinOtherThreadTransitions. [2025-04-25 02:42:34,293 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:34,326 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:42:34,326 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:42:34,326 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:34,327 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:42:35,758 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:35,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:35,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1835121478, now seen corresponding path program 1 times [2025-04-25 02:42:35,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:35,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259990348] [2025-04-25 02:42:35,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:35,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:35,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-04-25 02:42:35,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-04-25 02:42:35,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:35,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:35,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:35,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:35,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259990348] [2025-04-25 02:42:35,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259990348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:35,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:35,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:42:35,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276822071] [2025-04-25 02:42:35,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:35,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:42:35,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:35,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:42:35,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:42:35,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:35,805 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:35,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 92.5) internal successors, (185), 2 states have internal predecessors, (185), 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-04-25 02:42:35,805 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:39,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:39,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-04-25 02:42:39,592 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:39,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:39,593 INFO L85 PathProgramCache]: Analyzing trace with hash 671441027, now seen corresponding path program 1 times [2025-04-25 02:42:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:39,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050851062] [2025-04-25 02:42:39,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:39,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:39,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-04-25 02:42:39,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-04-25 02:42:39,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:39,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:39,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:39,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050851062] [2025-04-25 02:42:39,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050851062] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:39,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:39,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:39,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144785954] [2025-04-25 02:42:39,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:39,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:42:39,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:39,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:42:39,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:42:39,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:39,927 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:39,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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-04-25 02:42:39,927 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:39,927 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:40,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:40,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:40,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-04-25 02:42:40,446 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:40,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:40,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1434056615, now seen corresponding path program 2 times [2025-04-25 02:42:40,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:40,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071663452] [2025-04-25 02:42:40,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:42:40,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:40,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 488 statements into 1 equivalence classes. [2025-04-25 02:42:40,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-04-25 02:42:40,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:42:40,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:40,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071663452] [2025-04-25 02:42:40,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071663452] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:40,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:40,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:40,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580356055] [2025-04-25 02:42:40,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:40,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:42:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:40,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:42:40,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:42:40,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:40,970 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:40,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 3 states have internal predecessors, (441), 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-04-25 02:42:40,970 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:40,970 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:40,970 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:42,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:42,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:42,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:42:42,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-04-25 02:42:42,790 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:42,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2070283524, now seen corresponding path program 1 times [2025-04-25 02:42:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:42,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813607208] [2025-04-25 02:42:42,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:42,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-04-25 02:42:42,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-04-25 02:42:42,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:42,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:42,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:42:42,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-04-25 02:42:42,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-04-25 02:42:42,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:42,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:42,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:42:42,918 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:42:42,919 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:42:42,919 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:42:42,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-25 02:42:42,921 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:42:42,921 WARN L247 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:42:42,921 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2025-04-25 02:42:42,968 INFO L143 ThreadInstanceAdder]: Constructed 27 joinOtherThreadTransitions. [2025-04-25 02:42:42,971 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:43,007 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:42:43,008 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:42:43,008 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:43,008 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:42:44,676 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:44,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1608301990, now seen corresponding path program 1 times [2025-04-25 02:42:44,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:44,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981961668] [2025-04-25 02:42:44,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:44,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:44,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-04-25 02:42:44,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-04-25 02:42:44,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:44,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:44,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:44,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981961668] [2025-04-25 02:42:44,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981961668] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:44,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:44,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:42:44,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741864614] [2025-04-25 02:42:44,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:44,724 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:42:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:44,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:42:44,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:42:44,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:44,724 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:44,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 96.0) internal successors, (192), 2 states have internal predecessors, (192), 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-04-25 02:42:44,724 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:48,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:48,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-04-25 02:42:48,824 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:48,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:48,825 INFO L85 PathProgramCache]: Analyzing trace with hash 95189125, now seen corresponding path program 1 times [2025-04-25 02:42:48,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:48,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487066090] [2025-04-25 02:42:48,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:48,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-04-25 02:42:48,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-04-25 02:42:48,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:48,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:49,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-04-25 02:42:49,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:49,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487066090] [2025-04-25 02:42:49,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487066090] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:49,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:49,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:49,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571712642] [2025-04-25 02:42:49,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:49,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:42:49,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:49,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:42:49,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:42:49,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:49,040 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:49,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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-04-25 02:42:49,040 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:49,040 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:49,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:49,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:49,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-04-25 02:42:49,542 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:49,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1761075715, now seen corresponding path program 2 times [2025-04-25 02:42:49,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:49,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560490925] [2025-04-25 02:42:49,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:42:49,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:49,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 508 statements into 1 equivalence classes. [2025-04-25 02:42:49,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-04-25 02:42:49,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:42:49,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:50,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:50,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560490925] [2025-04-25 02:42:50,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560490925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:50,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:50,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 02:42:50,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106387380] [2025-04-25 02:42:50,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:50,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 02:42:50,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:50,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 02:42:50,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 02:42:50,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:50,011 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:50,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 4 states have internal predecessors, (459), 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-04-25 02:42:50,012 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:50,012 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:50,012 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:51,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:51,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:51,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:42:51,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-04-25 02:42:51,686 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:51,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:51,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1986416026, now seen corresponding path program 1 times [2025-04-25 02:42:51,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:51,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080128216] [2025-04-25 02:42:51,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:51,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:51,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-04-25 02:42:51,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-04-25 02:42:51,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:51,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:51,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:42:51,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-04-25 02:42:51,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-04-25 02:42:51,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:51,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:42:51,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:42:51,803 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:42:51,803 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:42:51,803 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:42:51,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-04-25 02:42:51,805 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:42:51,805 WARN L247 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:42:51,805 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2025-04-25 02:42:51,852 INFO L143 ThreadInstanceAdder]: Constructed 28 joinOtherThreadTransitions. [2025-04-25 02:42:51,855 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:51,895 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:42:51,895 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:42:51,896 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:42:51,896 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:42:53,564 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:53,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2073196490, now seen corresponding path program 1 times [2025-04-25 02:42:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:53,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517284401] [2025-04-25 02:42:53,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:53,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:53,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-04-25 02:42:53,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-04-25 02:42:53,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:53,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:53,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:53,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517284401] [2025-04-25 02:42:53,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517284401] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:53,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:53,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:42:53,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447103335] [2025-04-25 02:42:53,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:53,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:42:53,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:53,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:42:53,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:42:53,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:53,613 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:53,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 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-04-25 02:42:53,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:58,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:58,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-04-25 02:42:58,508 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:58,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:58,508 INFO L85 PathProgramCache]: Analyzing trace with hash -843588043, now seen corresponding path program 1 times [2025-04-25 02:42:58,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:58,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936082179] [2025-04-25 02:42:58,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:42:58,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:58,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-04-25 02:42:58,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-04-25 02:42:58,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:42:58,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:58,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:58,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936082179] [2025-04-25 02:42:58,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936082179] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:58,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:58,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:58,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211380607] [2025-04-25 02:42:58,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:58,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:42:58,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:58,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:42:58,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:42:58,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:58,734 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:58,734 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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-04-25 02:42:58,734 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:58,734 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:59,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:59,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:59,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-04-25 02:42:59,256 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:42:59,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:42:59,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1728599883, now seen corresponding path program 2 times [2025-04-25 02:42:59,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:42:59,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998621651] [2025-04-25 02:42:59,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:42:59,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:42:59,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 528 statements into 1 equivalence classes. [2025-04-25 02:42:59,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-04-25 02:42:59,325 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:42:59,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:42:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:42:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:42:59,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998621651] [2025-04-25 02:42:59,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998621651] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:42:59,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:42:59,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:42:59,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974645289] [2025-04-25 02:42:59,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:42:59,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:42:59,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:42:59,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:42:59,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:42:59,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:59,635 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:42:59,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 3 states have internal predecessors, (477), 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-04-25 02:42:59,635 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:42:59,636 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:42:59,636 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:01,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:01,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:01,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:43:01,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-04-25 02:43:01,637 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:01,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash 692765054, now seen corresponding path program 1 times [2025-04-25 02:43:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:01,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506368153] [2025-04-25 02:43:01,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:01,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:01,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-04-25 02:43:01,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-04-25 02:43:01,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:01,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:43:01,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:43:01,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-04-25 02:43:01,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-04-25 02:43:01,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:01,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:43:01,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:43:01,771 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:43:01,771 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:43:01,771 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:43:01,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-04-25 02:43:01,773 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:43:01,774 WARN L247 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:43:01,774 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2025-04-25 02:43:01,827 INFO L143 ThreadInstanceAdder]: Constructed 29 joinOtherThreadTransitions. [2025-04-25 02:43:01,831 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:43:01,867 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:43:01,867 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:43:01,867 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:43:01,867 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:43:03,661 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:03,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash -672801063, now seen corresponding path program 1 times [2025-04-25 02:43:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:03,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100744155] [2025-04-25 02:43:03,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:03,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:03,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-04-25 02:43:03,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-04-25 02:43:03,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:03,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:03,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-04-25 02:43:03,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:03,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100744155] [2025-04-25 02:43:03,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100744155] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:03,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:03,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:43:03,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584575309] [2025-04-25 02:43:03,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:03,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:43:03,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:03,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:43:03,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:43:03,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:03,710 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:03,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.0) internal successors, (206), 2 states have internal predecessors, (206), 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-04-25 02:43:03,711 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:08,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:08,623 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-04-25 02:43:08,623 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:08,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:08,623 INFO L85 PathProgramCache]: Analyzing trace with hash 758146692, now seen corresponding path program 1 times [2025-04-25 02:43:08,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:08,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129132059] [2025-04-25 02:43:08,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:08,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:08,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-04-25 02:43:08,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-04-25 02:43:08,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:08,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:08,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129132059] [2025-04-25 02:43:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129132059] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:08,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:08,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:43:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68752216] [2025-04-25 02:43:08,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:08,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:43:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:08,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:43:08,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:43:08,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:08,858 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:08,858 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-04-25 02:43:08,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:08,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:09,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:09,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:09,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-04-25 02:43:09,393 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:09,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1537588384, now seen corresponding path program 2 times [2025-04-25 02:43:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:09,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359704777] [2025-04-25 02:43:09,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:43:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:09,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 548 statements into 1 equivalence classes. [2025-04-25 02:43:09,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-04-25 02:43:09,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:43:09,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:09,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:09,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359704777] [2025-04-25 02:43:09,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359704777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:09,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:09,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:43:09,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587943527] [2025-04-25 02:43:09,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:09,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:43:09,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:09,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:43:09,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:43:09,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:09,772 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:09,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 3 states have internal predecessors, (495), 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-04-25 02:43:09,772 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:09,772 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:09,772 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:11,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:11,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:11,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:43:11,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-04-25 02:43:11,700 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:11,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:11,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1929982355, now seen corresponding path program 1 times [2025-04-25 02:43:11,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:11,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955905451] [2025-04-25 02:43:11,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:11,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:11,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-04-25 02:43:11,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-04-25 02:43:11,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:11,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:43:11,751 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:43:11,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-04-25 02:43:11,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-04-25 02:43:11,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:11,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:43:11,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:43:11,987 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:43:11,987 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:43:11,987 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:43:11,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-04-25 02:43:11,989 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:43:11,990 WARN L247 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:43:11,990 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2025-04-25 02:43:12,049 INFO L143 ThreadInstanceAdder]: Constructed 30 joinOtherThreadTransitions. [2025-04-25 02:43:12,054 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:43:12,097 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:43:12,098 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:43:12,098 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:43:12,098 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:43:14,374 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:14,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1680373183, now seen corresponding path program 1 times [2025-04-25 02:43:14,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:14,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79342777] [2025-04-25 02:43:14,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:14,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:14,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-04-25 02:43:14,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-04-25 02:43:14,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:14,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:14,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:14,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79342777] [2025-04-25 02:43:14,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79342777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:14,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:14,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:43:14,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798223330] [2025-04-25 02:43:14,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:14,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:43:14,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:14,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:43:14,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:43:14,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:14,428 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:14,428 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 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-04-25 02:43:14,428 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:19,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:19,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-04-25 02:43:19,609 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:19,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1540289655, now seen corresponding path program 1 times [2025-04-25 02:43:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:19,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024293849] [2025-04-25 02:43:19,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:19,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-04-25 02:43:19,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-04-25 02:43:19,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:19,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:19,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:19,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024293849] [2025-04-25 02:43:19,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024293849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:19,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:19,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:43:19,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548405314] [2025-04-25 02:43:19,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:19,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:43:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:19,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:43:19,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:43:19,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:19,862 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:19,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-04-25 02:43:19,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:19,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:20,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:20,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:20,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-04-25 02:43:20,643 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:20,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:20,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1562797569, now seen corresponding path program 2 times [2025-04-25 02:43:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:20,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043355653] [2025-04-25 02:43:20,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:43:20,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:20,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 568 statements into 1 equivalence classes. [2025-04-25 02:43:20,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-04-25 02:43:20,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:43:20,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:21,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:21,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043355653] [2025-04-25 02:43:21,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043355653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:21,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:21,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 02:43:21,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940960851] [2025-04-25 02:43:21,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:21,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 02:43:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:21,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 02:43:21,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 02:43:21,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:21,042 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:21,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 4 states have internal predecessors, (513), 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-04-25 02:43:21,042 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:21,042 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:21,042 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:23,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:23,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:23,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:43:23,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-04-25 02:43:23,496 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:23,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash 417969973, now seen corresponding path program 1 times [2025-04-25 02:43:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:23,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297961966] [2025-04-25 02:43:23,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:23,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-04-25 02:43:23,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-04-25 02:43:23,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:23,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:43:23,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:43:23,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-04-25 02:43:23,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-04-25 02:43:23,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:23,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:43:23,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:43:23,647 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:43:23,647 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:43:23,647 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:43:23,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-04-25 02:43:23,650 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:43:23,650 WARN L247 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:43:23,650 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2025-04-25 02:43:23,704 INFO L143 ThreadInstanceAdder]: Constructed 31 joinOtherThreadTransitions. [2025-04-25 02:43:23,708 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:43:23,748 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:43:23,748 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:43:23,749 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:43:23,749 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:43:25,787 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:25,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:25,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1370350146, now seen corresponding path program 1 times [2025-04-25 02:43:25,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:25,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972857973] [2025-04-25 02:43:25,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:25,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:25,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-04-25 02:43:25,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-04-25 02:43:25,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:25,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:25,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:25,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972857973] [2025-04-25 02:43:25,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972857973] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:25,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:25,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:43:25,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544072300] [2025-04-25 02:43:25,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:25,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:43:25,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:25,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:43:25,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:43:25,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:25,841 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:25,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.0) internal successors, (220), 2 states have internal predecessors, (220), 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-04-25 02:43:25,841 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:31,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:31,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-04-25 02:43:31,585 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:31,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:31,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1624167668, now seen corresponding path program 1 times [2025-04-25 02:43:31,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:31,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971426060] [2025-04-25 02:43:31,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:31,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:31,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-04-25 02:43:31,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-04-25 02:43:31,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:31,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:31,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:31,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971426060] [2025-04-25 02:43:31,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971426060] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:31,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:31,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:43:31,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314581607] [2025-04-25 02:43:31,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:31,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:43:31,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:31,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:43:31,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:43:31,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:31,853 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:31,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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-04-25 02:43:31,853 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:31,853 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:32,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:32,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:32,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-04-25 02:43:32,449 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:32,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash -178220772, now seen corresponding path program 2 times [2025-04-25 02:43:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:32,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742507477] [2025-04-25 02:43:32,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:43:32,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:32,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 588 statements into 1 equivalence classes. [2025-04-25 02:43:32,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-04-25 02:43:32,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:43:32,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:32,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:32,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742507477] [2025-04-25 02:43:32,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742507477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:32,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:32,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:43:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634573258] [2025-04-25 02:43:32,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:32,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:43:32,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:32,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:43:32,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:43:32,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:32,866 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:32,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 3 states have internal predecessors, (531), 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-04-25 02:43:32,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:32,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:32,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:35,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:35,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:35,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:43:35,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-04-25 02:43:35,133 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:35,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1899876312, now seen corresponding path program 1 times [2025-04-25 02:43:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:35,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448544392] [2025-04-25 02:43:35,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:35,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:35,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-04-25 02:43:35,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-04-25 02:43:35,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:35,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:43:35,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:43:35,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-04-25 02:43:35,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-04-25 02:43:35,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:35,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:43:35,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:43:35,284 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:43:35,284 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:43:35,284 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:43:35,284 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2025-04-25 02:43:35,286 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:43:35,287 WARN L247 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:43:35,287 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2025-04-25 02:43:35,342 INFO L143 ThreadInstanceAdder]: Constructed 32 joinOtherThreadTransitions. [2025-04-25 02:43:35,345 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:43:35,389 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:43:35,389 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:43:35,390 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:43:35,390 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:43:37,669 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:37,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:37,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2107659436, now seen corresponding path program 1 times [2025-04-25 02:43:37,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:37,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240644953] [2025-04-25 02:43:37,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:37,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:37,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-04-25 02:43:37,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-04-25 02:43:37,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:37,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:37,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:37,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240644953] [2025-04-25 02:43:37,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240644953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:37,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:37,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:43:37,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477345476] [2025-04-25 02:43:37,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:37,727 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:43:37,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:37,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:43:37,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:43:37,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:37,728 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:37,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 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-04-25 02:43:37,728 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:43,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:43,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-04-25 02:43:43,564 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:43,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:43,565 INFO L85 PathProgramCache]: Analyzing trace with hash -772758294, now seen corresponding path program 1 times [2025-04-25 02:43:43,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:43,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418258978] [2025-04-25 02:43:43,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:43,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-04-25 02:43:43,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-04-25 02:43:43,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:43,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:43,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:43,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418258978] [2025-04-25 02:43:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418258978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:43,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:43,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:43:43,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821975483] [2025-04-25 02:43:43,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:43,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:43:43,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:43,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:43:43,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:43:43,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:43,837 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:43,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 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-04-25 02:43:43,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:43,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:44,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:44,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:44,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2025-04-25 02:43:44,408 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:44,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash -523620992, now seen corresponding path program 2 times [2025-04-25 02:43:44,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:44,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398671824] [2025-04-25 02:43:44,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:43:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:44,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 608 statements into 1 equivalence classes. [2025-04-25 02:43:44,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-04-25 02:43:44,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:43:44,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:44,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:44,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398671824] [2025-04-25 02:43:44,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398671824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:44,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:44,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 02:43:44,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676176487] [2025-04-25 02:43:44,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:44,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 02:43:44,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:44,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 02:43:44,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 02:43:44,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:44,828 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:44,828 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 4 states have internal predecessors, (549), 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-04-25 02:43:44,828 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:44,828 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:44,828 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:47,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:47,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:47,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:43:47,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-04-25 02:43:47,362 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:47,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:47,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1503271119, now seen corresponding path program 1 times [2025-04-25 02:43:47,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:47,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810320106] [2025-04-25 02:43:47,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:47,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:47,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-04-25 02:43:47,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-04-25 02:43:47,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:47,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:43:47,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:43:47,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-04-25 02:43:47,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-04-25 02:43:47,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:47,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:43:47,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:43:47,522 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:43:47,522 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:43:47,522 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:43:47,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-04-25 02:43:47,525 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:43:47,525 WARN L247 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:43:47,525 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2025-04-25 02:43:47,573 INFO L143 ThreadInstanceAdder]: Constructed 33 joinOtherThreadTransitions. [2025-04-25 02:43:47,577 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:43:47,617 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:43:47,617 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:43:47,617 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:43:47,617 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:43:50,004 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:50,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:50,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1176125202, now seen corresponding path program 1 times [2025-04-25 02:43:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:50,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894663926] [2025-04-25 02:43:50,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:50,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:50,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-04-25 02:43:50,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-04-25 02:43:50,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:50,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:50,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:50,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894663926] [2025-04-25 02:43:50,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894663926] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:50,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:50,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:43:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791598372] [2025-04-25 02:43:50,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:50,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:43:50,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:50,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:43:50,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:43:50,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:50,064 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:50,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 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-04-25 02:43:50,064 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:56,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:56,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-04-25 02:43:56,308 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:56,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1161698202, now seen corresponding path program 1 times [2025-04-25 02:43:56,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:56,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961377968] [2025-04-25 02:43:56,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:43:56,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:56,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes. [2025-04-25 02:43:56,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements. [2025-04-25 02:43:56,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:43:56,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:56,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:56,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961377968] [2025-04-25 02:43:56,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961377968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:56,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:56,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:43:56,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722119066] [2025-04-25 02:43:56,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:56,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:43:56,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:56,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:43:56,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:43:56,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:56,608 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:56,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 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-04-25 02:43:56,608 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:56,608 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:57,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:57,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:57,213 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-04-25 02:43:57,213 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:43:57,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:43:57,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1403590832, now seen corresponding path program 2 times [2025-04-25 02:43:57,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:43:57,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382938328] [2025-04-25 02:43:57,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:43:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:43:57,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 628 statements into 1 equivalence classes. [2025-04-25 02:43:57,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 628 of 628 statements. [2025-04-25 02:43:57,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:43:57,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:43:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:43:57,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:43:57,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382938328] [2025-04-25 02:43:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382938328] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:43:57,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:43:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:43:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545506766] [2025-04-25 02:43:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:43:57,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:43:57,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:43:57,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:43:57,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:43:57,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:57,643 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:43:57,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 3 states have internal predecessors, (567), 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-04-25 02:43:57,643 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:43:57,643 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:43:57,643 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:00,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:00,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:44:00,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:44:00,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-04-25 02:44:00,539 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:00,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1698698375, now seen corresponding path program 1 times [2025-04-25 02:44:00,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:00,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117214461] [2025-04-25 02:44:00,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:44:00,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:00,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-04-25 02:44:00,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-04-25 02:44:00,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:00,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:44:00,624 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:44:00,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-04-25 02:44:00,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-04-25 02:44:00,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:00,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:44:00,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:44:00,777 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:44:00,778 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:44:00,778 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:44:00,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2025-04-25 02:44:00,780 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:44:00,781 WARN L247 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:44:00,781 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2025-04-25 02:44:00,851 INFO L143 ThreadInstanceAdder]: Constructed 34 joinOtherThreadTransitions. [2025-04-25 02:44:00,856 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:44:00,897 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:44:00,897 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:44:00,897 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:44:00,897 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:44:03,943 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:03,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:03,943 INFO L85 PathProgramCache]: Analyzing trace with hash -448355802, now seen corresponding path program 1 times [2025-04-25 02:44:03,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:03,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557390055] [2025-04-25 02:44:03,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:44:03,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:04,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-04-25 02:44:04,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-04-25 02:44:04,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:04,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:44:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:44:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:44:04,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557390055] [2025-04-25 02:44:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557390055] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:44:04,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:44:04,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:44:04,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002036954] [2025-04-25 02:44:04,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:44:04,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:44:04,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:44:04,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:44:04,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:44:04,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:04,037 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:44:04,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 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-04-25 02:44:04,037 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:10,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:10,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-04-25 02:44:10,880 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:10,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1401664819, now seen corresponding path program 1 times [2025-04-25 02:44:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:10,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138294640] [2025-04-25 02:44:10,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:44:10,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:10,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-04-25 02:44:10,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-04-25 02:44:10,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:10,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:44:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:44:11,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:44:11,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138294640] [2025-04-25 02:44:11,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138294640] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:44:11,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:44:11,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:44:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066709666] [2025-04-25 02:44:11,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:44:11,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:44:11,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:44:11,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:44:11,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:44:11,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:11,187 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:44:11,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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-04-25 02:44:11,187 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:11,187 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:11,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:11,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:44:11,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-04-25 02:44:11,813 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:11,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:11,813 INFO L85 PathProgramCache]: Analyzing trace with hash 530015889, now seen corresponding path program 2 times [2025-04-25 02:44:11,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:11,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114041665] [2025-04-25 02:44:11,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:44:11,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:11,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 648 statements into 1 equivalence classes. [2025-04-25 02:44:11,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-04-25 02:44:11,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:44:11,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:44:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:44:12,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:44:12,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114041665] [2025-04-25 02:44:12,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114041665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:44:12,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:44:12,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 02:44:12,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501639004] [2025-04-25 02:44:12,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:44:12,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 02:44:12,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:44:12,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 02:44:12,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-25 02:44:12,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:12,284 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:44:12,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 4 states have internal predecessors, (585), 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-04-25 02:44:12,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:12,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:44:12,284 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:15,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:15,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:44:15,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:44:15,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-04-25 02:44:15,461 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:15,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:15,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1706810387, now seen corresponding path program 1 times [2025-04-25 02:44:15,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:15,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674082783] [2025-04-25 02:44:15,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:44:15,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:15,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-04-25 02:44:15,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-04-25 02:44:15,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:15,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:44:15,527 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:44:15,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-04-25 02:44:15,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-04-25 02:44:15,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:15,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:44:15,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:44:15,648 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:44:15,648 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:44:15,648 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:44:15,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2025-04-25 02:44:15,651 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:44:15,651 WARN L247 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:44:15,651 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2025-04-25 02:44:15,708 INFO L143 ThreadInstanceAdder]: Constructed 35 joinOtherThreadTransitions. [2025-04-25 02:44:15,712 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:44:15,752 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:44:15,752 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:44:15,752 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:44:15,752 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:44:18,530 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:18,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:18,530 INFO L85 PathProgramCache]: Analyzing trace with hash -558740273, now seen corresponding path program 1 times [2025-04-25 02:44:18,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:18,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329349947] [2025-04-25 02:44:18,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:44:18,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:18,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-04-25 02:44:18,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-04-25 02:44:18,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:18,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:44:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:44:18,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:44:18,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329349947] [2025-04-25 02:44:18,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329349947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:44:18,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:44:18,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:44:18,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925253856] [2025-04-25 02:44:18,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:44:18,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:44:18,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:44:18,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:44:18,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:44:18,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:18,597 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:44:18,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.0) internal successors, (248), 2 states have internal predecessors, (248), 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-04-25 02:44:18,597 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:25,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:25,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2025-04-25 02:44:25,873 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:25,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2019994229, now seen corresponding path program 1 times [2025-04-25 02:44:25,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:25,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440317272] [2025-04-25 02:44:25,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:44:25,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:25,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-04-25 02:44:25,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-04-25 02:44:25,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:25,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:44:26,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-04-25 02:44:26,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:44:26,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440317272] [2025-04-25 02:44:26,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440317272] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:44:26,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:44:26,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:44:26,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450353469] [2025-04-25 02:44:26,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:44:26,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:44:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:44:26,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:44:26,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:44:26,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:26,189 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:44:26,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 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-04-25 02:44:26,189 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:26,189 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:26,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:26,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:44:26,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2025-04-25 02:44:26,867 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:26,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash 837026183, now seen corresponding path program 2 times [2025-04-25 02:44:26,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:26,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025035590] [2025-04-25 02:44:26,868 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:44:26,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:26,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 668 statements into 1 equivalence classes. [2025-04-25 02:44:26,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-04-25 02:44:26,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:44:26,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:44:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:44:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:44:27,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025035590] [2025-04-25 02:44:27,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025035590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:44:27,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:44:27,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:44:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378479005] [2025-04-25 02:44:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:44:27,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:44:27,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:44:27,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:44:27,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:44:27,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:27,373 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:44:27,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 3 states have internal predecessors, (603), 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-04-25 02:44:27,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:27,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:44:27,373 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:31,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:31,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:44:31,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:44:31,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2025-04-25 02:44:31,008 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:31,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash -527540506, now seen corresponding path program 1 times [2025-04-25 02:44:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:31,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969627259] [2025-04-25 02:44:31,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:44:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:31,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-04-25 02:44:31,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-04-25 02:44:31,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:31,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:44:31,073 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:44:31,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-04-25 02:44:31,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-04-25 02:44:31,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:31,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:44:31,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:44:31,198 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:44:31,198 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:44:31,198 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:44:31,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2025-04-25 02:44:31,202 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:44:31,202 WARN L247 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:44:31,202 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2025-04-25 02:44:31,259 INFO L143 ThreadInstanceAdder]: Constructed 36 joinOtherThreadTransitions. [2025-04-25 02:44:31,263 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:44:31,304 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:44:31,304 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:44:31,304 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:44:31,304 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:44:34,248 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:34,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:34,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1044231230, now seen corresponding path program 1 times [2025-04-25 02:44:34,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:34,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992101314] [2025-04-25 02:44:34,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:44:34,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:34,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-04-25 02:44:34,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-04-25 02:44:34,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:34,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:44:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:44:34,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:44:34,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992101314] [2025-04-25 02:44:34,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992101314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:44:34,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:44:34,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:44:34,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159226342] [2025-04-25 02:44:34,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:44:34,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:44:34,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:44:34,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:44:34,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:44:34,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:34,317 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:44:34,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 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-04-25 02:44:34,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:43,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:43,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2025-04-25 02:44:43,376 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:43,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash 175053607, now seen corresponding path program 1 times [2025-04-25 02:44:43,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:43,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374023069] [2025-04-25 02:44:43,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:44:43,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:43,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-04-25 02:44:43,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-04-25 02:44:43,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:43,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:44:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:44:43,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:44:43,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374023069] [2025-04-25 02:44:43,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374023069] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:44:43,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:44:43,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:44:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815083413] [2025-04-25 02:44:43,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:44:43,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:44:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:44:43,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:44:43,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:44:43,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:43,702 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:44:43,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 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-04-25 02:44:43,703 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:43,703 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:44,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:44,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:44:44,361 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2025-04-25 02:44:44,361 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:44,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:44,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1838840475, now seen corresponding path program 2 times [2025-04-25 02:44:44,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:44,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233032759] [2025-04-25 02:44:44,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:44:44,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:44,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 688 statements into 1 equivalence classes. [2025-04-25 02:44:44,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-04-25 02:44:44,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:44:44,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:44:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:44:44,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:44:44,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233032759] [2025-04-25 02:44:44,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233032759] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:44:44,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:44:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:44:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255844522] [2025-04-25 02:44:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:44:44,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:44:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:44:44,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:44:44,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:44:44,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:44,874 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:44:44,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.25) internal successors, (621), 3 states have internal predecessors, (621), 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-04-25 02:44:44,874 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:44,874 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:44:44,874 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:48,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:48,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:44:48,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:44:48,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2025-04-25 02:44:48,518 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:48,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:48,518 INFO L85 PathProgramCache]: Analyzing trace with hash 147980436, now seen corresponding path program 1 times [2025-04-25 02:44:48,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:48,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729404537] [2025-04-25 02:44:48,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:44:48,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:48,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-04-25 02:44:48,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-04-25 02:44:48,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:48,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:44:48,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:44:48,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-04-25 02:44:48,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-04-25 02:44:48,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:48,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:44:48,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:44:48,717 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:44:48,717 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:44:48,717 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:44:48,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2025-04-25 02:44:48,720 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:44:48,721 WARN L247 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:44:48,721 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2025-04-25 02:44:48,784 INFO L143 ThreadInstanceAdder]: Constructed 37 joinOtherThreadTransitions. [2025-04-25 02:44:48,788 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:44:48,837 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:44:48,837 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:44:48,838 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:44:48,838 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:44:52,133 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:44:52,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:44:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1348322887, now seen corresponding path program 1 times [2025-04-25 02:44:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:44:52,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158560884] [2025-04-25 02:44:52,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:44:52,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:44:52,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-04-25 02:44:52,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-04-25 02:44:52,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:44:52,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:44:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:44:52,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:44:52,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158560884] [2025-04-25 02:44:52,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158560884] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:44:52,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:44:52,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:44:52,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147987635] [2025-04-25 02:44:52,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:44:52,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:44:52,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:44:52,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:44:52,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:44:52,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:44:52,329 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:44:52,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.0) internal successors, (262), 2 states have internal predecessors, (262), 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-04-25 02:44:52,329 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:00,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:00,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2025-04-25 02:45:00,282 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:00,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash 629717711, now seen corresponding path program 1 times [2025-04-25 02:45:00,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:00,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747934533] [2025-04-25 02:45:00,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:00,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:00,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 708 statements into 1 equivalence classes. [2025-04-25 02:45:00,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 708 of 708 statements. [2025-04-25 02:45:00,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:00,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:45:00,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:00,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747934533] [2025-04-25 02:45:00,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747934533] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:45:00,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:45:00,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:45:00,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884472071] [2025-04-25 02:45:00,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:45:00,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:45:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:00,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:45:00,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:45:00,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:00,627 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:00,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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-04-25 02:45:00,627 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:00,627 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:01,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:01,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:01,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2025-04-25 02:45:01,318 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:01,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash -343587975, now seen corresponding path program 2 times [2025-04-25 02:45:01,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:01,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077925715] [2025-04-25 02:45:01,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:45:01,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:01,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 708 statements into 1 equivalence classes. [2025-04-25 02:45:01,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 708 of 708 statements. [2025-04-25 02:45:01,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:45:01,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:45:02,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:02,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077925715] [2025-04-25 02:45:02,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077925715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:45:02,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:45:02,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:45:02,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790099648] [2025-04-25 02:45:02,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:45:02,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:45:02,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:02,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:45:02,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:45:02,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:02,222 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:02,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.75) internal successors, (639), 3 states have internal predecessors, (639), 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-04-25 02:45:02,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:02,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:02,223 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:07,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:07,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:07,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:45:07,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2025-04-25 02:45:07,103 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:07,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1280564849, now seen corresponding path program 1 times [2025-04-25 02:45:07,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:07,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372415357] [2025-04-25 02:45:07,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:07,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:07,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-04-25 02:45:07,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-04-25 02:45:07,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:07,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:45:07,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:45:07,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-04-25 02:45:07,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-04-25 02:45:07,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:07,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:45:07,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:45:07,324 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:45:07,324 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:45:07,324 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:45:07,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2025-04-25 02:45:07,328 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:45:07,328 WARN L247 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:45:07,328 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2025-04-25 02:45:07,384 INFO L143 ThreadInstanceAdder]: Constructed 38 joinOtherThreadTransitions. [2025-04-25 02:45:07,388 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:45:07,431 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:45:07,431 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:45:07,431 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:45:07,431 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:45:10,570 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:10,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:10,571 INFO L85 PathProgramCache]: Analyzing trace with hash 684882982, now seen corresponding path program 1 times [2025-04-25 02:45:10,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:10,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940422069] [2025-04-25 02:45:10,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:10,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-04-25 02:45:10,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-04-25 02:45:10,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:10,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:45:10,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:10,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940422069] [2025-04-25 02:45:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940422069] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:45:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:45:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:45:10,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131266714] [2025-04-25 02:45:10,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:45:10,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:45:10,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:10,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:45:10,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:45:10,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:10,643 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:10,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 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-04-25 02:45:10,643 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:19,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:19,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2025-04-25 02:45:19,517 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:19,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1487900822, now seen corresponding path program 1 times [2025-04-25 02:45:19,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:19,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986738419] [2025-04-25 02:45:19,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:19,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:19,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-04-25 02:45:19,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-04-25 02:45:19,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:19,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:45:19,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:19,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986738419] [2025-04-25 02:45:19,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986738419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:45:19,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:45:19,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:45:19,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770350523] [2025-04-25 02:45:19,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:45:19,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:45:19,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:19,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:45:19,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:45:19,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:19,864 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:19,864 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 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-04-25 02:45:19,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:19,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:20,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:20,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:20,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2025-04-25 02:45:20,629 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:20,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:20,629 INFO L85 PathProgramCache]: Analyzing trace with hash 345373632, now seen corresponding path program 2 times [2025-04-25 02:45:20,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:20,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244411218] [2025-04-25 02:45:20,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:45:20,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:20,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 728 statements into 1 equivalence classes. [2025-04-25 02:45:20,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-04-25 02:45:20,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:45:20,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:45:21,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:21,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244411218] [2025-04-25 02:45:21,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244411218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:45:21,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:45:21,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:45:21,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36792291] [2025-04-25 02:45:21,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:45:21,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:45:21,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:21,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:45:21,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:45:21,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:21,205 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:21,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 164.25) internal successors, (657), 3 states have internal predecessors, (657), 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-04-25 02:45:21,205 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:21,205 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:21,205 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:25,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:25,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:25,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:45:25,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2025-04-25 02:45:25,719 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:25,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:25,720 INFO L85 PathProgramCache]: Analyzing trace with hash 266407160, now seen corresponding path program 1 times [2025-04-25 02:45:25,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:25,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590831581] [2025-04-25 02:45:25,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:25,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:25,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-04-25 02:45:25,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-04-25 02:45:25,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:25,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:45:25,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:45:25,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-04-25 02:45:25,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-04-25 02:45:25,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:25,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:45:26,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:45:26,122 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:45:26,122 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:45:26,122 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:45:26,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2025-04-25 02:45:26,126 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:45:26,126 WARN L247 ceAbstractionStarter]: 38 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:45:26,126 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 39 thread instances. [2025-04-25 02:45:26,189 INFO L143 ThreadInstanceAdder]: Constructed 39 joinOtherThreadTransitions. [2025-04-25 02:45:26,193 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:45:26,247 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:45:26,247 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:45:26,247 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:45:26,247 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:45:29,782 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:29,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash 706029460, now seen corresponding path program 1 times [2025-04-25 02:45:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:29,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946038934] [2025-04-25 02:45:29,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:29,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-04-25 02:45:29,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-04-25 02:45:29,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:29,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:45:29,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:29,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946038934] [2025-04-25 02:45:29,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946038934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:45:29,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:45:29,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:45:29,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780449768] [2025-04-25 02:45:29,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:45:29,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:45:29,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:29,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:45:29,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:45:29,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:29,860 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:29,860 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 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-04-25 02:45:29,860 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:38,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:38,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2025-04-25 02:45:38,922 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:38,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash 188840042, now seen corresponding path program 1 times [2025-04-25 02:45:38,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:38,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973251526] [2025-04-25 02:45:38,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:38,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:38,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 748 statements into 1 equivalence classes. [2025-04-25 02:45:38,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 748 of 748 statements. [2025-04-25 02:45:38,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:38,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:45:39,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:39,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973251526] [2025-04-25 02:45:39,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973251526] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:45:39,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:45:39,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:45:39,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585812424] [2025-04-25 02:45:39,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:45:39,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:45:39,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:39,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:45:39,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:45:39,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:39,278 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:39,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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-04-25 02:45:39,278 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:39,278 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:39,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:39,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:39,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2025-04-25 02:45:39,989 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:39,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash 628018948, now seen corresponding path program 2 times [2025-04-25 02:45:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:39,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935768034] [2025-04-25 02:45:39,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:45:39,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:40,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 748 statements into 1 equivalence classes. [2025-04-25 02:45:40,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 748 of 748 statements. [2025-04-25 02:45:40,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:45:40,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:40,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-04-25 02:45:40,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:40,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935768034] [2025-04-25 02:45:40,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935768034] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:45:40,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:45:40,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:45:40,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453473894] [2025-04-25 02:45:40,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:45:40,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:45:40,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:40,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:45:40,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:45:40,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:40,554 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:40,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 168.75) internal successors, (675), 3 states have internal predecessors, (675), 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-04-25 02:45:40,554 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:40,554 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:40,554 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:45,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:45,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:45:45,086 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:45:45,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2025-04-25 02:45:45,086 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:45,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1950275460, now seen corresponding path program 1 times [2025-04-25 02:45:45,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:45,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75377690] [2025-04-25 02:45:45,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:45,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:45,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-04-25 02:45:45,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-04-25 02:45:45,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:45,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:45:45,165 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:45:45,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-04-25 02:45:45,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-04-25 02:45:45,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:45,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:45:45,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:45:45,464 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:45:45,464 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:45:45,464 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:45:45,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2025-04-25 02:45:45,468 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:45:45,468 WARN L247 ceAbstractionStarter]: 39 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:45:45,468 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 40 thread instances. [2025-04-25 02:45:45,527 INFO L143 ThreadInstanceAdder]: Constructed 40 joinOtherThreadTransitions. [2025-04-25 02:45:45,531 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:45:45,584 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:45:45,584 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:45:45,584 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:45:45,584 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:45:49,291 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:49,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash -297929894, now seen corresponding path program 1 times [2025-04-25 02:45:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:49,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082608402] [2025-04-25 02:45:49,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:49,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-04-25 02:45:49,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-04-25 02:45:49,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:49,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:45:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:49,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082608402] [2025-04-25 02:45:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082608402] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:45:49,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:45:49,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:45:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939105134] [2025-04-25 02:45:49,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:45:49,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:45:49,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:49,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:45:49,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:45:49,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:49,370 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:49,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 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-04-25 02:45:49,370 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:59,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:59,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2025-04-25 02:45:59,212 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:45:59,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:45:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash 720307576, now seen corresponding path program 1 times [2025-04-25 02:45:59,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:45:59,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674280232] [2025-04-25 02:45:59,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:45:59,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:45:59,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 768 statements into 1 equivalence classes. [2025-04-25 02:45:59,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 768 of 768 statements. [2025-04-25 02:45:59,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:45:59,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:45:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:45:59,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:45:59,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674280232] [2025-04-25 02:45:59,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674280232] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:45:59,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:45:59,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:45:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368746836] [2025-04-25 02:45:59,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:45:59,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:45:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:45:59,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:45:59,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:45:59,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:59,827 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:45:59,828 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 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-04-25 02:45:59,828 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:45:59,828 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:00,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:00,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:00,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2025-04-25 02:46:00,704 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:46:00,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2069268354, now seen corresponding path program 2 times [2025-04-25 02:46:00,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:00,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361956157] [2025-04-25 02:46:00,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:46:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:00,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 768 statements into 1 equivalence classes. [2025-04-25 02:46:00,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 768 of 768 statements. [2025-04-25 02:46:00,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:46:00,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:46:01,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:46:01,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361956157] [2025-04-25 02:46:01,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361956157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:46:01,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:46:01,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:46:01,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590172316] [2025-04-25 02:46:01,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:46:01,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:46:01,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:46:01,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:46:01,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:46:01,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:01,608 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:46:01,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.25) internal successors, (693), 3 states have internal predecessors, (693), 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-04-25 02:46:01,608 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:01,608 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:01,608 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:07,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:07,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:07,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:46:07,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2025-04-25 02:46:07,523 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:46:07,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1790145754, now seen corresponding path program 1 times [2025-04-25 02:46:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:07,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166711650] [2025-04-25 02:46:07,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:46:07,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:07,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-04-25 02:46:07,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-04-25 02:46:07,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:46:07,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:46:07,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:46:07,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-04-25 02:46:07,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-04-25 02:46:07,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:46:07,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:46:07,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:46:07,770 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:46:07,770 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:46:07,770 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:46:07,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2025-04-25 02:46:07,775 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:46:07,776 WARN L247 ceAbstractionStarter]: 40 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:46:07,776 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 41 thread instances. [2025-04-25 02:46:07,839 INFO L143 ThreadInstanceAdder]: Constructed 41 joinOtherThreadTransitions. [2025-04-25 02:46:07,843 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:46:07,888 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:46:07,888 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:46:07,888 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:46:07,888 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:46:11,818 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:46:11,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1443358385, now seen corresponding path program 1 times [2025-04-25 02:46:11,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:11,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134297221] [2025-04-25 02:46:11,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:46:11,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:11,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-04-25 02:46:11,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-04-25 02:46:11,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:46:11,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:46:11,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:46:11,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134297221] [2025-04-25 02:46:11,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134297221] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:46:11,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:46:11,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:46:11,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540727912] [2025-04-25 02:46:11,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:46:11,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:46:11,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:46:11,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:46:11,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:46:11,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:11,899 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:46:11,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 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-04-25 02:46:11,899 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:22,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:22,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2025-04-25 02:46:22,314 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:46:22,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash -715020964, now seen corresponding path program 1 times [2025-04-25 02:46:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:22,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077726941] [2025-04-25 02:46:22,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:46:22,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:22,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 788 statements into 1 equivalence classes. [2025-04-25 02:46:22,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 788 of 788 statements. [2025-04-25 02:46:22,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:46:22,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:22,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:46:22,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:46:22,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077726941] [2025-04-25 02:46:22,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077726941] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:46:22,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:46:22,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:46:22,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655852695] [2025-04-25 02:46:22,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:46:22,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:46:22,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:46:22,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:46:22,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:46:22,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:22,720 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:46:22,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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-04-25 02:46:22,720 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:22,720 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:23,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:23,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:23,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2025-04-25 02:46:23,448 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:46:23,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:23,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1134245198, now seen corresponding path program 2 times [2025-04-25 02:46:23,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:23,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228359474] [2025-04-25 02:46:23,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:46:23,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:23,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 788 statements into 1 equivalence classes. [2025-04-25 02:46:23,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 788 of 788 statements. [2025-04-25 02:46:23,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:46:23,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:46:24,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:46:24,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228359474] [2025-04-25 02:46:24,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228359474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:46:24,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:46:24,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:46:24,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052056052] [2025-04-25 02:46:24,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:46:24,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:46:24,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:46:24,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:46:24,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:46:24,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:24,076 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:46:24,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 177.75) internal successors, (711), 3 states have internal predecessors, (711), 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-04-25 02:46:24,076 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:24,076 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:24,076 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:30,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:30,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:30,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:46:30,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2025-04-25 02:46:30,050 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:46:30,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash 895470999, now seen corresponding path program 1 times [2025-04-25 02:46:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:30,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201452203] [2025-04-25 02:46:30,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:46:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:30,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-04-25 02:46:30,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-04-25 02:46:30,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:46:30,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:46:30,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:46:30,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-04-25 02:46:30,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-04-25 02:46:30,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:46:30,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:46:30,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:46:30,305 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:46:30,305 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:46:30,305 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:46:30,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2025-04-25 02:46:30,310 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:46:30,310 WARN L247 ceAbstractionStarter]: 41 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:46:30,310 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 42 thread instances. [2025-04-25 02:46:30,371 INFO L143 ThreadInstanceAdder]: Constructed 42 joinOtherThreadTransitions. [2025-04-25 02:46:30,376 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:46:30,419 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:46:30,420 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:46:30,420 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:46:30,420 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:46:34,771 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:46:34,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:34,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1510533915, now seen corresponding path program 1 times [2025-04-25 02:46:34,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:34,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389329706] [2025-04-25 02:46:34,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:46:34,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:34,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-04-25 02:46:34,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-04-25 02:46:34,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:46:34,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:46:34,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:46:34,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389329706] [2025-04-25 02:46:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389329706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:46:34,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:46:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:46:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779222] [2025-04-25 02:46:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:46:34,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:46:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:46:34,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:46:34,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:46:34,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:34,857 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:46:34,857 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 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-04-25 02:46:34,857 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:45,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:45,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2025-04-25 02:46:45,830 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:46:45,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2083739060, now seen corresponding path program 1 times [2025-04-25 02:46:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:45,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371940678] [2025-04-25 02:46:45,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:46:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:45,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 808 statements into 1 equivalence classes. [2025-04-25 02:46:45,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 808 of 808 statements. [2025-04-25 02:46:45,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:46:45,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:46:46,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:46:46,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371940678] [2025-04-25 02:46:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371940678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:46:46,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:46:46,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:46:46,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441495611] [2025-04-25 02:46:46,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:46:46,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:46:46,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:46:46,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:46:46,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:46:46,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:46,247 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:46:46,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 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-04-25 02:46:46,247 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:46,247 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:47,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:47,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:47,244 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2025-04-25 02:46:47,244 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:46:47,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:47,244 INFO L85 PathProgramCache]: Analyzing trace with hash -277682696, now seen corresponding path program 2 times [2025-04-25 02:46:47,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:47,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637239012] [2025-04-25 02:46:47,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:46:47,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:47,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 808 statements into 1 equivalence classes. [2025-04-25 02:46:47,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 808 of 808 statements. [2025-04-25 02:46:47,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:46:47,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:46:47,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:46:47,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637239012] [2025-04-25 02:46:47,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637239012] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:46:47,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:46:47,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:46:47,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267587954] [2025-04-25 02:46:47,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:46:47,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:46:47,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:46:47,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:46:47,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:46:47,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:47,961 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:46:47,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.25) internal successors, (729), 3 states have internal predecessors, (729), 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-04-25 02:46:47,961 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:47,961 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:47,961 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:54,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:54,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:46:54,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:46:54,109 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2025-04-25 02:46:54,109 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:46:54,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:54,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1893128819, now seen corresponding path program 1 times [2025-04-25 02:46:54,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:54,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486981675] [2025-04-25 02:46:54,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:46:54,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:54,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-04-25 02:46:54,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-04-25 02:46:54,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:46:54,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:46:54,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:46:54,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-04-25 02:46:54,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-04-25 02:46:54,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:46:54,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:46:54,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:46:54,386 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:46:54,386 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:46:54,387 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:46:54,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2025-04-25 02:46:54,391 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:46:54,391 WARN L247 ceAbstractionStarter]: 42 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:46:54,391 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 43 thread instances. [2025-04-25 02:46:54,454 INFO L143 ThreadInstanceAdder]: Constructed 43 joinOtherThreadTransitions. [2025-04-25 02:46:54,458 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:46:54,504 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:46:54,504 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:46:54,504 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:46:54,504 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:46:58,878 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:46:58,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:46:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash -28817260, now seen corresponding path program 1 times [2025-04-25 02:46:58,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:46:58,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793972790] [2025-04-25 02:46:58,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:46:58,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:46:58,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-04-25 02:46:58,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-04-25 02:46:58,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:46:58,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:46:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:46:58,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:46:58,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793972790] [2025-04-25 02:46:58,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793972790] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:46:58,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:46:58,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:46:58,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720092631] [2025-04-25 02:46:58,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:46:58,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:46:58,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:46:58,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:46:58,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:46:58,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:46:58,965 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:46:58,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 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-04-25 02:46:58,965 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:10,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:10,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2025-04-25 02:47:10,454 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:47:10,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:47:10,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1015284117, now seen corresponding path program 1 times [2025-04-25 02:47:10,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:47:10,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144422785] [2025-04-25 02:47:10,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:47:10,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:47:10,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-04-25 02:47:10,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-04-25 02:47:10,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:47:10,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:47:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:47:10,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:47:10,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144422785] [2025-04-25 02:47:10,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144422785] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:47:10,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:47:10,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:47:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920022635] [2025-04-25 02:47:10,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:47:10,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:47:10,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:47:10,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:47:10,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:47:10,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:10,893 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:47:10,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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-04-25 02:47:10,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:10,893 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:11,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:11,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:47:11,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2025-04-25 02:47:11,723 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:47:11,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:47:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash 205006663, now seen corresponding path program 2 times [2025-04-25 02:47:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:47:11,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348888186] [2025-04-25 02:47:11,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:47:11,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:47:11,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 828 statements into 1 equivalence classes. [2025-04-25 02:47:11,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-04-25 02:47:11,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:47:11,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:47:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:47:12,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:47:12,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348888186] [2025-04-25 02:47:12,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348888186] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:47:12,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:47:12,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:47:12,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93480370] [2025-04-25 02:47:12,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:47:12,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:47:12,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:47:12,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:47:12,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:47:12,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:12,387 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:47:12,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 186.75) internal successors, (747), 3 states have internal predecessors, (747), 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-04-25 02:47:12,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:12,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:47:12,388 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:19,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:19,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:47:19,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:47:19,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2025-04-25 02:47:19,064 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:47:19,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:47:19,065 INFO L85 PathProgramCache]: Analyzing trace with hash -677462232, now seen corresponding path program 1 times [2025-04-25 02:47:19,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:47:19,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423591933] [2025-04-25 02:47:19,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:47:19,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:47:19,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-04-25 02:47:19,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-04-25 02:47:19,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:47:19,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:47:19,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:47:19,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-04-25 02:47:19,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-04-25 02:47:19,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:47:19,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:47:19,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:47:19,361 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:47:19,361 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:47:19,361 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:47:19,361 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2025-04-25 02:47:19,366 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:47:19,366 WARN L247 ceAbstractionStarter]: 43 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:47:19,366 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 44 thread instances. [2025-04-25 02:47:19,432 INFO L143 ThreadInstanceAdder]: Constructed 44 joinOtherThreadTransitions. [2025-04-25 02:47:19,436 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:47:19,484 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:47:19,484 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:47:19,484 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:47:19,484 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:47:24,864 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:47:24,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:47:24,865 INFO L85 PathProgramCache]: Analyzing trace with hash -834886814, now seen corresponding path program 1 times [2025-04-25 02:47:24,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:47:24,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034308779] [2025-04-25 02:47:24,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:47:24,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:47:24,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-04-25 02:47:24,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-04-25 02:47:24,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:47:24,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:47:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:47:25,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:47:25,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034308779] [2025-04-25 02:47:25,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034308779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:47:25,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:47:25,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:47:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001625110] [2025-04-25 02:47:25,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:47:25,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:47:25,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:47:25,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:47:25,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:47:25,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:25,028 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:47:25,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 155.5) internal successors, (311), 2 states have internal predecessors, (311), 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-04-25 02:47:25,028 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:37,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:37,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2025-04-25 02:47:37,943 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:47:37,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:47:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1767103235, now seen corresponding path program 1 times [2025-04-25 02:47:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:47:37,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735030823] [2025-04-25 02:47:37,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:47:37,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:47:38,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 848 statements into 1 equivalence classes. [2025-04-25 02:47:38,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 848 of 848 statements. [2025-04-25 02:47:38,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:47:38,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:47:38,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-04-25 02:47:38,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:47:38,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735030823] [2025-04-25 02:47:38,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735030823] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:47:38,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:47:38,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:47:38,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222781192] [2025-04-25 02:47:38,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:47:38,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:47:38,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:47:38,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:47:38,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:47:38,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:38,400 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:47:38,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-04-25 02:47:38,400 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:38,400 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:39,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:39,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:47:39,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2025-04-25 02:47:39,181 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:47:39,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:47:39,182 INFO L85 PathProgramCache]: Analyzing trace with hash -423395913, now seen corresponding path program 2 times [2025-04-25 02:47:39,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:47:39,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724712050] [2025-04-25 02:47:39,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:47:39,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:47:39,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 848 statements into 1 equivalence classes. [2025-04-25 02:47:39,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 848 of 848 statements. [2025-04-25 02:47:39,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:47:39,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:47:39,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:47:39,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:47:39,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724712050] [2025-04-25 02:47:39,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724712050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:47:39,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:47:40,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:47:40,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558192698] [2025-04-25 02:47:40,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:47:40,000 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:47:40,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:47:40,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:47:40,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:47:40,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:40,001 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:47:40,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 191.25) internal successors, (765), 3 states have internal predecessors, (765), 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-04-25 02:47:40,001 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:40,001 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:47:40,001 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:46,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:46,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:47:46,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:47:46,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2025-04-25 02:47:46,850 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:47:46,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:47:46,850 INFO L85 PathProgramCache]: Analyzing trace with hash -408486230, now seen corresponding path program 1 times [2025-04-25 02:47:46,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:47:46,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666317635] [2025-04-25 02:47:46,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:47:46,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:47:46,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-04-25 02:47:46,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-04-25 02:47:46,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:47:46,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:47:46,947 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:47:46,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-04-25 02:47:46,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-04-25 02:47:46,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:47:46,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:47:47,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:47:47,180 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:47:47,180 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:47:47,180 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:47:47,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2025-04-25 02:47:47,185 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:47:47,185 WARN L247 ceAbstractionStarter]: 44 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:47:47,185 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 45 thread instances. [2025-04-25 02:47:47,251 INFO L143 ThreadInstanceAdder]: Constructed 45 joinOtherThreadTransitions. [2025-04-25 02:47:47,255 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:47:47,303 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:47:47,304 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:47:47,304 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:47:47,304 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:47:52,298 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:47:52,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:47:52,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1003193849, now seen corresponding path program 1 times [2025-04-25 02:47:52,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:47:52,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225225573] [2025-04-25 02:47:52,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:47:52,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:47:52,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-04-25 02:47:52,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-04-25 02:47:52,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:47:52,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:47:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:47:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:47:52,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225225573] [2025-04-25 02:47:52,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225225573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:47:52,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:47:52,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:47:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311351459] [2025-04-25 02:47:52,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:47:52,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:47:52,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:47:52,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:47:52,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:47:52,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:47:52,393 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:47:52,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 159.0) internal successors, (318), 2 states have internal predecessors, (318), 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-04-25 02:47:52,393 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:05,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:05,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2025-04-25 02:48:05,439 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:48:05,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:48:05,440 INFO L85 PathProgramCache]: Analyzing trace with hash 246056721, now seen corresponding path program 1 times [2025-04-25 02:48:05,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:48:05,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981169500] [2025-04-25 02:48:05,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:48:05,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:48:05,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 868 statements into 1 equivalence classes. [2025-04-25 02:48:05,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 868 of 868 statements. [2025-04-25 02:48:05,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:48:05,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:48:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:48:05,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:48:05,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981169500] [2025-04-25 02:48:05,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981169500] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:48:05,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:48:05,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:48:05,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676792961] [2025-04-25 02:48:05,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:48:05,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:48:05,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:48:05,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:48:05,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:48:05,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:05,913 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:48:05,913 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-04-25 02:48:05,913 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:05,913 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:06,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:06,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:48:06,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2025-04-25 02:48:06,756 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:48:06,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:48:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash -501526395, now seen corresponding path program 2 times [2025-04-25 02:48:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:48:06,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744647365] [2025-04-25 02:48:06,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:48:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:48:06,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 868 statements into 1 equivalence classes. [2025-04-25 02:48:06,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 868 of 868 statements. [2025-04-25 02:48:06,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:48:06,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:48:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:48:07,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:48:07,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744647365] [2025-04-25 02:48:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744647365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:48:07,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:48:07,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:48:07,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590095780] [2025-04-25 02:48:07,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:48:07,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:48:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:48:07,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:48:07,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:48:07,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:07,647 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:48:07,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.75) internal successors, (783), 3 states have internal predecessors, (783), 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-04-25 02:48:07,648 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:07,648 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:48:07,648 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:15,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:15,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:48:15,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:48:15,653 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2025-04-25 02:48:15,653 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:48:15,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:48:15,653 INFO L85 PathProgramCache]: Analyzing trace with hash -600345793, now seen corresponding path program 1 times [2025-04-25 02:48:15,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:48:15,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030983745] [2025-04-25 02:48:15,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:48:15,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:48:15,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-04-25 02:48:15,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-04-25 02:48:15,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:48:15,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:48:15,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:48:15,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-04-25 02:48:15,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-04-25 02:48:15,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:48:15,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:48:15,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:48:15,981 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:48:15,981 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:48:15,981 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:48:15,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2025-04-25 02:48:15,987 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:48:15,987 WARN L247 ceAbstractionStarter]: 45 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:48:15,987 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 46 thread instances. [2025-04-25 02:48:16,060 INFO L143 ThreadInstanceAdder]: Constructed 46 joinOtherThreadTransitions. [2025-04-25 02:48:16,064 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:48:16,112 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:48:16,113 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:48:16,113 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:48:16,113 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:48:21,449 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:48:21,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:48:21,449 INFO L85 PathProgramCache]: Analyzing trace with hash 906226821, now seen corresponding path program 1 times [2025-04-25 02:48:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:48:21,449 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228845842] [2025-04-25 02:48:21,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:48:21,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:48:21,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-04-25 02:48:21,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-04-25 02:48:21,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:48:21,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:48:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:48:21,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:48:21,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228845842] [2025-04-25 02:48:21,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228845842] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:48:21,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:48:21,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:48:21,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714931883] [2025-04-25 02:48:21,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:48:21,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:48:21,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:48:21,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:48:21,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:48:21,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:21,581 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:48:21,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 162.5) internal successors, (325), 2 states have internal predecessors, (325), 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-04-25 02:48:21,581 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:36,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:36,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2025-04-25 02:48:36,704 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:48:36,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:48:36,704 INFO L85 PathProgramCache]: Analyzing trace with hash 138777179, now seen corresponding path program 1 times [2025-04-25 02:48:36,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:48:36,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366487109] [2025-04-25 02:48:36,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:48:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:48:36,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 888 statements into 1 equivalence classes. [2025-04-25 02:48:36,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 888 of 888 statements. [2025-04-25 02:48:36,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:48:36,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:48:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:48:37,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:48:37,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366487109] [2025-04-25 02:48:37,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366487109] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:48:37,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:48:37,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:48:37,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581753457] [2025-04-25 02:48:37,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:48:37,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:48:37,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:48:37,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:48:37,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:48:37,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:37,196 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:48:37,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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-04-25 02:48:37,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:37,196 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:38,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:38,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:48:38,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2025-04-25 02:48:38,028 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:48:38,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:48:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1475542727, now seen corresponding path program 2 times [2025-04-25 02:48:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:48:38,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559743761] [2025-04-25 02:48:38,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:48:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:48:38,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 888 statements into 1 equivalence classes. [2025-04-25 02:48:38,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 888 of 888 statements. [2025-04-25 02:48:38,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 02:48:38,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:48:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:48:38,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:48:38,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559743761] [2025-04-25 02:48:38,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559743761] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:48:38,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:48:38,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:48:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413451497] [2025-04-25 02:48:38,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:48:38,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:48:38,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:48:38,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:48:38,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:48:38,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:38,765 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:48:38,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 200.25) internal successors, (801), 3 states have internal predecessors, (801), 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-04-25 02:48:38,765 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:38,765 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:48:38,765 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:46,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:46,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:48:46,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:48:46,656 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2025-04-25 02:48:46,656 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:48:46,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:48:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1992655371, now seen corresponding path program 1 times [2025-04-25 02:48:46,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:48:46,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040668389] [2025-04-25 02:48:46,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:48:46,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:48:46,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-04-25 02:48:46,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-04-25 02:48:46,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:48:46,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:48:46,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:48:46,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-04-25 02:48:46,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-04-25 02:48:46,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:48:46,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:48:47,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:48:47,138 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:48:47,139 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:48:47,139 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-25 02:48:47,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2025-04-25 02:48:47,144 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-25 02:48:47,144 WARN L247 ceAbstractionStarter]: 46 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-25 02:48:47,144 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 47 thread instances. [2025-04-25 02:48:47,212 INFO L143 ThreadInstanceAdder]: Constructed 47 joinOtherThreadTransitions. [2025-04-25 02:48:47,216 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:48:47,276 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:48:47,276 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:48:47,276 INFO L340 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;@76cf1a80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:48:47,276 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:48:52,227 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-25 02:48:52,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:48:52,227 INFO L85 PathProgramCache]: Analyzing trace with hash 227373851, now seen corresponding path program 1 times [2025-04-25 02:48:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:48:52,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123180325] [2025-04-25 02:48:52,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:48:52,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:48:52,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-04-25 02:48:52,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-04-25 02:48:52,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:48:52,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:48:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:48:52,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:48:52,327 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123180325] [2025-04-25 02:48:52,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123180325] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:48:52,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:48:52,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 02:48:52,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663680343] [2025-04-25 02:48:52,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:48:52,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-25 02:48:52,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:48:52,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-25 02:48:52,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-25 02:48:52,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:48:52,327 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:48:52,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 166.0) internal successors, (332), 2 states have internal predecessors, (332), 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-04-25 02:48:52,328 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.