./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 01849734 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_60-invariant_racefree.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 ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-0184973-m [2025-04-24 16:42:24,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 16:42:24,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 16:42:24,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 16:42:24,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 16:42:24,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 16:42:24,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 16:42:24,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 16:42:24,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 16:42:24,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 16:42:24,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 16:42:24,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 16:42:24,236 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 16:42:24,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 16:42:24,237 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 16:42:24,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 16:42:24,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 16:42:24,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 16:42:24,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 16:42:24,238 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 16:42:24,238 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 16:42:24,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 16:42:24,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 16:42:24,238 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 16:42:24,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 16:42:24,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 16:42:24,238 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 16:42:24,238 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 16:42:24,238 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 -> ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 [2025-04-24 16:42:24,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 16:42:24,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 16:42:24,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 16:42:24,482 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 16:42:24,483 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 16:42:24,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2025-04-24 16:42:25,783 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e1730f7b3/1fdf9cd5ccad42538178f7c00ba64393/FLAGcf1093791 [2025-04-24 16:42:26,044 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 16:42:26,047 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2025-04-24 16:42:26,061 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e1730f7b3/1fdf9cd5ccad42538178f7c00ba64393/FLAGcf1093791 [2025-04-24 16:42:26,833 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e1730f7b3/1fdf9cd5ccad42538178f7c00ba64393 [2025-04-24 16:42:26,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 16:42:26,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 16:42:26,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 16:42:26,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 16:42:26,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 16:42:26,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 04:42:26" (1/1) ... [2025-04-24 16:42:26,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72edf3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:26, skipping insertion in model container [2025-04-24 16:42:26,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 04:42:26" (1/1) ... [2025-04-24 16:42:26,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 16:42:27,103 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_60-invariant_racefree.i[30176,30189] [2025-04-24 16:42:27,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 16:42:27,146 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 16:42:27,196 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_60-invariant_racefree.i[30176,30189] [2025-04-24 16:42:27,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 16:42:27,242 INFO L204 MainTranslator]: Completed translation [2025-04-24 16:42:27,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27 WrapperNode [2025-04-24 16:42:27,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 16:42:27,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 16:42:27,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 16:42:27,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 16:42:27,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (1/1) ... [2025-04-24 16:42:27,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (1/1) ... [2025-04-24 16:42:27,292 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2025-04-24 16:42:27,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 16:42:27,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 16:42:27,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 16:42:27,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 16:42:27,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (1/1) ... [2025-04-24 16:42:27,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (1/1) ... [2025-04-24 16:42:27,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (1/1) ... [2025-04-24 16:42:27,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (1/1) ... [2025-04-24 16:42:27,309 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (1/1) ... [2025-04-24 16:42:27,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (1/1) ... [2025-04-24 16:42:27,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (1/1) ... [2025-04-24 16:42:27,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (1/1) ... [2025-04-24 16:42:27,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (1/1) ... [2025-04-24 16:42:27,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 16:42:27,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 16:42:27,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 16:42:27,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 16:42:27,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (1/1) ... [2025-04-24 16:42:27,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 16:42:27,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:42:27,345 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-24 16:42:27,351 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-24 16:42:27,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-24 16:42:27,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-24 16:42:27,366 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-24 16:42:27,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 16:42:27,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-24 16:42:27,366 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-24 16:42:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-24 16:42:27,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-24 16:42:27,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 16:42:27,367 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-24 16:42:27,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 16:42:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 16:42:27,368 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 16:42:27,458 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 16:42:27,459 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 16:42:27,657 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 16:42:27,657 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 16:42:27,748 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 16:42:27,748 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2025-04-24 16:42:27,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 04:42:27 BoogieIcfgContainer [2025-04-24 16:42:27,748 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 16:42:27,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 16:42:27,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 16:42:27,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 16:42:27,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 04:42:26" (1/3) ... [2025-04-24 16:42:27,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e698dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 04:42:27, skipping insertion in model container [2025-04-24 16:42:27,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 04:42:27" (2/3) ... [2025-04-24 16:42:27,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e698dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 04:42:27, skipping insertion in model container [2025-04-24 16:42:27,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 04:42:27" (3/3) ... [2025-04-24 16:42:27,754 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2025-04-24 16:42:27,764 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 16:42:27,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_60-invariant_racefree.i that has 2 procedures, 64 locations, 83 edges, 1 initial locations, 10 loop locations, and 2 error locations. [2025-04-24 16:42:27,767 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 16:42:27,801 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-24 16:42:27,833 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:42:27,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 16:42:27,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 16:42:27,838 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-24 16:42:27,839 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-24 16:42:27,920 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 16:42:27,934 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2025-04-24 16:42:27,939 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;@7710e38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:42:27,939 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 16:42:28,008 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:42:28,009 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:28,009 INFO L139 ounterexampleChecker]: Examining path program with hash -413472638, occurence #1 [2025-04-24 16:42:28,009 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:28,009 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:28,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash -667056722, now seen corresponding path program 1 times [2025-04-24 16:42:28,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:28,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172356830] [2025-04-24 16:42:28,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:28,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:28,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-24 16:42:28,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-24 16:42:28,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:28,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:28,288 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-24 16:42:28,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:28,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172356830] [2025-04-24 16:42:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172356830] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:28,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:28,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 16:42:28,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718882212] [2025-04-24 16:42:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:28,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 16:42:28,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:28,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 16:42:28,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-24 16:42:28,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:28,308 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:28,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 16:42:28,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:28,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:28,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 16:42:28,498 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:42:28,499 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:28,499 INFO L139 ounterexampleChecker]: Examining path program with hash -1969024193, occurence #1 [2025-04-24 16:42:28,499 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:28,499 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:28,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1264317506, now seen corresponding path program 1 times [2025-04-24 16:42:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:28,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940024477] [2025-04-24 16:42:28,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:28,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:28,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-24 16:42:28,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-24 16:42:28,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:28,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 16:42:28,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:28,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940024477] [2025-04-24 16:42:28,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940024477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:28,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:28,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 16:42:28,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567244552] [2025-04-24 16:42:28,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:28,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 16:42:28,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:28,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 16:42:28,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 16:42:28,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:28,584 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:28,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-24 16:42:28,584 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:28,584 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:28,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:28,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:28,631 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 16:42:28,632 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-24 16:42:28,636 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-24 16:42:28,637 INFO L320 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2025-04-24 16:42:28,640 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:42:28,640 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 16:42:28,641 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 16:42:28,641 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;@7710e38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:42:28,641 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 16:42:28,646 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:42:28,646 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:28,646 INFO L139 ounterexampleChecker]: Examining path program with hash -1376380595, occurence #1 [2025-04-24 16:42:28,646 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:28,646 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:28,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1120953952, now seen corresponding path program 1 times [2025-04-24 16:42:28,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:28,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249065873] [2025-04-24 16:42:28,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:28,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:28,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-24 16:42:28,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-24 16:42:28,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:28,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:28,676 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-24 16:42:28,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:28,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249065873] [2025-04-24 16:42:28,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249065873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:28,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:28,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 16:42:28,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875252534] [2025-04-24 16:42:28,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:28,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 16:42:28,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:28,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 16:42:28,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 16:42:28,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:28,677 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:28,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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-24 16:42:28,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:28,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:28,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-24 16:42:28,726 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:42:28,726 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:28,726 INFO L139 ounterexampleChecker]: Examining path program with hash 1035583475, occurence #1 [2025-04-24 16:42:28,726 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:28,726 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:28,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:28,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1091370528, now seen corresponding path program 1 times [2025-04-24 16:42:28,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:28,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132004909] [2025-04-24 16:42:28,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:28,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:28,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-24 16:42:28,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-24 16:42:28,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:28,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:28,805 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-24 16:42:28,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:28,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132004909] [2025-04-24 16:42:28,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132004909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:28,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:28,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 16:42:28,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924248969] [2025-04-24 16:42:28,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:28,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 16:42:28,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:28,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 16:42:28,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-24 16:42:28,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:28,808 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:28,808 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-24 16:42:28,808 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:28,808 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:28,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:28,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:28,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-24 16:42:28,859 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:42:28,859 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:28,859 INFO L139 ounterexampleChecker]: Examining path program with hash -1809062991, occurence #1 [2025-04-24 16:42:28,859 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:28,859 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:28,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:28,860 INFO L85 PathProgramCache]: Analyzing trace with hash 757287890, now seen corresponding path program 1 times [2025-04-24 16:42:28,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:28,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617308020] [2025-04-24 16:42:28,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:28,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:28,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-24 16:42:28,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-24 16:42:28,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:28,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:42:28,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 16:42:28,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-24 16:42:28,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-24 16:42:28,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:28,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:42:28,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 16:42:28,904 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 16:42:28,904 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 16:42:28,904 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 16:42:28,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-24 16:42:28,906 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-24 16:42:28,907 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2025-04-24 16:42:28,908 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 16:42:28,908 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-24 16:42:28,926 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-24 16:42:28,928 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:42:28,936 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 16:42:28,937 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2025-04-24 16:42:28,937 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;@7710e38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:42:28,937 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 16:42:29,156 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:42:29,156 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:29,156 INFO L139 ounterexampleChecker]: Examining path program with hash -488906551, occurence #1 [2025-04-24 16:42:29,156 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:29,156 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:29,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:29,156 INFO L85 PathProgramCache]: Analyzing trace with hash -755429626, now seen corresponding path program 1 times [2025-04-24 16:42:29,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:29,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590462219] [2025-04-24 16:42:29,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:29,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:29,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-24 16:42:29,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-24 16:42:29,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:29,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:29,210 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-24 16:42:29,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:29,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590462219] [2025-04-24 16:42:29,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590462219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:29,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:29,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 16:42:29,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727422888] [2025-04-24 16:42:29,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:29,211 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 16:42:29,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:29,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 16:42:29,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-24 16:42:29,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:29,211 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:29,211 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 16:42:29,211 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:29,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:29,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-24 16:42:29,960 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:42:29,960 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:29,961 INFO L139 ounterexampleChecker]: Examining path program with hash -492014679, occurence #1 [2025-04-24 16:42:29,961 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:29,961 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:29,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash -862415390, now seen corresponding path program 1 times [2025-04-24 16:42:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:29,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879533373] [2025-04-24 16:42:29,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:29,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:29,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-24 16:42:29,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 16:42:29,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:29,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:30,042 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-24 16:42:30,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:30,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879533373] [2025-04-24 16:42:30,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879533373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:30,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:30,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 16:42:30,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846659545] [2025-04-24 16:42:30,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:30,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 16:42:30,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:30,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 16:42:30,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 16:42:30,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,043 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:30,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) 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-24 16:42:30,043 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:30,043 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:30,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:30,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-24 16:42:30,265 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:42:30,265 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:30,265 INFO L139 ounterexampleChecker]: Examining path program with hash -1259585506, occurence #1 [2025-04-24 16:42:30,265 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:30,265 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:30,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2061826192, now seen corresponding path program 1 times [2025-04-24 16:42:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:30,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215380312] [2025-04-24 16:42:30,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:30,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:30,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-24 16:42:30,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-24 16:42:30,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:30,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:30,337 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-24 16:42:30,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:30,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215380312] [2025-04-24 16:42:30,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215380312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:30,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:30,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 16:42:30,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130670773] [2025-04-24 16:42:30,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:30,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 16:42:30,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:30,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 16:42:30,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-24 16:42:30,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,338 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:30,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-24 16:42:30,339 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:30,339 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:30,339 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:30,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:30,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:30,495 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 16:42:30,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-24 16:42:30,496 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-24 16:42:30,496 INFO L320 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2025-04-24 16:42:30,498 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:42:30,498 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 16:42:30,498 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 16:42:30,498 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;@7710e38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:42:30,498 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 16:42:30,502 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:42:30,502 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:30,503 INFO L139 ounterexampleChecker]: Examining path program with hash 660308422, occurence #1 [2025-04-24 16:42:30,503 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:30,503 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:30,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:30,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1966203024, now seen corresponding path program 1 times [2025-04-24 16:42:30,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:30,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585136099] [2025-04-24 16:42:30,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:30,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:30,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 16:42:30,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 16:42:30,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:30,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:30,516 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-24 16:42:30,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:30,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585136099] [2025-04-24 16:42:30,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585136099] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:30,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:30,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 16:42:30,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296051301] [2025-04-24 16:42:30,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:30,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 16:42:30,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:30,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 16:42:30,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 16:42:30,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,517 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:30,517 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-24 16:42:30,517 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-24 16:42:30,535 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:42:30,535 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:30,535 INFO L139 ounterexampleChecker]: Examining path program with hash 761985634, occurence #1 [2025-04-24 16:42:30,535 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:30,535 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:30,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash -91850896, now seen corresponding path program 1 times [2025-04-24 16:42:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:30,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24645712] [2025-04-24 16:42:30,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:30,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-24 16:42:30,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-24 16:42:30,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:30,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:30,614 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-24 16:42:30,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:30,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24645712] [2025-04-24 16:42:30,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24645712] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:30,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:30,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 16:42:30,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566358785] [2025-04-24 16:42:30,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:30,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 16:42:30,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:30,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 16:42:30,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 16:42:30,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,615 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:30,615 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 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-24 16:42:30,615 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,615 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,653 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:30,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-24 16:42:30,654 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:42:30,654 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:30,654 INFO L139 ounterexampleChecker]: Examining path program with hash 1204169608, occurence #1 [2025-04-24 16:42:30,654 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:30,654 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:30,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1625790978, now seen corresponding path program 1 times [2025-04-24 16:42:30,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:30,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710854750] [2025-04-24 16:42:30,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:30,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:30,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-24 16:42:30,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-24 16:42:30,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:30,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:30,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-24 16:42:30,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:30,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710854750] [2025-04-24 16:42:30,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710854750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:30,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:30,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 16:42:30,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747044445] [2025-04-24 16:42:30,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:30,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 16:42:30,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:30,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 16:42:30,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 16:42:30,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,765 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:30,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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-24 16:42:30,765 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,765 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:30,765 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:30,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:30,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:30,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-24 16:42:30,838 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:42:30,838 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:30,838 INFO L139 ounterexampleChecker]: Examining path program with hash -2092138214, occurence #1 [2025-04-24 16:42:30,838 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:30,838 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:30,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash -688933712, now seen corresponding path program 1 times [2025-04-24 16:42:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:30,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207339594] [2025-04-24 16:42:30,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:30,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-24 16:42:30,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-24 16:42:30,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:30,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:42:30,861 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 16:42:30,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-24 16:42:30,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-24 16:42:30,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:30,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:42:30,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 16:42:30,881 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 16:42:30,881 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 16:42:30,881 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 16:42:30,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-24 16:42:30,883 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-24 16:42:30,884 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2025-04-24 16:42:30,884 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 16:42:30,884 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-24 16:42:30,906 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-24 16:42:30,910 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:42:30,919 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 16:42:30,919 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 16:42:30,919 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;@7710e38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:42:30,919 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-24 16:42:30,987 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:42:30,987 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:30,988 INFO L139 ounterexampleChecker]: Examining path program with hash 1471020453, occurence #1 [2025-04-24 16:42:30,988 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:30,988 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:30,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1849369281, now seen corresponding path program 1 times [2025-04-24 16:42:30,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:30,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037617264] [2025-04-24 16:42:30,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:30,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:30,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-24 16:42:30,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-24 16:42:30,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:30,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:31,007 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-24 16:42:31,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:31,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037617264] [2025-04-24 16:42:31,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037617264] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:31,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:31,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 16:42:31,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169176507] [2025-04-24 16:42:31,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:31,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 16:42:31,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:31,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 16:42:31,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 16:42:31,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,009 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:31,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-24 16:42:31,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-24 16:42:31,039 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:42:31,039 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:31,039 INFO L139 ounterexampleChecker]: Examining path program with hash -553706315, occurence #1 [2025-04-24 16:42:31,039 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:31,039 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:31,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:31,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1314329217, now seen corresponding path program 1 times [2025-04-24 16:42:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:31,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712476708] [2025-04-24 16:42:31,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:31,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:31,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-24 16:42:31,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-24 16:42:31,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:31,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:31,124 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-24 16:42:31,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:31,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712476708] [2025-04-24 16:42:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712476708] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:31,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:31,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 16:42:31,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195230569] [2025-04-24 16:42:31,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:31,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 16:42:31,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:31,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 16:42:31,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 16:42:31,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,125 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:31,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-24 16:42:31,125 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,125 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:31,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-24 16:42:31,189 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:42:31,189 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:31,189 INFO L139 ounterexampleChecker]: Examining path program with hash -1938290322, occurence #1 [2025-04-24 16:42:31,189 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:31,189 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:31,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash 849577265, now seen corresponding path program 1 times [2025-04-24 16:42:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:31,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419908078] [2025-04-24 16:42:31,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:31,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:31,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-24 16:42:31,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-24 16:42:31,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:31,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:31,291 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-24 16:42:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:31,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419908078] [2025-04-24 16:42:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419908078] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:31,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:31,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 16:42:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152021765] [2025-04-24 16:42:31,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:31,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 16:42:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:31,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 16:42:31,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 16:42:31,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,293 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:31,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 16:42:31,293 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,293 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:31,293 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:31,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:31,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-24 16:42:31,372 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:42:31,373 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:31,373 INFO L139 ounterexampleChecker]: Examining path program with hash 1704642743, occurence #1 [2025-04-24 16:42:31,373 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:31,373 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:31,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash 753455423, now seen corresponding path program 1 times [2025-04-24 16:42:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:31,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39238619] [2025-04-24 16:42:31,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:31,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-24 16:42:31,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-24 16:42:31,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:31,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:31,480 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-24 16:42:31,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:31,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39238619] [2025-04-24 16:42:31,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39238619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:31,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:31,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 16:42:31,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516158626] [2025-04-24 16:42:31,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:31,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 16:42:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:31,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 16:42:31,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 16:42:31,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,483 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:31,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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-24 16:42:31,483 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,483 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:31,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:31,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:31,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:31,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:31,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-24 16:42:31,574 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-24 16:42:31,574 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:31,574 INFO L139 ounterexampleChecker]: Examining path program with hash -1453320304, occurence #1 [2025-04-24 16:42:31,574 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:31,574 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:31,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1094641615, now seen corresponding path program 1 times [2025-04-24 16:42:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:31,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942622679] [2025-04-24 16:42:31,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:31,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-24 16:42:31,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-24 16:42:31,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:31,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:42:31,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-24 16:42:31,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-24 16:42:31,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-24 16:42:31,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:31,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-24 16:42:31,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-24 16:42:31,617 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-24 16:42:31,617 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-24 16:42:31,617 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-04-24 16:42:31,617 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-24 16:42:31,618 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-24 16:42:31,618 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2025-04-24 16:42:31,618 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-24 16:42:31,618 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-24 16:42:31,641 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-24 16:42:31,643 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:42:31,671 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 16:42:31,671 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2025-04-24 16:42:31,671 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;@7710e38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:42:31,671 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 16:42:31,775 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:42:31,776 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:31,776 INFO L139 ounterexampleChecker]: Examining path program with hash -1749592861, occurence #1 [2025-04-24 16:42:31,776 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:31,776 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:31,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1387302353, now seen corresponding path program 1 times [2025-04-24 16:42:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:31,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248603205] [2025-04-24 16:42:31,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:31,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-24 16:42:31,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-24 16:42:31,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:31,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:31,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-24 16:42:31,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:31,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248603205] [2025-04-24 16:42:31,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248603205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:31,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:31,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 16:42:31,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094400287] [2025-04-24 16:42:31,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:31,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 16:42:31,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:31,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 16:42:31,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 16:42:31,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,795 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:31,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 16:42:31,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,840 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-24 16:42:31,840 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:42:31,840 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:31,841 INFO L139 ounterexampleChecker]: Examining path program with hash 1564159787, occurence #1 [2025-04-24 16:42:31,841 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:31,841 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:31,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:31,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2092615057, now seen corresponding path program 1 times [2025-04-24 16:42:31,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:31,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385079947] [2025-04-24 16:42:31,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:31,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:31,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-24 16:42:31,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-24 16:42:31,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:31,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:31,914 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-24 16:42:31,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:31,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385079947] [2025-04-24 16:42:31,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385079947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:31,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:31,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 16:42:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045599860] [2025-04-24 16:42:31,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:31,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 16:42:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:31,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 16:42:31,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 16:42:31,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,916 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:31,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 16:42:31,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,916 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:31,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:31,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-24 16:42:31,975 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:42:31,975 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:31,975 INFO L139 ounterexampleChecker]: Examining path program with hash 34010465, occurence #1 [2025-04-24 16:42:31,975 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:31,975 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:31,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:31,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1907726751, now seen corresponding path program 1 times [2025-04-24 16:42:31,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:31,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895332900] [2025-04-24 16:42:31,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:31,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:31,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-24 16:42:31,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-24 16:42:31,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:31,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:32,078 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-24 16:42:32,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:32,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895332900] [2025-04-24 16:42:32,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895332900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:32,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:32,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 16:42:32,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708671690] [2025-04-24 16:42:32,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:32,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 16:42:32,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:32,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 16:42:32,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 16:42:32,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,081 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:32,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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-24 16:42:32,081 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,081 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:32,081 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:32,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:32,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-24 16:42:32,175 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:42:32,175 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:32,175 INFO L139 ounterexampleChecker]: Examining path program with hash -714107090, occurence #1 [2025-04-24 16:42:32,175 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:32,175 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:32,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:32,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1027620049, now seen corresponding path program 1 times [2025-04-24 16:42:32,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:32,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199273468] [2025-04-24 16:42:32,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:32,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:32,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-24 16:42:32,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-24 16:42:32,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:32,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:32,272 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-24 16:42:32,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:32,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199273468] [2025-04-24 16:42:32,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199273468] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:32,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:32,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 16:42:32,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322469130] [2025-04-24 16:42:32,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:32,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 16:42:32,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:32,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 16:42:32,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 16:42:32,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,275 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:32,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 16:42:32,275 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,275 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:32,276 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:32,276 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:32,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:32,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:32,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-24 16:42:32,370 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:42:32,370 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:32,370 INFO L139 ounterexampleChecker]: Examining path program with hash -888954811, occurence #1 [2025-04-24 16:42:32,371 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:32,371 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:32,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:32,371 INFO L85 PathProgramCache]: Analyzing trace with hash 279824799, now seen corresponding path program 1 times [2025-04-24 16:42:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:32,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311900918] [2025-04-24 16:42:32,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:32,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:32,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-24 16:42:32,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-24 16:42:32,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:32,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:32,449 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-24 16:42:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:32,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311900918] [2025-04-24 16:42:32,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311900918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:32,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 16:42:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516537746] [2025-04-24 16:42:32,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:32,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 16:42:32,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:32,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 16:42:32,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 16:42:32,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,451 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:32,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-24 16:42:32,451 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,451 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:32,451 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:32,451 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:32,451 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:32,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:32,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:32,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 16:42:32,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-24 16:42:32,734 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:42:32,734 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:42:32,734 INFO L139 ounterexampleChecker]: Examining path program with hash 1956651222, occurence #1 [2025-04-24 16:42:32,734 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:42:32,734 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:42:32,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:42:32,734 INFO L85 PathProgramCache]: Analyzing trace with hash -68971469, now seen corresponding path program 1 times [2025-04-24 16:42:32,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:42:32,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263446288] [2025-04-24 16:42:32,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:42:32,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:42:32,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-24 16:42:32,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-24 16:42:32,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:42:32,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:42:32,822 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-24 16:42:32,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:42:32,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263446288] [2025-04-24 16:42:32,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263446288] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:42:32,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:42:32,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-24 16:42:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212106274] [2025-04-24 16:42:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:42:32,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-24 16:42:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:42:32,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-24 16:42:32,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-24 16:42:32,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,824 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:42:32,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 16:42:32,824 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:42:32,824 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:42:32,824 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:32,824 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 16:42:32,824 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-24 16:42:32,824 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:43:10,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:43:10,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:43:10,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 16:43:10,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 16:43:10,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:43:10,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-24 16:43:10,483 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-24 16:43:10,483 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-24 16:43:10,484 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-24 16:43:10,484 INFO L320 ceAbstractionStarter]: Result for error location t_funThread4of4ForFork0 was SAFE (1/5) [2025-04-24 16:43:10,487 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:43:10,487 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 16:43:10,488 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread2of4ForFork0 ======== [2025-04-24 16:43:10,488 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;@7710e38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 16:43:10,488 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-24 16:43:11,999 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:43:12,000 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:43:12,000 INFO L139 ounterexampleChecker]: Examining path program with hash 1536644355, occurence #1 [2025-04-24 16:43:12,000 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:43:12,000 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:43:12,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:43:12,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1248549742, now seen corresponding path program 1 times [2025-04-24 16:43:12,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:43:12,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032328178] [2025-04-24 16:43:12,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:43:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:43:12,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 16:43:12,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 16:43:12,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:43:12,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:43:12,012 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-24 16:43:12,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:43:12,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032328178] [2025-04-24 16:43:12,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032328178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:43:12,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:43:12,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-24 16:43:12,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610961076] [2025-04-24 16:43:12,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:43:12,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-24 16:43:12,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:43:12,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-24 16:43:12,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-24 16:43:12,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:43:12,014 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:43:12,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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-24 16:43:12,014 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:43:12,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:43:12,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-24 16:43:12,028 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:43:12,028 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:43:12,028 INFO L139 ounterexampleChecker]: Examining path program with hash 1739860090, occurence #1 [2025-04-24 16:43:12,029 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:43:12,029 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:43:12,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:43:12,029 INFO L85 PathProgramCache]: Analyzing trace with hash -410876846, now seen corresponding path program 1 times [2025-04-24 16:43:12,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:43:12,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69215122] [2025-04-24 16:43:12,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:43:12,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:43:12,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 16:43:12,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 16:43:12,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:43:12,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:43:12,078 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-24 16:43:12,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:43:12,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69215122] [2025-04-24 16:43:12,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69215122] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:43:12,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:43:12,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-24 16:43:12,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452725089] [2025-04-24 16:43:12,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:43:12,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-24 16:43:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:43:12,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-24 16:43:12,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-24 16:43:12,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:43:12,079 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:43:12,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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-24 16:43:12,080 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:43:12,080 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:43:12,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:43:12,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:43:12,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-24 16:43:12,115 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-24 16:43:12,115 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 16:43:12,115 INFO L139 ounterexampleChecker]: Examining path program with hash -928488938, occurence #1 [2025-04-24 16:43:12,115 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 16:43:12,115 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 16:43:12,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 16:43:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash -794568992, now seen corresponding path program 1 times [2025-04-24 16:43:12,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 16:43:12,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138895865] [2025-04-24 16:43:12,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 16:43:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 16:43:12,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-24 16:43:12,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-24 16:43:12,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 16:43:12,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 16:43:12,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-24 16:43:12,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 16:43:12,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138895865] [2025-04-24 16:43:12,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138895865] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 16:43:12,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 16:43:12,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-24 16:43:12,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154997879] [2025-04-24 16:43:12,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 16:43:12,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 16:43:12,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 16:43:12,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 16:43:12,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-24 16:43:12,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:43:12,172 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 16:43:12,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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-24 16:43:12,172 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 16:43:12,173 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 16:43:12,173 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.