./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/reorder_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/reorder_5.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:56:29,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:56:30,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 08:56:30,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:56:30,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:56:30,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:56:30,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:56:30,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:56:30,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:56:30,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:56:30,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:56:30,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:56:30,049 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:56:30,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:56:30,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:56:30,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:56:30,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:56:30,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:56:30,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:56:30,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:56:30,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:56:30,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:56:30,051 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 08:56:30,051 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 08:56:30,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:56:30,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:56:30,052 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:56:30,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:56:30,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:56:30,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:56:30,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:56:30,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:56:30,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:56:30,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:56:30,053 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:56:30,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:56:30,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:56:30,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:56:30,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:56:30,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:56:30,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:56:30,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:56:30,053 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-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 ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd [2025-02-06 08:56:30,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:56:30,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:56:30,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:56:30,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:56:30,375 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:56:30,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_5.i [2025-02-06 08:56:31,766 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bf6d1ff2/8f51996c912143ada7f54be6578433a0/FLAG46757c457 [2025-02-06 08:56:32,195 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:56:32,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/reorder_5.i [2025-02-06 08:56:32,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bf6d1ff2/8f51996c912143ada7f54be6578433a0/FLAG46757c457 [2025-02-06 08:56:32,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bf6d1ff2/8f51996c912143ada7f54be6578433a0 [2025-02-06 08:56:32,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:56:32,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:56:32,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:56:32,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:56:32,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:56:32,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:32,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b35a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32, skipping insertion in model container [2025-02-06 08:56:32,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:32,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:56:32,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:56:32,783 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:56:32,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:56:32,941 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:56:32,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32 WrapperNode [2025-02-06 08:56:32,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:56:32,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:56:32,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:56:32,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:56:32,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:32,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:33,001 INFO L138 Inliner]: procedures = 371, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 208 [2025-02-06 08:56:33,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:56:33,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:56:33,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:56:33,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:56:33,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:33,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:33,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:33,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:33,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:33,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:33,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:33,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:33,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:56:33,035 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:56:33,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:56:33,035 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:56:33,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32" (1/1) ... [2025-02-06 08:56:33,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:56:33,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:56:33,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:56:33,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:56:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 08:56:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:56:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:56:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 08:56:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 08:56:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-02-06 08:56:33,094 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-02-06 08:56:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 08:56:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:56:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-02-06 08:56:33,094 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-02-06 08:56:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 08:56:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:56:33,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:56:33,096 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 08:56:33,237 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:56:33,239 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:56:33,658 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1252: havoc main_~#setPool~0#1.base, main_~#setPool~0#1.offset; [2025-02-06 08:56:33,659 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1252-1: SUMMARY for call ULTIMATE.dealloc(main_~#setPool~0#1.base, main_~#setPool~0#1.offset); srcloc: null [2025-02-06 08:56:33,659 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253: havoc main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset; [2025-02-06 08:56:33,659 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253-1: SUMMARY for call ULTIMATE.dealloc(main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset); srcloc: null [2025-02-06 08:56:33,661 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 08:56:33,661 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:56:33,706 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:56:33,706 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 08:56:33,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:56:33 BoogieIcfgContainer [2025-02-06 08:56:33,707 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:56:33,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:56:33,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:56:33,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:56:33,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:56:32" (1/3) ... [2025-02-06 08:56:33,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11464f6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:56:33, skipping insertion in model container [2025-02-06 08:56:33,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:56:32" (2/3) ... [2025-02-06 08:56:33,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11464f6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:56:33, skipping insertion in model container [2025-02-06 08:56:33,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:56:33" (3/3) ... [2025-02-06 08:56:33,716 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_5.i [2025-02-06 08:56:33,745 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:56:33,748 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_5.i that has 3 procedures, 224 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-02-06 08:56:33,748 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 08:56:33,828 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 08:56:33,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 242 transitions, 504 flow [2025-02-06 08:56:34,012 INFO L124 PetriNetUnfolderBase]: 37/514 cut-off events. [2025-02-06 08:56:34,014 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 08:56:34,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 514 events. 37/514 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2049 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 278. Up to 8 conditions per place. [2025-02-06 08:56:34,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 242 transitions, 504 flow [2025-02-06 08:56:34,034 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 242 transitions, 504 flow [2025-02-06 08:56:34,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:56:34,059 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, 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;@45353e8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:56:34,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-02-06 08:56:34,068 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:56:34,068 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-06 08:56:34,068 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:56:34,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:34,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:34,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-06 08:56:34,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash 151091395, now seen corresponding path program 1 times [2025-02-06 08:56:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142887272] [2025-02-06 08:56:34,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:34,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:34,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 08:56:34,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 08:56:34,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:34,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:34,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142887272] [2025-02-06 08:56:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142887272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:34,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:34,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:34,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918834415] [2025-02-06 08:56:34,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:34,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:34,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:34,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:34,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:34,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 242 [2025-02-06 08:56:34,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 242 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:34,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:34,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 242 [2025-02-06 08:56:34,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:34,533 INFO L124 PetriNetUnfolderBase]: 63/784 cut-off events. [2025-02-06 08:56:34,533 INFO L125 PetriNetUnfolderBase]: For 90/142 co-relation queries the response was YES. [2025-02-06 08:56:34,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 784 events. 63/784 cut-off events. For 90/142 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3959 event pairs, 50 based on Foata normal form. 53/708 useless extension candidates. Maximal degree in co-relation 557. Up to 128 conditions per place. [2025-02-06 08:56:34,539 INFO L140 encePairwiseOnDemand]: 222/242 looper letters, 18 selfloop transitions, 1 changer transitions 6/222 dead transitions. [2025-02-06 08:56:34,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 222 transitions, 502 flow [2025-02-06 08:56:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2025-02-06 08:56:34,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8911845730027548 [2025-02-06 08:56:34,565 INFO L175 Difference]: Start difference. First operand has 230 places, 242 transitions, 504 flow. Second operand 3 states and 647 transitions. [2025-02-06 08:56:34,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 222 transitions, 502 flow [2025-02-06 08:56:34,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 222 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:56:34,577 INFO L231 Difference]: Finished difference. Result has 223 places, 216 transitions, 454 flow [2025-02-06 08:56:34,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=223, PETRI_TRANSITIONS=216} [2025-02-06 08:56:34,583 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -7 predicate places. [2025-02-06 08:56:34,584 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 216 transitions, 454 flow [2025-02-06 08:56:34,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:34,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:34,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:34,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:56:34,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-06 08:56:34,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:34,587 INFO L85 PathProgramCache]: Analyzing trace with hash 388693694, now seen corresponding path program 1 times [2025-02-06 08:56:34,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:34,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337368847] [2025-02-06 08:56:34,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:34,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:34,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 08:56:34,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 08:56:34,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:34,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:34,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:34,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337368847] [2025-02-06 08:56:34,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337368847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:34,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:34,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825233328] [2025-02-06 08:56:34,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:34,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:34,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:34,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:34,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:34,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 242 [2025-02-06 08:56:34,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 216 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:34,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:34,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 242 [2025-02-06 08:56:34,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:35,008 INFO L124 PetriNetUnfolderBase]: 60/1377 cut-off events. [2025-02-06 08:56:35,009 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-02-06 08:56:35,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 1377 events. 60/1377 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8656 event pairs, 28 based on Foata normal form. 0/1162 useless extension candidates. Maximal degree in co-relation 742. Up to 51 conditions per place. [2025-02-06 08:56:35,019 INFO L140 encePairwiseOnDemand]: 240/242 looper letters, 21 selfloop transitions, 1 changer transitions 0/225 dead transitions. [2025-02-06 08:56:35,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 225 transitions, 534 flow [2025-02-06 08:56:35,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2025-02-06 08:56:35,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118457300275482 [2025-02-06 08:56:35,025 INFO L175 Difference]: Start difference. First operand has 223 places, 216 transitions, 454 flow. Second operand 3 states and 662 transitions. [2025-02-06 08:56:35,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 225 transitions, 534 flow [2025-02-06 08:56:35,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 225 transitions, 533 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:56:35,033 INFO L231 Difference]: Finished difference. Result has 217 places, 215 transitions, 453 flow [2025-02-06 08:56:35,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=217, PETRI_TRANSITIONS=215} [2025-02-06 08:56:35,036 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -13 predicate places. [2025-02-06 08:56:35,036 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 215 transitions, 453 flow [2025-02-06 08:56:35,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:35,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:35,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:35,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:56:35,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-06 08:56:35,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash -835262861, now seen corresponding path program 1 times [2025-02-06 08:56:35,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:35,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923366117] [2025-02-06 08:56:35,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:35,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:35,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 08:56:35,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 08:56:35,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:35,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:35,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923366117] [2025-02-06 08:56:35,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923366117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:35,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:35,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:35,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064718703] [2025-02-06 08:56:35,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:35,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:35,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:35,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:35,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:35,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 242 [2025-02-06 08:56:35,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 215 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:35,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:35,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 242 [2025-02-06 08:56:35,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:35,392 INFO L124 PetriNetUnfolderBase]: 232/1654 cut-off events. [2025-02-06 08:56:35,392 INFO L125 PetriNetUnfolderBase]: For 154/458 co-relation queries the response was YES. [2025-02-06 08:56:35,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 1654 events. 232/1654 cut-off events. For 154/458 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10737 event pairs, 52 based on Foata normal form. 19/1466 useless extension candidates. Maximal degree in co-relation 1088. Up to 355 conditions per place. [2025-02-06 08:56:35,401 INFO L140 encePairwiseOnDemand]: 230/242 looper letters, 15 selfloop transitions, 1 changer transitions 24/219 dead transitions. [2025-02-06 08:56:35,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 219 transitions, 527 flow [2025-02-06 08:56:35,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2025-02-06 08:56:35,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8677685950413223 [2025-02-06 08:56:35,404 INFO L175 Difference]: Start difference. First operand has 217 places, 215 transitions, 453 flow. Second operand 3 states and 630 transitions. [2025-02-06 08:56:35,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 219 transitions, 527 flow [2025-02-06 08:56:35,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 219 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:56:35,409 INFO L231 Difference]: Finished difference. Result has 212 places, 191 transitions, 406 flow [2025-02-06 08:56:35,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=212, PETRI_TRANSITIONS=191} [2025-02-06 08:56:35,411 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -18 predicate places. [2025-02-06 08:56:35,411 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 191 transitions, 406 flow [2025-02-06 08:56:35,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:35,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:35,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:35,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:56:35,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-06 08:56:35,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1188476823, now seen corresponding path program 1 times [2025-02-06 08:56:35,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:35,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240111995] [2025-02-06 08:56:35,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:35,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:35,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 08:56:35,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 08:56:35,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:35,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:35,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:35,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240111995] [2025-02-06 08:56:35,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240111995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:35,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:35,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:35,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541181836] [2025-02-06 08:56:35,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:35,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:35,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:35,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:35,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:35,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 242 [2025-02-06 08:56:35,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 191 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:35,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:35,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 242 [2025-02-06 08:56:35,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:35,698 INFO L124 PetriNetUnfolderBase]: 184/1551 cut-off events. [2025-02-06 08:56:35,698 INFO L125 PetriNetUnfolderBase]: For 112/216 co-relation queries the response was YES. [2025-02-06 08:56:35,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 1551 events. 184/1551 cut-off events. For 112/216 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10288 event pairs, 156 based on Foata normal form. 0/1351 useless extension candidates. Maximal degree in co-relation 1839. Up to 362 conditions per place. [2025-02-06 08:56:35,709 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 18 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-02-06 08:56:35,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 188 transitions, 440 flow [2025-02-06 08:56:35,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2025-02-06 08:56:35,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.871900826446281 [2025-02-06 08:56:35,715 INFO L175 Difference]: Start difference. First operand has 212 places, 191 transitions, 406 flow. Second operand 3 states and 633 transitions. [2025-02-06 08:56:35,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 188 transitions, 440 flow [2025-02-06 08:56:35,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 188 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:56:35,723 INFO L231 Difference]: Finished difference. Result has 192 places, 188 transitions, 407 flow [2025-02-06 08:56:35,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=192, PETRI_TRANSITIONS=188} [2025-02-06 08:56:35,725 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -38 predicate places. [2025-02-06 08:56:35,726 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 188 transitions, 407 flow [2025-02-06 08:56:35,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:35,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:35,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:35,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:56:35,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-06 08:56:35,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:35,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1647394963, now seen corresponding path program 1 times [2025-02-06 08:56:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:35,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65381807] [2025-02-06 08:56:35,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:35,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:35,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 08:56:35,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 08:56:35,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:35,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:35,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:35,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65381807] [2025-02-06 08:56:35,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65381807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:35,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:35,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:35,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349920157] [2025-02-06 08:56:35,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:35,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:35,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:35,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:35,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:35,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 242 [2025-02-06 08:56:35,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 188 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:35,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:35,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 242 [2025-02-06 08:56:35,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:36,019 INFO L124 PetriNetUnfolderBase]: 124/1330 cut-off events. [2025-02-06 08:56:36,019 INFO L125 PetriNetUnfolderBase]: For 112/216 co-relation queries the response was YES. [2025-02-06 08:56:36,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 1330 events. 124/1330 cut-off events. For 112/216 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8412 event pairs, 96 based on Foata normal form. 0/1141 useless extension candidates. Maximal degree in co-relation 840. Up to 250 conditions per place. [2025-02-06 08:56:36,028 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 17 selfloop transitions, 2 changer transitions 3/187 dead transitions. [2025-02-06 08:56:36,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 187 transitions, 445 flow [2025-02-06 08:56:36,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-02-06 08:56:36,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8760330578512396 [2025-02-06 08:56:36,031 INFO L175 Difference]: Start difference. First operand has 192 places, 188 transitions, 407 flow. Second operand 3 states and 636 transitions. [2025-02-06 08:56:36,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 187 transitions, 445 flow [2025-02-06 08:56:36,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 187 transitions, 445 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:56:36,040 INFO L231 Difference]: Finished difference. Result has 193 places, 184 transitions, 403 flow [2025-02-06 08:56:36,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=193, PETRI_TRANSITIONS=184} [2025-02-06 08:56:36,041 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -37 predicate places. [2025-02-06 08:56:36,041 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 184 transitions, 403 flow [2025-02-06 08:56:36,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:36,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:36,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:36,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:56:36,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-06 08:56:36,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash -136577490, now seen corresponding path program 1 times [2025-02-06 08:56:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:36,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872686558] [2025-02-06 08:56:36,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:36,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 08:56:36,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 08:56:36,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:36,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:36,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872686558] [2025-02-06 08:56:36,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872686558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:36,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:36,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:36,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561150483] [2025-02-06 08:56:36,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:36,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:36,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:36,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:36,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:36,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 242 [2025-02-06 08:56:36,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 184 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:36,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:36,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 242 [2025-02-06 08:56:36,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:36,307 INFO L124 PetriNetUnfolderBase]: 60/1177 cut-off events. [2025-02-06 08:56:36,308 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-02-06 08:56:36,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 1177 events. 60/1177 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6872 event pairs, 28 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 684. Up to 51 conditions per place. [2025-02-06 08:56:36,315 INFO L140 encePairwiseOnDemand]: 240/242 looper letters, 21 selfloop transitions, 1 changer transitions 0/193 dead transitions. [2025-02-06 08:56:36,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 193 transitions, 483 flow [2025-02-06 08:56:36,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2025-02-06 08:56:36,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118457300275482 [2025-02-06 08:56:36,318 INFO L175 Difference]: Start difference. First operand has 193 places, 184 transitions, 403 flow. Second operand 3 states and 662 transitions. [2025-02-06 08:56:36,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 193 transitions, 483 flow [2025-02-06 08:56:36,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 193 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:56:36,322 INFO L231 Difference]: Finished difference. Result has 189 places, 183 transitions, 399 flow [2025-02-06 08:56:36,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=189, PETRI_TRANSITIONS=183} [2025-02-06 08:56:36,323 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -41 predicate places. [2025-02-06 08:56:36,323 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 183 transitions, 399 flow [2025-02-06 08:56:36,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:36,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:36,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:36,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:56:36,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-06 08:56:36,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:36,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1945234686, now seen corresponding path program 1 times [2025-02-06 08:56:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:36,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77621228] [2025-02-06 08:56:36,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:36,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 08:56:36,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 08:56:36,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:36,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:36,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77621228] [2025-02-06 08:56:36,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77621228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:36,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:36,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:36,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358334384] [2025-02-06 08:56:36,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:36,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:36,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:36,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:36,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:36,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 242 [2025-02-06 08:56:36,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 183 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:36,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:36,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 242 [2025-02-06 08:56:36,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:36,576 INFO L124 PetriNetUnfolderBase]: 120/1268 cut-off events. [2025-02-06 08:56:36,576 INFO L125 PetriNetUnfolderBase]: For 118/222 co-relation queries the response was YES. [2025-02-06 08:56:36,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1268 events. 120/1268 cut-off events. For 118/222 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7929 event pairs, 92 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 808. Up to 234 conditions per place. [2025-02-06 08:56:36,582 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 18 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-02-06 08:56:36,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 182 transitions, 437 flow [2025-02-06 08:56:36,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-02-06 08:56:36,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746556473829201 [2025-02-06 08:56:36,585 INFO L175 Difference]: Start difference. First operand has 189 places, 183 transitions, 399 flow. Second operand 3 states and 635 transitions. [2025-02-06 08:56:36,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 182 transitions, 437 flow [2025-02-06 08:56:36,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 182 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:56:36,588 INFO L231 Difference]: Finished difference. Result has 189 places, 182 transitions, 400 flow [2025-02-06 08:56:36,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=189, PETRI_TRANSITIONS=182} [2025-02-06 08:56:36,589 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -41 predicate places. [2025-02-06 08:56:36,589 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 182 transitions, 400 flow [2025-02-06 08:56:36,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:36,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:36,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:36,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:56:36,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-06 08:56:36,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash -404549309, now seen corresponding path program 1 times [2025-02-06 08:56:36,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:36,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489413342] [2025-02-06 08:56:36,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:36,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 08:56:36,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 08:56:36,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:36,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:36,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:36,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489413342] [2025-02-06 08:56:36,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489413342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:36,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:36,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:56:36,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900032029] [2025-02-06 08:56:36,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:36,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:36,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:36,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:36,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:36,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 242 [2025-02-06 08:56:36,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 182 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:36,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:36,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 242 [2025-02-06 08:56:36,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:36,787 INFO L124 PetriNetUnfolderBase]: 58/1164 cut-off events. [2025-02-06 08:56:36,787 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-02-06 08:56:36,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 1164 events. 58/1164 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6768 event pairs, 28 based on Foata normal form. 2/1023 useless extension candidates. Maximal degree in co-relation 695. Up to 110 conditions per place. [2025-02-06 08:56:36,793 INFO L140 encePairwiseOnDemand]: 240/242 looper letters, 16 selfloop transitions, 0 changer transitions 1/181 dead transitions. [2025-02-06 08:56:36,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 181 transitions, 429 flow [2025-02-06 08:56:36,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-02-06 08:56:36,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8760330578512396 [2025-02-06 08:56:36,796 INFO L175 Difference]: Start difference. First operand has 189 places, 182 transitions, 400 flow. Second operand 3 states and 636 transitions. [2025-02-06 08:56:36,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 181 transitions, 429 flow [2025-02-06 08:56:36,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 181 transitions, 421 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-06 08:56:36,802 INFO L231 Difference]: Finished difference. Result has 188 places, 180 transitions, 387 flow [2025-02-06 08:56:36,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=188, PETRI_TRANSITIONS=180} [2025-02-06 08:56:36,804 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -42 predicate places. [2025-02-06 08:56:36,804 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 180 transitions, 387 flow [2025-02-06 08:56:36,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:36,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:36,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:36,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:56:36,805 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-06 08:56:36,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash -609674538, now seen corresponding path program 1 times [2025-02-06 08:56:36,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:36,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637303344] [2025-02-06 08:56:36,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:36,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:36,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 08:56:36,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 08:56:36,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:36,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:37,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:37,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637303344] [2025-02-06 08:56:37,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637303344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:37,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:37,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:37,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191892884] [2025-02-06 08:56:37,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:37,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:37,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:37,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:37,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:37,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 242 [2025-02-06 08:56:37,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 180 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 182.66666666666666) internal successors, (1096), 6 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:37,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:37,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 242 [2025-02-06 08:56:37,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:37,918 INFO L124 PetriNetUnfolderBase]: 652/3388 cut-off events. [2025-02-06 08:56:37,918 INFO L125 PetriNetUnfolderBase]: For 106/116 co-relation queries the response was YES. [2025-02-06 08:56:37,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4910 conditions, 3388 events. 652/3388 cut-off events. For 106/116 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 28270 event pairs, 296 based on Foata normal form. 0/3003 useless extension candidates. Maximal degree in co-relation 4904. Up to 1255 conditions per place. [2025-02-06 08:56:37,943 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 44 selfloop transitions, 5 changer transitions 4/187 dead transitions. [2025-02-06 08:56:37,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 187 transitions, 501 flow [2025-02-06 08:56:37,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:56:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:56:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1137 transitions. [2025-02-06 08:56:37,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7830578512396694 [2025-02-06 08:56:37,948 INFO L175 Difference]: Start difference. First operand has 188 places, 180 transitions, 387 flow. Second operand 6 states and 1137 transitions. [2025-02-06 08:56:37,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 187 transitions, 501 flow [2025-02-06 08:56:37,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 187 transitions, 499 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 08:56:37,952 INFO L231 Difference]: Finished difference. Result has 190 places, 175 transitions, 385 flow [2025-02-06 08:56:37,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=190, PETRI_TRANSITIONS=175} [2025-02-06 08:56:37,954 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -40 predicate places. [2025-02-06 08:56:37,954 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 175 transitions, 385 flow [2025-02-06 08:56:37,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.66666666666666) internal successors, (1096), 6 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:37,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:37,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:37,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:56:37,955 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-06 08:56:37,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:37,956 INFO L85 PathProgramCache]: Analyzing trace with hash 119432711, now seen corresponding path program 1 times [2025-02-06 08:56:37,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:37,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572236134] [2025-02-06 08:56:37,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:37,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:37,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 08:56:37,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 08:56:37,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:37,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:38,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:38,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572236134] [2025-02-06 08:56:38,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572236134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:38,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:38,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:56:38,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716958431] [2025-02-06 08:56:38,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:38,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:56:38,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:38,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:56:38,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:56:38,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 242 [2025-02-06 08:56:38,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 175 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:38,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:38,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 242 [2025-02-06 08:56:38,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:38,411 INFO L124 PetriNetUnfolderBase]: 159/1449 cut-off events. [2025-02-06 08:56:38,411 INFO L125 PetriNetUnfolderBase]: For 90/192 co-relation queries the response was YES. [2025-02-06 08:56:38,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1906 conditions, 1449 events. 159/1449 cut-off events. For 90/192 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9783 event pairs, 120 based on Foata normal form. 11/1288 useless extension candidates. Maximal degree in co-relation 1900. Up to 209 conditions per place. [2025-02-06 08:56:38,422 INFO L140 encePairwiseOnDemand]: 230/242 looper letters, 42 selfloop transitions, 10 changer transitions 0/203 dead transitions. [2025-02-06 08:56:38,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 203 transitions, 569 flow [2025-02-06 08:56:38,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:56:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 08:56:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 858 transitions. [2025-02-06 08:56:38,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2025-02-06 08:56:38,426 INFO L175 Difference]: Start difference. First operand has 190 places, 175 transitions, 385 flow. Second operand 4 states and 858 transitions. [2025-02-06 08:56:38,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 203 transitions, 569 flow [2025-02-06 08:56:38,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 203 transitions, 559 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:56:38,432 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 449 flow [2025-02-06 08:56:38,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2025-02-06 08:56:38,433 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -44 predicate places. [2025-02-06 08:56:38,434 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 449 flow [2025-02-06 08:56:38,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:38,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:38,435 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:38,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:56:38,435 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-06 08:56:38,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1041197632, now seen corresponding path program 1 times [2025-02-06 08:56:38,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:38,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632492496] [2025-02-06 08:56:38,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:38,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:38,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:56:38,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:56:38,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:38,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:56:38,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:56:38,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:56:38,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:56:38,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:38,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:56:38,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:56:38,529 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:56:38,530 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-02-06 08:56:38,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2025-02-06 08:56:38,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2025-02-06 08:56:38,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2025-02-06 08:56:38,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2025-02-06 08:56:38,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2025-02-06 08:56:38,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2025-02-06 08:56:38,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2025-02-06 08:56:38,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2025-02-06 08:56:38,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2025-02-06 08:56:38,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2025-02-06 08:56:38,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2025-02-06 08:56:38,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2025-02-06 08:56:38,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2025-02-06 08:56:38,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2025-02-06 08:56:38,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2025-02-06 08:56:38,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2025-02-06 08:56:38,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2025-02-06 08:56:38,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2025-02-06 08:56:38,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2025-02-06 08:56:38,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2025-02-06 08:56:38,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2025-02-06 08:56:38,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2025-02-06 08:56:38,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2025-02-06 08:56:38,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2025-02-06 08:56:38,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2025-02-06 08:56:38,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2025-02-06 08:56:38,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 33 remaining) [2025-02-06 08:56:38,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2025-02-06 08:56:38,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2025-02-06 08:56:38,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2025-02-06 08:56:38,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2025-02-06 08:56:38,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2025-02-06 08:56:38,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:56:38,536 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:38,538 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:56:38,538 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 08:56:38,577 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-02-06 08:56:38,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 271 transitions, 586 flow [2025-02-06 08:56:38,720 INFO L124 PetriNetUnfolderBase]: 149/1607 cut-off events. [2025-02-06 08:56:38,720 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-02-06 08:56:38,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1696 conditions, 1607 events. 149/1607 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 9254 event pairs, 2 based on Foata normal form. 0/1314 useless extension candidates. Maximal degree in co-relation 931. Up to 32 conditions per place. [2025-02-06 08:56:38,731 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 271 transitions, 586 flow [2025-02-06 08:56:38,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 271 transitions, 586 flow [2025-02-06 08:56:38,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:56:38,743 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, 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;@45353e8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:56:38,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-02-06 08:56:38,747 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:56:38,747 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-06 08:56:38,747 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:56:38,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:38,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:38,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:56:38,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:38,748 INFO L85 PathProgramCache]: Analyzing trace with hash -530775805, now seen corresponding path program 1 times [2025-02-06 08:56:38,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:38,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306561792] [2025-02-06 08:56:38,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:38,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:38,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 08:56:38,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 08:56:38,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:38,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:38,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:38,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306561792] [2025-02-06 08:56:38,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306561792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:38,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:38,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113057050] [2025-02-06 08:56:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:38,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:38,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:38,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:38,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:38,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 271 [2025-02-06 08:56:38,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 271 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:38,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:38,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 271 [2025-02-06 08:56:38,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:40,072 INFO L124 PetriNetUnfolderBase]: 2218/9953 cut-off events. [2025-02-06 08:56:40,073 INFO L125 PetriNetUnfolderBase]: For 2737/5806 co-relation queries the response was YES. [2025-02-06 08:56:40,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13940 conditions, 9953 events. 2218/9953 cut-off events. For 2737/5806 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 103638 event pairs, 1905 based on Foata normal form. 879/9106 useless extension candidates. Maximal degree in co-relation 9049. Up to 3249 conditions per place. [2025-02-06 08:56:40,173 INFO L140 encePairwiseOnDemand]: 246/271 looper letters, 28 selfloop transitions, 1 changer transitions 4/245 dead transitions. [2025-02-06 08:56:40,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 245 transitions, 592 flow [2025-02-06 08:56:40,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-02-06 08:56:40,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8622386223862238 [2025-02-06 08:56:40,176 INFO L175 Difference]: Start difference. First operand has 258 places, 271 transitions, 586 flow. Second operand 3 states and 701 transitions. [2025-02-06 08:56:40,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 245 transitions, 592 flow [2025-02-06 08:56:40,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 245 transitions, 592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:56:40,185 INFO L231 Difference]: Finished difference. Result has 246 places, 241 transitions, 528 flow [2025-02-06 08:56:40,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=246, PETRI_TRANSITIONS=241} [2025-02-06 08:56:40,186 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -12 predicate places. [2025-02-06 08:56:40,186 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 241 transitions, 528 flow [2025-02-06 08:56:40,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:40,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:40,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:40,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:56:40,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:56:40,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash 725647243, now seen corresponding path program 1 times [2025-02-06 08:56:40,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:40,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443399480] [2025-02-06 08:56:40,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:40,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 08:56:40,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 08:56:40,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:40,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:40,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:40,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443399480] [2025-02-06 08:56:40,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443399480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:40,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:40,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:40,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230676380] [2025-02-06 08:56:40,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:40,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:40,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:40,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:40,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:40,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 271 [2025-02-06 08:56:40,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 241 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:40,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:40,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 271 [2025-02-06 08:56:40,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:42,381 INFO L124 PetriNetUnfolderBase]: 2492/17389 cut-off events. [2025-02-06 08:56:42,382 INFO L125 PetriNetUnfolderBase]: For 4748/26624 co-relation queries the response was YES. [2025-02-06 08:56:42,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22356 conditions, 17389 events. 2492/17389 cut-off events. For 4748/26624 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 215713 event pairs, 1706 based on Foata normal form. 0/14144 useless extension candidates. Maximal degree in co-relation 11147. Up to 1670 conditions per place. [2025-02-06 08:56:42,517 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 41 selfloop transitions, 1 changer transitions 0/260 dead transitions. [2025-02-06 08:56:42,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 260 transitions, 690 flow [2025-02-06 08:56:42,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2025-02-06 08:56:42,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8868388683886839 [2025-02-06 08:56:42,520 INFO L175 Difference]: Start difference. First operand has 246 places, 241 transitions, 528 flow. Second operand 3 states and 721 transitions. [2025-02-06 08:56:42,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 260 transitions, 690 flow [2025-02-06 08:56:42,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 260 transitions, 689 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:56:42,528 INFO L231 Difference]: Finished difference. Result has 242 places, 240 transitions, 527 flow [2025-02-06 08:56:42,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=242, PETRI_TRANSITIONS=240} [2025-02-06 08:56:42,529 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -16 predicate places. [2025-02-06 08:56:42,529 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 527 flow [2025-02-06 08:56:42,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:42,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:42,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:42,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:56:42,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:56:42,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1020362835, now seen corresponding path program 1 times [2025-02-06 08:56:42,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:42,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336315932] [2025-02-06 08:56:42,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:42,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:42,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 08:56:42,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 08:56:42,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:42,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:42,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:42,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336315932] [2025-02-06 08:56:42,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336315932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:42,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:42,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896495060] [2025-02-06 08:56:42,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:42,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:42,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:42,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:42,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:42,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 271 [2025-02-06 08:56:42,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:42,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:42,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 271 [2025-02-06 08:56:42,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:46,267 INFO L124 PetriNetUnfolderBase]: 14770/40622 cut-off events. [2025-02-06 08:56:46,268 INFO L125 PetriNetUnfolderBase]: For 8274/46430 co-relation queries the response was YES. [2025-02-06 08:56:46,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64561 conditions, 40622 events. 14770/40622 cut-off events. For 8274/46430 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 463520 event pairs, 4272 based on Foata normal form. 121/35650 useless extension candidates. Maximal degree in co-relation 32276. Up to 17809 conditions per place. [2025-02-06 08:56:46,506 INFO L140 encePairwiseOnDemand]: 257/271 looper letters, 41 selfloop transitions, 2 changer transitions 18/255 dead transitions. [2025-02-06 08:56:46,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 255 transitions, 696 flow [2025-02-06 08:56:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-02-06 08:56:46,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437884378843789 [2025-02-06 08:56:46,509 INFO L175 Difference]: Start difference. First operand has 242 places, 240 transitions, 527 flow. Second operand 3 states and 686 transitions. [2025-02-06 08:56:46,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 255 transitions, 696 flow [2025-02-06 08:56:46,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 255 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:56:46,517 INFO L231 Difference]: Finished difference. Result has 237 places, 220 transitions, 496 flow [2025-02-06 08:56:46,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=237, PETRI_TRANSITIONS=220} [2025-02-06 08:56:46,518 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -21 predicate places. [2025-02-06 08:56:46,518 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 220 transitions, 496 flow [2025-02-06 08:56:46,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:46,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:46,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:46,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:56:46,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:56:46,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:46,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2033351447, now seen corresponding path program 1 times [2025-02-06 08:56:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:46,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203544522] [2025-02-06 08:56:46,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:46,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:46,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 08:56:46,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 08:56:46,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:46,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:46,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:46,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203544522] [2025-02-06 08:56:46,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203544522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:46,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:46,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:46,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520768993] [2025-02-06 08:56:46,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:46,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:46,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:46,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:46,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 271 [2025-02-06 08:56:46,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 220 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:46,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:46,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 271 [2025-02-06 08:56:46,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:48,560 INFO L124 PetriNetUnfolderBase]: 6096/21809 cut-off events. [2025-02-06 08:56:48,560 INFO L125 PetriNetUnfolderBase]: For 4256/10796 co-relation queries the response was YES. [2025-02-06 08:56:48,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33778 conditions, 21809 events. 6096/21809 cut-off events. For 4256/10796 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 243916 event pairs, 5210 based on Foata normal form. 0/19055 useless extension candidates. Maximal degree in co-relation 28671. Up to 8524 conditions per place. [2025-02-06 08:56:48,648 INFO L140 encePairwiseOnDemand]: 265/271 looper letters, 28 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2025-02-06 08:56:48,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 217 transitions, 550 flow [2025-02-06 08:56:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-02-06 08:56:48,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8388683886838868 [2025-02-06 08:56:48,650 INFO L175 Difference]: Start difference. First operand has 237 places, 220 transitions, 496 flow. Second operand 3 states and 682 transitions. [2025-02-06 08:56:48,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 217 transitions, 550 flow [2025-02-06 08:56:48,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 217 transitions, 550 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:56:48,657 INFO L231 Difference]: Finished difference. Result has 221 places, 217 transitions, 498 flow [2025-02-06 08:56:48,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=221, PETRI_TRANSITIONS=217} [2025-02-06 08:56:48,658 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -37 predicate places. [2025-02-06 08:56:48,658 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 217 transitions, 498 flow [2025-02-06 08:56:48,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:48,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:48,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:48,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:56:48,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:56:48,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1471691635, now seen corresponding path program 1 times [2025-02-06 08:56:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:48,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471615877] [2025-02-06 08:56:48,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:48,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 08:56:48,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 08:56:48,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:48,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:48,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:48,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471615877] [2025-02-06 08:56:48,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471615877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:48,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:48,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:48,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493093892] [2025-02-06 08:56:48,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:48,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:48,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:48,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:48,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:48,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 271 [2025-02-06 08:56:48,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 217 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:48,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:48,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 271 [2025-02-06 08:56:48,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:50,610 INFO L124 PetriNetUnfolderBase]: 4656/18252 cut-off events. [2025-02-06 08:56:50,611 INFO L125 PetriNetUnfolderBase]: For 4254/12402 co-relation queries the response was YES. [2025-02-06 08:56:50,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27758 conditions, 18252 events. 4656/18252 cut-off events. For 4254/12402 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 205777 event pairs, 3782 based on Foata normal form. 0/15259 useless extension candidates. Maximal degree in co-relation 24022. Up to 6578 conditions per place. [2025-02-06 08:56:50,684 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 28 selfloop transitions, 2 changer transitions 2/216 dead transitions. [2025-02-06 08:56:50,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 216 transitions, 556 flow [2025-02-06 08:56:50,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:50,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 685 transitions. [2025-02-06 08:56:50,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425584255842559 [2025-02-06 08:56:50,686 INFO L175 Difference]: Start difference. First operand has 221 places, 217 transitions, 498 flow. Second operand 3 states and 685 transitions. [2025-02-06 08:56:50,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 216 transitions, 556 flow [2025-02-06 08:56:50,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 216 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:56:50,691 INFO L231 Difference]: Finished difference. Result has 222 places, 214 transitions, 496 flow [2025-02-06 08:56:50,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=222, PETRI_TRANSITIONS=214} [2025-02-06 08:56:50,693 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -36 predicate places. [2025-02-06 08:56:50,693 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 214 transitions, 496 flow [2025-02-06 08:56:50,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:50,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:50,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:50,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:56:50,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:56:50,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2044287022, now seen corresponding path program 1 times [2025-02-06 08:56:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:50,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279501625] [2025-02-06 08:56:50,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:50,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 08:56:50,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 08:56:50,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:50,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:50,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279501625] [2025-02-06 08:56:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279501625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:50,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:50,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:50,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958083443] [2025-02-06 08:56:50,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:50,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:50,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:50,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:50,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 271 [2025-02-06 08:56:50,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 214 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:50,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:50,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 271 [2025-02-06 08:56:50,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:52,073 INFO L124 PetriNetUnfolderBase]: 2546/15313 cut-off events. [2025-02-06 08:56:52,073 INFO L125 PetriNetUnfolderBase]: For 4748/26624 co-relation queries the response was YES. [2025-02-06 08:56:52,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20987 conditions, 15313 events. 2546/15313 cut-off events. For 4748/26624 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 181411 event pairs, 1706 based on Foata normal form. 0/12925 useless extension candidates. Maximal degree in co-relation 19194. Up to 1670 conditions per place. [2025-02-06 08:56:52,167 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 41 selfloop transitions, 1 changer transitions 0/233 dead transitions. [2025-02-06 08:56:52,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 233 transitions, 658 flow [2025-02-06 08:56:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2025-02-06 08:56:52,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8868388683886839 [2025-02-06 08:56:52,169 INFO L175 Difference]: Start difference. First operand has 222 places, 214 transitions, 496 flow. Second operand 3 states and 721 transitions. [2025-02-06 08:56:52,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 233 transitions, 658 flow [2025-02-06 08:56:52,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 233 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:56:52,177 INFO L231 Difference]: Finished difference. Result has 219 places, 213 transitions, 492 flow [2025-02-06 08:56:52,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=219, PETRI_TRANSITIONS=213} [2025-02-06 08:56:52,178 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -39 predicate places. [2025-02-06 08:56:52,178 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 213 transitions, 492 flow [2025-02-06 08:56:52,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:52,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:52,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:52,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:56:52,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:56:52,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:52,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1671825103, now seen corresponding path program 1 times [2025-02-06 08:56:52,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840391903] [2025-02-06 08:56:52,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:52,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 08:56:52,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 08:56:52,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:52,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:52,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:52,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840391903] [2025-02-06 08:56:52,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840391903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:52,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:52,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:56:52,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646132720] [2025-02-06 08:56:52,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:52,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:52,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:52,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:52,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:52,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 271 [2025-02-06 08:56:52,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 213 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:52,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:52,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 271 [2025-02-06 08:56:52,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:54,003 INFO L124 PetriNetUnfolderBase]: 5342/19618 cut-off events. [2025-02-06 08:56:54,004 INFO L125 PetriNetUnfolderBase]: For 4260/12460 co-relation queries the response was YES. [2025-02-06 08:56:54,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30270 conditions, 19618 events. 5342/19618 cut-off events. For 4260/12460 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 222348 event pairs, 4482 based on Foata normal form. 0/16493 useless extension candidates. Maximal degree in co-relation 25847. Up to 7458 conditions per place. [2025-02-06 08:56:54,109 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 29 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2025-02-06 08:56:54,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 212 transitions, 552 flow [2025-02-06 08:56:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 685 transitions. [2025-02-06 08:56:54,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425584255842559 [2025-02-06 08:56:54,112 INFO L175 Difference]: Start difference. First operand has 219 places, 213 transitions, 492 flow. Second operand 3 states and 685 transitions. [2025-02-06 08:56:54,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 212 transitions, 552 flow [2025-02-06 08:56:54,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 212 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:56:54,119 INFO L231 Difference]: Finished difference. Result has 219 places, 212 transitions, 493 flow [2025-02-06 08:56:54,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=219, PETRI_TRANSITIONS=212} [2025-02-06 08:56:54,120 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -39 predicate places. [2025-02-06 08:56:54,121 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 212 transitions, 493 flow [2025-02-06 08:56:54,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:54,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:54,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:54,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:56:54,122 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:56:54,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash 858448944, now seen corresponding path program 1 times [2025-02-06 08:56:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:54,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345016827] [2025-02-06 08:56:54,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:54,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:54,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 08:56:54,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 08:56:54,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:54,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:54,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:54,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345016827] [2025-02-06 08:56:54,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345016827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:54,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:54,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:56:54,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004184120] [2025-02-06 08:56:54,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:54,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:56:54,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:54,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:56:54,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:56:54,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 271 [2025-02-06 08:56:54,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 212 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:54,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:54,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 271 [2025-02-06 08:56:54,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:56:56,048 INFO L124 PetriNetUnfolderBase]: 3752/18416 cut-off events. [2025-02-06 08:56:56,048 INFO L125 PetriNetUnfolderBase]: For 4748/26624 co-relation queries the response was YES. [2025-02-06 08:56:56,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26174 conditions, 18416 events. 3752/18416 cut-off events. For 4748/26624 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 217954 event pairs, 2730 based on Foata normal form. 2/15381 useless extension candidates. Maximal degree in co-relation 23379. Up to 5036 conditions per place. [2025-02-06 08:56:56,109 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 27 selfloop transitions, 0 changer transitions 1/211 dead transitions. [2025-02-06 08:56:56,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 211 transitions, 544 flow [2025-02-06 08:56:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:56:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:56:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-02-06 08:56:56,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437884378843789 [2025-02-06 08:56:56,110 INFO L175 Difference]: Start difference. First operand has 219 places, 212 transitions, 493 flow. Second operand 3 states and 686 transitions. [2025-02-06 08:56:56,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 211 transitions, 544 flow [2025-02-06 08:56:56,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 211 transitions, 536 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-06 08:56:56,115 INFO L231 Difference]: Finished difference. Result has 218 places, 210 transitions, 480 flow [2025-02-06 08:56:56,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=218, PETRI_TRANSITIONS=210} [2025-02-06 08:56:56,115 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -40 predicate places. [2025-02-06 08:56:56,115 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 210 transitions, 480 flow [2025-02-06 08:56:56,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:56,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:56:56,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:56:56,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 08:56:56,116 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:56:56,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:56:56,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1458034742, now seen corresponding path program 1 times [2025-02-06 08:56:56,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:56:56,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971913758] [2025-02-06 08:56:56,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:56:56,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:56:56,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 08:56:56,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 08:56:56,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:56:56,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:56:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:56:56,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:56:56,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971913758] [2025-02-06 08:56:56,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971913758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:56:56,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:56:56,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:56:56,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340261152] [2025-02-06 08:56:56,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:56:56,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:56:56,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:56:56,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:56:56,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:56:56,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 271 [2025-02-06 08:56:56,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 210 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 195.66666666666666) internal successors, (1174), 6 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:56:56,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:56:56,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 271 [2025-02-06 08:56:56,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:02,241 INFO L124 PetriNetUnfolderBase]: 21016/65744 cut-off events. [2025-02-06 08:57:02,241 INFO L125 PetriNetUnfolderBase]: For 3106/3248 co-relation queries the response was YES. [2025-02-06 08:57:02,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104271 conditions, 65744 events. 21016/65744 cut-off events. For 3106/3248 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 823464 event pairs, 9754 based on Foata normal form. 0/59499 useless extension candidates. Maximal degree in co-relation 104262. Up to 29941 conditions per place. [2025-02-06 08:57:02,553 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 64 selfloop transitions, 5 changer transitions 3/225 dead transitions. [2025-02-06 08:57:02,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 225 transitions, 650 flow [2025-02-06 08:57:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:57:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:57:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1235 transitions. [2025-02-06 08:57:02,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7595325953259533 [2025-02-06 08:57:02,557 INFO L175 Difference]: Start difference. First operand has 218 places, 210 transitions, 480 flow. Second operand 6 states and 1235 transitions. [2025-02-06 08:57:02,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 225 transitions, 650 flow [2025-02-06 08:57:02,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 225 transitions, 648 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 08:57:02,565 INFO L231 Difference]: Finished difference. Result has 220 places, 206 transitions, 480 flow [2025-02-06 08:57:02,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=220, PETRI_TRANSITIONS=206} [2025-02-06 08:57:02,566 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -38 predicate places. [2025-02-06 08:57:02,567 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 206 transitions, 480 flow [2025-02-06 08:57:02,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.66666666666666) internal successors, (1174), 6 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:02,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:02,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:02,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:57:02,568 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:57:02,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash 545115815, now seen corresponding path program 1 times [2025-02-06 08:57:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:02,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966338895] [2025-02-06 08:57:02,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:02,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:02,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 08:57:02,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 08:57:02,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:02,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:57:02,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:02,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966338895] [2025-02-06 08:57:02,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966338895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:02,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:02,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:57:02,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171790885] [2025-02-06 08:57:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:02,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:57:02,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:02,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:57:02,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:57:02,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 271 [2025-02-06 08:57:02,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 206 transitions, 480 flow. Second operand has 4 states, 4 states have (on average 215.5) internal successors, (862), 4 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:02,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:02,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 271 [2025-02-06 08:57:02,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:05,321 INFO L124 PetriNetUnfolderBase]: 7222/26805 cut-off events. [2025-02-06 08:57:05,321 INFO L125 PetriNetUnfolderBase]: For 3680/8506 co-relation queries the response was YES. [2025-02-06 08:57:05,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40888 conditions, 26805 events. 7222/26805 cut-off events. For 3680/8506 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 316003 event pairs, 5043 based on Foata normal form. 137/23508 useless extension candidates. Maximal degree in co-relation 40879. Up to 5892 conditions per place. [2025-02-06 08:57:05,446 INFO L140 encePairwiseOnDemand]: 258/271 looper letters, 77 selfloop transitions, 11 changer transitions 0/259 dead transitions. [2025-02-06 08:57:05,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 259 transitions, 826 flow [2025-02-06 08:57:05,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:57:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 08:57:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 946 transitions. [2025-02-06 08:57:05,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8726937269372693 [2025-02-06 08:57:05,448 INFO L175 Difference]: Start difference. First operand has 220 places, 206 transitions, 480 flow. Second operand 4 states and 946 transitions. [2025-02-06 08:57:05,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 259 transitions, 826 flow [2025-02-06 08:57:05,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 259 transitions, 816 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 08:57:05,457 INFO L231 Difference]: Finished difference. Result has 217 places, 215 transitions, 552 flow [2025-02-06 08:57:05,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=552, PETRI_PLACES=217, PETRI_TRANSITIONS=215} [2025-02-06 08:57:05,458 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -41 predicate places. [2025-02-06 08:57:05,458 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 215 transitions, 552 flow [2025-02-06 08:57:05,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.5) internal successors, (862), 4 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:05,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:05,459 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:05,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 08:57:05,459 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:57:05,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:05,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1359471381, now seen corresponding path program 1 times [2025-02-06 08:57:05,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:05,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365758712] [2025-02-06 08:57:05,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:05,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:05,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:57:05,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:57:05,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:05,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:57:05,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:05,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365758712] [2025-02-06 08:57:05,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365758712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:05,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:05,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:57:05,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993155864] [2025-02-06 08:57:05,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:05,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:57:05,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:05,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:57:05,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:57:05,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 271 [2025-02-06 08:57:05,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 215 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:05,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:05,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 271 [2025-02-06 08:57:05,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:08,678 INFO L124 PetriNetUnfolderBase]: 7028/27245 cut-off events. [2025-02-06 08:57:08,678 INFO L125 PetriNetUnfolderBase]: For 7164/10057 co-relation queries the response was YES. [2025-02-06 08:57:08,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44175 conditions, 27245 events. 7028/27245 cut-off events. For 7164/10057 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 324382 event pairs, 4588 based on Foata normal form. 3/23823 useless extension candidates. Maximal degree in co-relation 44164. Up to 5944 conditions per place. [2025-02-06 08:57:08,816 INFO L140 encePairwiseOnDemand]: 257/271 looper letters, 88 selfloop transitions, 14 changer transitions 0/271 dead transitions. [2025-02-06 08:57:08,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 271 transitions, 948 flow [2025-02-06 08:57:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:57:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 08:57:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1587 transitions. [2025-02-06 08:57:08,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8365840801265155 [2025-02-06 08:57:08,819 INFO L175 Difference]: Start difference. First operand has 217 places, 215 transitions, 552 flow. Second operand 7 states and 1587 transitions. [2025-02-06 08:57:08,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 271 transitions, 948 flow [2025-02-06 08:57:08,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 271 transitions, 946 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 08:57:08,829 INFO L231 Difference]: Finished difference. Result has 225 places, 218 transitions, 607 flow [2025-02-06 08:57:08,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=607, PETRI_PLACES=225, PETRI_TRANSITIONS=218} [2025-02-06 08:57:08,830 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -33 predicate places. [2025-02-06 08:57:08,830 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 218 transitions, 607 flow [2025-02-06 08:57:08,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:08,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:08,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:08,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 08:57:08,831 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:57:08,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:08,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1489184810, now seen corresponding path program 1 times [2025-02-06 08:57:08,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:08,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716609298] [2025-02-06 08:57:08,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:08,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:08,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 08:57:08,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 08:57:08,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:08,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:57:09,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:09,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716609298] [2025-02-06 08:57:09,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716609298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:09,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:09,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:57:09,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612642184] [2025-02-06 08:57:09,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:09,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:57:09,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:09,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:57:09,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:57:09,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 271 [2025-02-06 08:57:09,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 218 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:09,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:09,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 271 [2025-02-06 08:57:09,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:14,176 INFO L124 PetriNetUnfolderBase]: 21085/50115 cut-off events. [2025-02-06 08:57:14,176 INFO L125 PetriNetUnfolderBase]: For 8511/8515 co-relation queries the response was YES. [2025-02-06 08:57:14,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87702 conditions, 50115 events. 21085/50115 cut-off events. For 8511/8515 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 518542 event pairs, 9342 based on Foata normal form. 0/47064 useless extension candidates. Maximal degree in co-relation 87688. Up to 25899 conditions per place. [2025-02-06 08:57:14,485 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 90 selfloop transitions, 6 changer transitions 0/249 dead transitions. [2025-02-06 08:57:14,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 249 transitions, 861 flow [2025-02-06 08:57:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:57:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 08:57:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1251 transitions. [2025-02-06 08:57:14,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7693726937269373 [2025-02-06 08:57:14,488 INFO L175 Difference]: Start difference. First operand has 225 places, 218 transitions, 607 flow. Second operand 6 states and 1251 transitions. [2025-02-06 08:57:14,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 249 transitions, 861 flow [2025-02-06 08:57:14,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 249 transitions, 837 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 08:57:14,505 INFO L231 Difference]: Finished difference. Result has 226 places, 217 transitions, 593 flow [2025-02-06 08:57:14,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=226, PETRI_TRANSITIONS=217} [2025-02-06 08:57:14,505 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -32 predicate places. [2025-02-06 08:57:14,506 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 217 transitions, 593 flow [2025-02-06 08:57:14,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:14,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:14,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:14,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 08:57:14,507 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-06 08:57:14,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:14,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1032957154, now seen corresponding path program 1 times [2025-02-06 08:57:14,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:14,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441046736] [2025-02-06 08:57:14,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:14,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 08:57:14,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 08:57:14,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:14,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:57:14,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:14,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441046736] [2025-02-06 08:57:14,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441046736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:14,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:14,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 08:57:14,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552738615] [2025-02-06 08:57:14,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:14,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 08:57:14,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:14,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 08:57:14,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:57:14,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 271 [2025-02-06 08:57:14,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 217 transitions, 593 flow. Second operand has 5 states, 5 states have (on average 213.8) internal successors, (1069), 5 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:57:14,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:14,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 271 [2025-02-06 08:57:14,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand