./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/reorder_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/reorder_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:34:59,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:34:59,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:34:59,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:34:59,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:34:59,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:34:59,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:34:59,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:34:59,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:34:59,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:34:59,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:34:59,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:34:59,992 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:34:59,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:34:59,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:34:59,992 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:34:59,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:34:59,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:34:59,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:34:59,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:34:59,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:34:59,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:34:59,993 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:34:59,993 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:34:59,993 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:34:59,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:34:59,993 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:34:59,993 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:34:59,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:34:59,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:34:59,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:34:59,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:34:59,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:34:59,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:34:59,994 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:34:59,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:34:59,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:34:59,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:34:59,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:34:59,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:34:59,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:34:59,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:34:59,994 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/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 -> eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 [2025-03-08 21:35:00,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:35:00,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:35:00,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:35:00,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:35:00,248 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:35:00,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_2.i [2025-03-08 21:35:01,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eaa059d8/b10296d49e6b4a74b09f9eee0bbc0de3/FLAGaf42c044d [2025-03-08 21:35:01,713 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:35:01,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/reorder_2.i [2025-03-08 21:35:01,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eaa059d8/b10296d49e6b4a74b09f9eee0bbc0de3/FLAGaf42c044d [2025-03-08 21:35:01,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eaa059d8/b10296d49e6b4a74b09f9eee0bbc0de3 [2025-03-08 21:35:01,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:35:01,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:35:01,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:35:01,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:35:02,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:35:02,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:35:01" (1/1) ... [2025-03-08 21:35:02,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a54b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02, skipping insertion in model container [2025-03-08 21:35:02,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:35:01" (1/1) ... [2025-03-08 21:35:02,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:35:02,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:35:02,336 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:35:02,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:35:02,442 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:35:02,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02 WrapperNode [2025-03-08 21:35:02,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:35:02,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:35:02,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:35:02,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:35:02,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02" (1/1) ... [2025-03-08 21:35:02,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02" (1/1) ... [2025-03-08 21:35:02,478 INFO L138 Inliner]: procedures = 372, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 208 [2025-03-08 21:35:02,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:35:02,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:35:02,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:35:02,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:35:02,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02" (1/1) ... [2025-03-08 21:35:02,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02" (1/1) ... [2025-03-08 21:35:02,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02" (1/1) ... [2025-03-08 21:35:02,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02" (1/1) ... [2025-03-08 21:35:02,494 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02" (1/1) ... [2025-03-08 21:35:02,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02" (1/1) ... [2025-03-08 21:35:02,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02" (1/1) ... [2025-03-08 21:35:02,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02" (1/1) ... [2025-03-08 21:35:02,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:35:02,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:35:02,504 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:35:02,504 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:35:02,505 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02" (1/1) ... [2025-03-08 21:35:02,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:35:02,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:35:02,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:35:02,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:35:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 21:35:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:35:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:35:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 21:35:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:35:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-08 21:35:02,553 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-08 21:35:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:35:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:35:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-08 21:35:02,553 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-08 21:35:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:35:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:35:02,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:35:02,554 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:35:02,648 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:35:02,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:35:02,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: havoc main_~#setPool~0#1.base, main_~#setPool~0#1.offset; [2025-03-08 21:35:02,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: SUMMARY for call ULTIMATE.dealloc(main_~#setPool~0#1.base, main_~#setPool~0#1.offset); srcloc: null [2025-03-08 21:35:02,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261: havoc main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset; [2025-03-08 21:35:02,959 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261-1: SUMMARY for call ULTIMATE.dealloc(main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset); srcloc: null [2025-03-08 21:35:02,960 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:35:02,960 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:35:02,982 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:35:02,982 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:35:02,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:35:02 BoogieIcfgContainer [2025-03-08 21:35:02,982 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:35:02,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:35:02,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:35:02,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:35:02,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:35:01" (1/3) ... [2025-03-08 21:35:02,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4733186b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:35:02, skipping insertion in model container [2025-03-08 21:35:02,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:02" (2/3) ... [2025-03-08 21:35:02,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4733186b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:35:02, skipping insertion in model container [2025-03-08 21:35:02,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:35:02" (3/3) ... [2025-03-08 21:35:02,992 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_2.i [2025-03-08 21:35:03,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:35:03,017 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_2.i that has 3 procedures, 226 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-03-08 21:35:03,017 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:35:03,073 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-08 21:35:03,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 245 transitions, 510 flow [2025-03-08 21:35:03,229 INFO L124 PetriNetUnfolderBase]: 39/521 cut-off events. [2025-03-08 21:35:03,233 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-08 21:35:03,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 521 events. 39/521 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2094 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 277. Up to 8 conditions per place. [2025-03-08 21:35:03,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 245 transitions, 510 flow [2025-03-08 21:35:03,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 245 transitions, 510 flow [2025-03-08 21:35:03,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:35:03,267 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;@139ad9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:35:03,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-08 21:35:03,272 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:35:03,272 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-08 21:35:03,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:35:03,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:03,273 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:03,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-08 21:35:03,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash 516903588, now seen corresponding path program 1 times [2025-03-08 21:35:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:03,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825095935] [2025-03-08 21:35:03,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:03,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 21:35:03,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 21:35:03,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:03,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:03,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:03,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825095935] [2025-03-08 21:35:03,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825095935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:03,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:03,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:03,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111188867] [2025-03-08 21:35:03,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:03,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:03,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:03,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:03,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:03,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 245 [2025-03-08 21:35:03,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 245 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:03,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:03,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 245 [2025-03-08 21:35:03,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:03,618 INFO L124 PetriNetUnfolderBase]: 63/811 cut-off events. [2025-03-08 21:35:03,619 INFO L125 PetriNetUnfolderBase]: For 90/142 co-relation queries the response was YES. [2025-03-08 21:35:03,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 811 events. 63/811 cut-off events. For 90/142 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4163 event pairs, 50 based on Foata normal form. 67/749 useless extension candidates. Maximal degree in co-relation 575. Up to 128 conditions per place. [2025-03-08 21:35:03,623 INFO L140 encePairwiseOnDemand]: 224/245 looper letters, 18 selfloop transitions, 1 changer transitions 6/223 dead transitions. [2025-03-08 21:35:03,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 223 transitions, 504 flow [2025-03-08 21:35:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions. [2025-03-08 21:35:03,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.889795918367347 [2025-03-08 21:35:03,639 INFO L175 Difference]: Start difference. First operand has 232 places, 245 transitions, 510 flow. Second operand 3 states and 654 transitions. [2025-03-08 21:35:03,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 223 transitions, 504 flow [2025-03-08 21:35:03,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 223 transitions, 504 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:03,649 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 456 flow [2025-03-08 21:35:03,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2025-03-08 21:35:03,655 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -8 predicate places. [2025-03-08 21:35:03,657 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 456 flow [2025-03-08 21:35:03,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:03,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:03,658 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-03-08 21:35:03,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:35:03,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-08 21:35:03,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:03,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1155864173, now seen corresponding path program 1 times [2025-03-08 21:35:03,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:03,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930016798] [2025-03-08 21:35:03,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:03,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:03,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 21:35:03,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 21:35:03,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:03,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:03,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:03,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930016798] [2025-03-08 21:35:03,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930016798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:03,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:03,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:03,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090657033] [2025-03-08 21:35:03,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:03,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:03,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:03,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:03,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:03,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 245 [2025-03-08 21:35:03,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:03,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:03,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 245 [2025-03-08 21:35:03,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:03,904 INFO L124 PetriNetUnfolderBase]: 60/1400 cut-off events. [2025-03-08 21:35:03,904 INFO L125 PetriNetUnfolderBase]: For 162/338 co-relation queries the response was YES. [2025-03-08 21:35:03,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1400 events. 60/1400 cut-off events. For 162/338 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8932 event pairs, 28 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 754. Up to 51 conditions per place. [2025-03-08 21:35:03,910 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 21 selfloop transitions, 1 changer transitions 0/226 dead transitions. [2025-03-08 21:35:03,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 226 transitions, 536 flow [2025-03-08 21:35:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2025-03-08 21:35:03,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.908843537414966 [2025-03-08 21:35:03,912 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 456 flow. Second operand 3 states and 668 transitions. [2025-03-08 21:35:03,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 226 transitions, 536 flow [2025-03-08 21:35:03,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 226 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:03,915 INFO L231 Difference]: Finished difference. Result has 218 places, 216 transitions, 455 flow [2025-03-08 21:35:03,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2025-03-08 21:35:03,916 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -14 predicate places. [2025-03-08 21:35:03,916 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 455 flow [2025-03-08 21:35:03,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:03,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:03,917 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-03-08 21:35:03,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:35:03,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-08 21:35:03,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1472187683, now seen corresponding path program 1 times [2025-03-08 21:35:03,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:03,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381629224] [2025-03-08 21:35:03,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:03,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 21:35:03,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 21:35:03,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:03,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:03,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381629224] [2025-03-08 21:35:03,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381629224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:03,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822914502] [2025-03-08 21:35:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:03,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:03,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:03,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:03,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 245 [2025-03-08 21:35:03,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:03,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:03,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 245 [2025-03-08 21:35:03,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:04,139 INFO L124 PetriNetUnfolderBase]: 232/1677 cut-off events. [2025-03-08 21:35:04,139 INFO L125 PetriNetUnfolderBase]: For 202/506 co-relation queries the response was YES. [2025-03-08 21:35:04,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 1677 events. 232/1677 cut-off events. For 202/506 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11008 event pairs, 52 based on Foata normal form. 19/1489 useless extension candidates. Maximal degree in co-relation 1100. Up to 355 conditions per place. [2025-03-08 21:35:04,144 INFO L140 encePairwiseOnDemand]: 233/245 looper letters, 15 selfloop transitions, 1 changer transitions 24/220 dead transitions. [2025-03-08 21:35:04,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 529 flow [2025-03-08 21:35:04,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-03-08 21:35:04,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8653061224489796 [2025-03-08 21:35:04,146 INFO L175 Difference]: Start difference. First operand has 218 places, 216 transitions, 455 flow. Second operand 3 states and 636 transitions. [2025-03-08 21:35:04,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 529 flow [2025-03-08 21:35:04,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:04,149 INFO L231 Difference]: Finished difference. Result has 213 places, 192 transitions, 408 flow [2025-03-08 21:35:04,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=213, PETRI_TRANSITIONS=192} [2025-03-08 21:35:04,149 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -19 predicate places. [2025-03-08 21:35:04,150 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 192 transitions, 408 flow [2025-03-08 21:35:04,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:04,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:04,150 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] [2025-03-08 21:35:04,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:35:04,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-08 21:35:04,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:04,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1398667759, now seen corresponding path program 1 times [2025-03-08 21:35:04,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:04,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904787818] [2025-03-08 21:35:04,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:04,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:04,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 21:35:04,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 21:35:04,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:04,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:04,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904787818] [2025-03-08 21:35:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904787818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:04,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:04,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174667785] [2025-03-08 21:35:04,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:04,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:04,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:04,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:04,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 245 [2025-03-08 21:35:04,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 192 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:04,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:04,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 245 [2025-03-08 21:35:04,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:04,346 INFO L124 PetriNetUnfolderBase]: 184/1638 cut-off events. [2025-03-08 21:35:04,346 INFO L125 PetriNetUnfolderBase]: For 144/248 co-relation queries the response was YES. [2025-03-08 21:35:04,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 1638 events. 184/1638 cut-off events. For 144/248 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11171 event pairs, 156 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 1838. Up to 362 conditions per place. [2025-03-08 21:35:04,351 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 18 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2025-03-08 21:35:04,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 189 transitions, 442 flow [2025-03-08 21:35:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2025-03-08 21:35:04,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8693877551020408 [2025-03-08 21:35:04,353 INFO L175 Difference]: Start difference. First operand has 213 places, 192 transitions, 408 flow. Second operand 3 states and 639 transitions. [2025-03-08 21:35:04,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 189 transitions, 442 flow [2025-03-08 21:35:04,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 189 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:04,357 INFO L231 Difference]: Finished difference. Result has 193 places, 189 transitions, 409 flow [2025-03-08 21:35:04,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=409, PETRI_PLACES=193, PETRI_TRANSITIONS=189} [2025-03-08 21:35:04,358 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -39 predicate places. [2025-03-08 21:35:04,358 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 189 transitions, 409 flow [2025-03-08 21:35:04,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:04,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:04,359 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] [2025-03-08 21:35:04,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:35:04,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-08 21:35:04,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:04,359 INFO L85 PathProgramCache]: Analyzing trace with hash -820474083, now seen corresponding path program 1 times [2025-03-08 21:35:04,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:04,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976392156] [2025-03-08 21:35:04,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:04,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:04,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 21:35:04,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 21:35:04,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:04,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:04,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976392156] [2025-03-08 21:35:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976392156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:04,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:04,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:04,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216758249] [2025-03-08 21:35:04,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:04,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:04,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:04,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:04,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:04,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2025-03-08 21:35:04,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 189 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:04,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:04,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2025-03-08 21:35:04,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:04,555 INFO L124 PetriNetUnfolderBase]: 124/1385 cut-off events. [2025-03-08 21:35:04,555 INFO L125 PetriNetUnfolderBase]: For 144/248 co-relation queries the response was YES. [2025-03-08 21:35:04,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 1385 events. 124/1385 cut-off events. For 144/248 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8850 event pairs, 96 based on Foata normal form. 0/1196 useless extension candidates. Maximal degree in co-relation 868. Up to 250 conditions per place. [2025-03-08 21:35:04,562 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 17 selfloop transitions, 2 changer transitions 3/188 dead transitions. [2025-03-08 21:35:04,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 188 transitions, 447 flow [2025-03-08 21:35:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2025-03-08 21:35:04,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2025-03-08 21:35:04,567 INFO L175 Difference]: Start difference. First operand has 193 places, 189 transitions, 409 flow. Second operand 3 states and 642 transitions. [2025-03-08 21:35:04,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 188 transitions, 447 flow [2025-03-08 21:35:04,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 188 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:04,571 INFO L231 Difference]: Finished difference. Result has 194 places, 185 transitions, 405 flow [2025-03-08 21:35:04,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=194, PETRI_TRANSITIONS=185} [2025-03-08 21:35:04,573 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -38 predicate places. [2025-03-08 21:35:04,574 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 185 transitions, 405 flow [2025-03-08 21:35:04,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:04,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:04,574 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] [2025-03-08 21:35:04,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:35:04,574 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-08 21:35:04,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:04,576 INFO L85 PathProgramCache]: Analyzing trace with hash -285181283, now seen corresponding path program 1 times [2025-03-08 21:35:04,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:04,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575937163] [2025-03-08 21:35:04,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:04,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:04,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 21:35:04,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 21:35:04,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:04,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:04,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:04,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575937163] [2025-03-08 21:35:04,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575937163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:04,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:04,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:04,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502804714] [2025-03-08 21:35:04,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:04,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:04,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:04,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:04,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:04,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 245 [2025-03-08 21:35:04,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 185 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:04,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:04,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 245 [2025-03-08 21:35:04,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:04,750 INFO L124 PetriNetUnfolderBase]: 60/1200 cut-off events. [2025-03-08 21:35:04,750 INFO L125 PetriNetUnfolderBase]: For 162/338 co-relation queries the response was YES. [2025-03-08 21:35:04,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 1200 events. 60/1200 cut-off events. For 162/338 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7076 event pairs, 28 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 696. Up to 51 conditions per place. [2025-03-08 21:35:04,755 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 21 selfloop transitions, 1 changer transitions 0/194 dead transitions. [2025-03-08 21:35:04,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 194 transitions, 485 flow [2025-03-08 21:35:04,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2025-03-08 21:35:04,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.908843537414966 [2025-03-08 21:35:04,757 INFO L175 Difference]: Start difference. First operand has 194 places, 185 transitions, 405 flow. Second operand 3 states and 668 transitions. [2025-03-08 21:35:04,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 194 transitions, 485 flow [2025-03-08 21:35:04,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 194 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:04,760 INFO L231 Difference]: Finished difference. Result has 190 places, 184 transitions, 401 flow [2025-03-08 21:35:04,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=190, PETRI_TRANSITIONS=184} [2025-03-08 21:35:04,761 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -42 predicate places. [2025-03-08 21:35:04,761 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 184 transitions, 401 flow [2025-03-08 21:35:04,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:04,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:04,762 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] [2025-03-08 21:35:04,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:35:04,762 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-08 21:35:04,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:04,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1112270852, now seen corresponding path program 1 times [2025-03-08 21:35:04,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:04,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792499633] [2025-03-08 21:35:04,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:04,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:04,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 21:35:04,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 21:35:04,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:04,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:04,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:04,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792499633] [2025-03-08 21:35:04,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792499633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:04,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:04,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:04,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641487941] [2025-03-08 21:35:04,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:04,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:04,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:04,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:04,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:04,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2025-03-08 21:35:04,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 184 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:04,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:04,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2025-03-08 21:35:04,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:04,960 INFO L124 PetriNetUnfolderBase]: 120/1323 cut-off events. [2025-03-08 21:35:04,961 INFO L125 PetriNetUnfolderBase]: For 150/270 co-relation queries the response was YES. [2025-03-08 21:35:04,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 1323 events. 120/1323 cut-off events. For 150/270 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8433 event pairs, 92 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 835. Up to 234 conditions per place. [2025-03-08 21:35:04,965 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 18 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2025-03-08 21:35:04,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 183 transitions, 439 flow [2025-03-08 21:35:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2025-03-08 21:35:04,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8721088435374149 [2025-03-08 21:35:04,966 INFO L175 Difference]: Start difference. First operand has 190 places, 184 transitions, 401 flow. Second operand 3 states and 641 transitions. [2025-03-08 21:35:04,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 183 transitions, 439 flow [2025-03-08 21:35:04,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 183 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:04,969 INFO L231 Difference]: Finished difference. Result has 190 places, 183 transitions, 402 flow [2025-03-08 21:35:04,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=190, PETRI_TRANSITIONS=183} [2025-03-08 21:35:04,970 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -42 predicate places. [2025-03-08 21:35:04,970 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 183 transitions, 402 flow [2025-03-08 21:35:04,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:04,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:04,970 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] [2025-03-08 21:35:04,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:35:04,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-08 21:35:04,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:04,971 INFO L85 PathProgramCache]: Analyzing trace with hash -276047459, now seen corresponding path program 1 times [2025-03-08 21:35:04,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:04,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93820730] [2025-03-08 21:35:04,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:04,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:04,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 21:35:04,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 21:35:04,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:04,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:05,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:05,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93820730] [2025-03-08 21:35:05,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93820730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:05,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:05,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:35:05,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196830427] [2025-03-08 21:35:05,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:05,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:05,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:05,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:05,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:05,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 245 [2025-03-08 21:35:05,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 183 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:05,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:05,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 245 [2025-03-08 21:35:05,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:05,115 INFO L124 PetriNetUnfolderBase]: 58/1187 cut-off events. [2025-03-08 21:35:05,115 INFO L125 PetriNetUnfolderBase]: For 162/338 co-relation queries the response was YES. [2025-03-08 21:35:05,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1187 events. 58/1187 cut-off events. For 162/338 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7006 event pairs, 28 based on Foata normal form. 2/1046 useless extension candidates. Maximal degree in co-relation 706. Up to 110 conditions per place. [2025-03-08 21:35:05,119 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 16 selfloop transitions, 0 changer transitions 1/182 dead transitions. [2025-03-08 21:35:05,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 182 transitions, 431 flow [2025-03-08 21:35:05,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2025-03-08 21:35:05,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2025-03-08 21:35:05,121 INFO L175 Difference]: Start difference. First operand has 190 places, 183 transitions, 402 flow. Second operand 3 states and 642 transitions. [2025-03-08 21:35:05,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 182 transitions, 431 flow [2025-03-08 21:35:05,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 182 transitions, 423 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-08 21:35:05,125 INFO L231 Difference]: Finished difference. Result has 189 places, 181 transitions, 389 flow [2025-03-08 21:35:05,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=189, PETRI_TRANSITIONS=181} [2025-03-08 21:35:05,126 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -43 predicate places. [2025-03-08 21:35:05,127 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 181 transitions, 389 flow [2025-03-08 21:35:05,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:05,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:05,128 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] [2025-03-08 21:35:05,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:35:05,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-08 21:35:05,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1665365460, now seen corresponding path program 1 times [2025-03-08 21:35:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:05,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290040514] [2025-03-08 21:35:05,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:05,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:05,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 21:35:05,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 21:35:05,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:05,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:05,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:05,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290040514] [2025-03-08 21:35:05,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290040514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:05,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:05,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:05,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236110624] [2025-03-08 21:35:05,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:05,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:05,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:05,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:05,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:05,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 245 [2025-03-08 21:35:05,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 181 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:05,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:05,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 245 [2025-03-08 21:35:05,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:05,970 INFO L124 PetriNetUnfolderBase]: 652/3659 cut-off events. [2025-03-08 21:35:05,971 INFO L125 PetriNetUnfolderBase]: For 96/106 co-relation queries the response was YES. [2025-03-08 21:35:05,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 3659 events. 652/3659 cut-off events. For 96/106 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 31708 event pairs, 296 based on Foata normal form. 0/3274 useless extension candidates. Maximal degree in co-relation 5175. Up to 1255 conditions per place. [2025-03-08 21:35:05,986 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 44 selfloop transitions, 5 changer transitions 4/188 dead transitions. [2025-03-08 21:35:05,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 188 transitions, 503 flow [2025-03-08 21:35:05,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1149 transitions. [2025-03-08 21:35:05,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7816326530612245 [2025-03-08 21:35:05,989 INFO L175 Difference]: Start difference. First operand has 189 places, 181 transitions, 389 flow. Second operand 6 states and 1149 transitions. [2025-03-08 21:35:05,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 188 transitions, 503 flow [2025-03-08 21:35:05,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 188 transitions, 501 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:05,993 INFO L231 Difference]: Finished difference. Result has 191 places, 176 transitions, 387 flow [2025-03-08 21:35:05,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=191, PETRI_TRANSITIONS=176} [2025-03-08 21:35:05,994 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -41 predicate places. [2025-03-08 21:35:05,994 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 176 transitions, 387 flow [2025-03-08 21:35:05,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.66666666666666) internal successors, (1108), 6 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:05,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:05,995 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] [2025-03-08 21:35:05,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:35:05,996 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-08 21:35:05,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:05,996 INFO L85 PathProgramCache]: Analyzing trace with hash 996998862, now seen corresponding path program 1 times [2025-03-08 21:35:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:05,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111747057] [2025-03-08 21:35:05,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:06,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 21:35:06,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 21:35:06,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:06,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:06,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:06,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111747057] [2025-03-08 21:35:06,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111747057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:06,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:06,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:35:06,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163192600] [2025-03-08 21:35:06,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:06,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:35:06,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:06,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:35:06,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:35:06,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 245 [2025-03-08 21:35:06,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 176 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 204.5) internal successors, (818), 4 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:06,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:06,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 245 [2025-03-08 21:35:06,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:06,302 INFO L124 PetriNetUnfolderBase]: 159/1512 cut-off events. [2025-03-08 21:35:06,302 INFO L125 PetriNetUnfolderBase]: For 114/216 co-relation queries the response was YES. [2025-03-08 21:35:06,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 1512 events. 159/1512 cut-off events. For 114/216 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10362 event pairs, 120 based on Foata normal form. 11/1351 useless extension candidates. Maximal degree in co-relation 1963. Up to 209 conditions per place. [2025-03-08 21:35:06,307 INFO L140 encePairwiseOnDemand]: 233/245 looper letters, 42 selfloop transitions, 10 changer transitions 0/204 dead transitions. [2025-03-08 21:35:06,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 204 transitions, 571 flow [2025-03-08 21:35:06,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:35:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 21:35:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 866 transitions. [2025-03-08 21:35:06,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8836734693877552 [2025-03-08 21:35:06,310 INFO L175 Difference]: Start difference. First operand has 191 places, 176 transitions, 387 flow. Second operand 4 states and 866 transitions. [2025-03-08 21:35:06,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 204 transitions, 571 flow [2025-03-08 21:35:06,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 204 transitions, 561 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:06,313 INFO L231 Difference]: Finished difference. Result has 187 places, 184 transitions, 451 flow [2025-03-08 21:35:06,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=451, PETRI_PLACES=187, PETRI_TRANSITIONS=184} [2025-03-08 21:35:06,313 INFO L279 CegarLoopForPetriNet]: 232 programPoint places, -45 predicate places. [2025-03-08 21:35:06,314 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 184 transitions, 451 flow [2025-03-08 21:35:06,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 204.5) internal successors, (818), 4 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:06,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:06,314 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] [2025-03-08 21:35:06,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:35:06,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-08 21:35:06,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:06,315 INFO L85 PathProgramCache]: Analyzing trace with hash -474781735, now seen corresponding path program 1 times [2025-03-08 21:35:06,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:06,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50862902] [2025-03-08 21:35:06,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:06,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:06,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 21:35:06,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 21:35:06,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:06,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:35:06,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:35:06,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 21:35:06,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 21:35:06,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:06,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:35:06,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:35:06,374 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:35:06,374 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-03-08 21:35:06,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2025-03-08 21:35:06,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2025-03-08 21:35:06,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2025-03-08 21:35:06,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2025-03-08 21:35:06,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2025-03-08 21:35:06,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2025-03-08 21:35:06,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2025-03-08 21:35:06,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2025-03-08 21:35:06,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2025-03-08 21:35:06,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2025-03-08 21:35:06,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2025-03-08 21:35:06,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2025-03-08 21:35:06,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2025-03-08 21:35:06,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2025-03-08 21:35:06,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 33 remaining) [2025-03-08 21:35:06,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2025-03-08 21:35:06,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2025-03-08 21:35:06,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2025-03-08 21:35:06,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2025-03-08 21:35:06,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2025-03-08 21:35:06,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:35:06,379 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:06,381 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:35:06,382 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 21:35:06,412 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-08 21:35:06,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 278 transitions, 600 flow [2025-03-08 21:35:06,506 INFO L124 PetriNetUnfolderBase]: 155/1630 cut-off events. [2025-03-08 21:35:06,506 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-08 21:35:06,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 1630 events. 155/1630 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9453 event pairs, 1 based on Foata normal form. 0/1331 useless extension candidates. Maximal degree in co-relation 942. Up to 32 conditions per place. [2025-03-08 21:35:06,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 278 transitions, 600 flow [2025-03-08 21:35:06,522 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 278 transitions, 600 flow [2025-03-08 21:35:06,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:35:06,526 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;@139ad9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:35:06,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-08 21:35:06,528 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:35:06,528 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-08 21:35:06,528 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:35:06,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:06,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:06,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-08 21:35:06,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1909681464, now seen corresponding path program 1 times [2025-03-08 21:35:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:06,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759997227] [2025-03-08 21:35:06,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:06,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:06,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 21:35:06,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 21:35:06,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:06,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:06,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:06,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759997227] [2025-03-08 21:35:06,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759997227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:06,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:06,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:06,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044502100] [2025-03-08 21:35:06,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:06,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:06,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:06,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:06,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:06,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 278 [2025-03-08 21:35:06,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 278 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:06,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:06,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 278 [2025-03-08 21:35:06,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:07,426 INFO L124 PetriNetUnfolderBase]: 2218/10556 cut-off events. [2025-03-08 21:35:07,427 INFO L125 PetriNetUnfolderBase]: For 2586/5655 co-relation queries the response was YES. [2025-03-08 21:35:07,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14543 conditions, 10556 events. 2218/10556 cut-off events. For 2586/5655 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 112719 event pairs, 1905 based on Foata normal form. 1203/10033 useless extension candidates. Maximal degree in co-relation 9437. Up to 3249 conditions per place. [2025-03-08 21:35:07,496 INFO L140 encePairwiseOnDemand]: 251/278 looper letters, 28 selfloop transitions, 1 changer transitions 4/248 dead transitions. [2025-03-08 21:35:07,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 248 transitions, 598 flow [2025-03-08 21:35:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-03-08 21:35:07,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8609112709832134 [2025-03-08 21:35:07,499 INFO L175 Difference]: Start difference. First operand has 263 places, 278 transitions, 600 flow. Second operand 3 states and 718 transitions. [2025-03-08 21:35:07,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 248 transitions, 598 flow [2025-03-08 21:35:07,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 248 transitions, 598 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:07,504 INFO L231 Difference]: Finished difference. Result has 249 places, 244 transitions, 534 flow [2025-03-08 21:35:07,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=249, PETRI_TRANSITIONS=244} [2025-03-08 21:35:07,505 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -14 predicate places. [2025-03-08 21:35:07,505 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 244 transitions, 534 flow [2025-03-08 21:35:07,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:07,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:07,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] [2025-03-08 21:35:07,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:35:07,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-08 21:35:07,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash -929422701, now seen corresponding path program 1 times [2025-03-08 21:35:07,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:07,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396323725] [2025-03-08 21:35:07,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:07,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 21:35:07,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 21:35:07,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:07,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:07,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:07,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396323725] [2025-03-08 21:35:07,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396323725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:07,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:07,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:07,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060410820] [2025-03-08 21:35:07,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:07,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:07,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:07,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:07,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:07,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 278 [2025-03-08 21:35:07,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 244 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:07,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:07,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 278 [2025-03-08 21:35:07,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:09,131 INFO L124 PetriNetUnfolderBase]: 2492/17972 cut-off events. [2025-03-08 21:35:09,131 INFO L125 PetriNetUnfolderBase]: For 5268/27144 co-relation queries the response was YES. [2025-03-08 21:35:09,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22939 conditions, 17972 events. 2492/17972 cut-off events. For 5268/27144 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 226052 event pairs, 1706 based on Foata normal form. 0/14727 useless extension candidates. Maximal degree in co-relation 11439. Up to 1670 conditions per place. [2025-03-08 21:35:09,250 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 41 selfloop transitions, 1 changer transitions 0/263 dead transitions. [2025-03-08 21:35:09,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 263 transitions, 696 flow [2025-03-08 21:35:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2025-03-08 21:35:09,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.882494004796163 [2025-03-08 21:35:09,252 INFO L175 Difference]: Start difference. First operand has 249 places, 244 transitions, 534 flow. Second operand 3 states and 736 transitions. [2025-03-08 21:35:09,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 263 transitions, 696 flow [2025-03-08 21:35:09,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 263 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:09,258 INFO L231 Difference]: Finished difference. Result has 245 places, 243 transitions, 533 flow [2025-03-08 21:35:09,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=245, PETRI_TRANSITIONS=243} [2025-03-08 21:35:09,259 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -18 predicate places. [2025-03-08 21:35:09,259 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 243 transitions, 533 flow [2025-03-08 21:35:09,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:09,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:09,259 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-03-08 21:35:09,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:35:09,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-08 21:35:09,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1252530929, now seen corresponding path program 1 times [2025-03-08 21:35:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:09,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941137256] [2025-03-08 21:35:09,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:09,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:09,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 21:35:09,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 21:35:09,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:09,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:09,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941137256] [2025-03-08 21:35:09,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941137256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:09,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:09,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:09,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084269564] [2025-03-08 21:35:09,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:09,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:09,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:09,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:09,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 278 [2025-03-08 21:35:09,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 243 transitions, 533 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-03-08 21:35:09,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:09,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 278 [2025-03-08 21:35:09,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:12,783 INFO L124 PetriNetUnfolderBase]: 14770/42373 cut-off events. [2025-03-08 21:35:12,783 INFO L125 PetriNetUnfolderBase]: For 9226/47382 co-relation queries the response was YES. [2025-03-08 21:35:12,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66312 conditions, 42373 events. 14770/42373 cut-off events. For 9226/47382 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 495833 event pairs, 4272 based on Foata normal form. 121/37401 useless extension candidates. Maximal degree in co-relation 33152. Up to 17809 conditions per place. [2025-03-08 21:35:12,956 INFO L140 encePairwiseOnDemand]: 264/278 looper letters, 41 selfloop transitions, 2 changer transitions 18/258 dead transitions. [2025-03-08 21:35:12,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 258 transitions, 702 flow [2025-03-08 21:35:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:12,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-03-08 21:35:12,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8405275779376499 [2025-03-08 21:35:12,958 INFO L175 Difference]: Start difference. First operand has 245 places, 243 transitions, 533 flow. Second operand 3 states and 701 transitions. [2025-03-08 21:35:12,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 258 transitions, 702 flow [2025-03-08 21:35:12,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 258 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:12,963 INFO L231 Difference]: Finished difference. Result has 240 places, 223 transitions, 502 flow [2025-03-08 21:35:12,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=240, PETRI_TRANSITIONS=223} [2025-03-08 21:35:12,964 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -23 predicate places. [2025-03-08 21:35:12,964 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 223 transitions, 502 flow [2025-03-08 21:35:12,965 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-03-08 21:35:12,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:12,965 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] [2025-03-08 21:35:12,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:35:12,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-08 21:35:12,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1420843941, now seen corresponding path program 1 times [2025-03-08 21:35:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:12,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865081505] [2025-03-08 21:35:12,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:12,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:12,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 21:35:12,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 21:35:12,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:12,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:12,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865081505] [2025-03-08 21:35:12,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865081505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:12,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:12,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:12,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335391132] [2025-03-08 21:35:12,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:12,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:12,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:12,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:12,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:12,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 278 [2025-03-08 21:35:12,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 223 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:12,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:12,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 278 [2025-03-08 21:35:12,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:14,774 INFO L124 PetriNetUnfolderBase]: 6096/23780 cut-off events. [2025-03-08 21:35:14,774 INFO L125 PetriNetUnfolderBase]: For 4746/11286 co-relation queries the response was YES. [2025-03-08 21:35:14,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35749 conditions, 23780 events. 6096/23780 cut-off events. For 4746/11286 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 277243 event pairs, 5210 based on Foata normal form. 0/21026 useless extension candidates. Maximal degree in co-relation 28670. Up to 8524 conditions per place. [2025-03-08 21:35:14,881 INFO L140 encePairwiseOnDemand]: 272/278 looper letters, 28 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-03-08 21:35:14,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 220 transitions, 556 flow [2025-03-08 21:35:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 697 transitions. [2025-03-08 21:35:14,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8357314148681055 [2025-03-08 21:35:14,884 INFO L175 Difference]: Start difference. First operand has 240 places, 223 transitions, 502 flow. Second operand 3 states and 697 transitions. [2025-03-08 21:35:14,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 220 transitions, 556 flow [2025-03-08 21:35:14,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 220 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:14,888 INFO L231 Difference]: Finished difference. Result has 224 places, 220 transitions, 504 flow [2025-03-08 21:35:14,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=224, PETRI_TRANSITIONS=220} [2025-03-08 21:35:14,889 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -39 predicate places. [2025-03-08 21:35:14,889 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 220 transitions, 504 flow [2025-03-08 21:35:14,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:14,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:14,890 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] [2025-03-08 21:35:14,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:35:14,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-08 21:35:14,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:14,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1394085327, now seen corresponding path program 1 times [2025-03-08 21:35:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:14,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407090007] [2025-03-08 21:35:14,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:14,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:14,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 21:35:14,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 21:35:14,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:14,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:14,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:14,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407090007] [2025-03-08 21:35:14,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407090007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:14,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:14,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:14,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904209944] [2025-03-08 21:35:14,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:14,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:14,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:14,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:14,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:14,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 278 [2025-03-08 21:35:14,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 220 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:14,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:14,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 278 [2025-03-08 21:35:14,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:16,897 INFO L124 PetriNetUnfolderBase]: 4656/19695 cut-off events. [2025-03-08 21:35:16,897 INFO L125 PetriNetUnfolderBase]: For 4754/12902 co-relation queries the response was YES. [2025-03-08 21:35:16,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29201 conditions, 19695 events. 4656/19695 cut-off events. For 4754/12902 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 229356 event pairs, 3782 based on Foata normal form. 0/16702 useless extension candidates. Maximal degree in co-relation 24021. Up to 6578 conditions per place. [2025-03-08 21:35:16,972 INFO L140 encePairwiseOnDemand]: 275/278 looper letters, 28 selfloop transitions, 2 changer transitions 2/219 dead transitions. [2025-03-08 21:35:16,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 219 transitions, 562 flow [2025-03-08 21:35:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2025-03-08 21:35:16,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8393285371702638 [2025-03-08 21:35:16,973 INFO L175 Difference]: Start difference. First operand has 224 places, 220 transitions, 504 flow. Second operand 3 states and 700 transitions. [2025-03-08 21:35:16,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 219 transitions, 562 flow [2025-03-08 21:35:16,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 219 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:16,980 INFO L231 Difference]: Finished difference. Result has 225 places, 217 transitions, 502 flow [2025-03-08 21:35:16,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=225, PETRI_TRANSITIONS=217} [2025-03-08 21:35:16,980 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -38 predicate places. [2025-03-08 21:35:16,980 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 217 transitions, 502 flow [2025-03-08 21:35:16,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:16,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:16,981 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] [2025-03-08 21:35:16,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:35:16,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-08 21:35:16,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash 119719473, now seen corresponding path program 1 times [2025-03-08 21:35:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:16,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382714005] [2025-03-08 21:35:16,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:16,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 21:35:16,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 21:35:16,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:16,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:17,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:17,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382714005] [2025-03-08 21:35:17,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382714005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:17,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:17,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:17,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278051923] [2025-03-08 21:35:17,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:17,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:17,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:17,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:17,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:17,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 278 [2025-03-08 21:35:17,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 217 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:17,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:17,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 278 [2025-03-08 21:35:17,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:18,349 INFO L124 PetriNetUnfolderBase]: 2546/16004 cut-off events. [2025-03-08 21:35:18,349 INFO L125 PetriNetUnfolderBase]: For 5268/27144 co-relation queries the response was YES. [2025-03-08 21:35:18,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21678 conditions, 16004 events. 2546/16004 cut-off events. For 5268/27144 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 192526 event pairs, 1706 based on Foata normal form. 0/13616 useless extension candidates. Maximal degree in co-relation 19193. Up to 1670 conditions per place. [2025-03-08 21:35:18,451 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 41 selfloop transitions, 1 changer transitions 0/236 dead transitions. [2025-03-08 21:35:18,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 236 transitions, 664 flow [2025-03-08 21:35:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2025-03-08 21:35:18,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.882494004796163 [2025-03-08 21:35:18,453 INFO L175 Difference]: Start difference. First operand has 225 places, 217 transitions, 502 flow. Second operand 3 states and 736 transitions. [2025-03-08 21:35:18,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 236 transitions, 664 flow [2025-03-08 21:35:18,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 236 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:18,457 INFO L231 Difference]: Finished difference. Result has 222 places, 216 transitions, 498 flow [2025-03-08 21:35:18,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=222, PETRI_TRANSITIONS=216} [2025-03-08 21:35:18,458 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -41 predicate places. [2025-03-08 21:35:18,458 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 216 transitions, 498 flow [2025-03-08 21:35:18,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:18,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:18,459 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] [2025-03-08 21:35:18,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:35:18,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-08 21:35:18,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1921574140, now seen corresponding path program 1 times [2025-03-08 21:35:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:18,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123249027] [2025-03-08 21:35:18,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:18,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:18,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 21:35:18,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 21:35:18,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:18,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:18,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:18,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123249027] [2025-03-08 21:35:18,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123249027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:18,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:18,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:18,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055634949] [2025-03-08 21:35:18,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:18,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:18,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:18,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:18,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:18,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 278 [2025-03-08 21:35:18,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 216 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:18,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:18,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 278 [2025-03-08 21:35:18,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:20,220 INFO L124 PetriNetUnfolderBase]: 5342/21325 cut-off events. [2025-03-08 21:35:20,220 INFO L125 PetriNetUnfolderBase]: For 4784/13692 co-relation queries the response was YES. [2025-03-08 21:35:20,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31977 conditions, 21325 events. 5342/21325 cut-off events. For 4784/13692 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 250635 event pairs, 4482 based on Foata normal form. 0/18118 useless extension candidates. Maximal degree in co-relation 25846. Up to 7458 conditions per place. [2025-03-08 21:35:20,322 INFO L140 encePairwiseOnDemand]: 275/278 looper letters, 29 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2025-03-08 21:35:20,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 215 transitions, 558 flow [2025-03-08 21:35:20,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2025-03-08 21:35:20,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8393285371702638 [2025-03-08 21:35:20,324 INFO L175 Difference]: Start difference. First operand has 222 places, 216 transitions, 498 flow. Second operand 3 states and 700 transitions. [2025-03-08 21:35:20,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 215 transitions, 558 flow [2025-03-08 21:35:20,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 215 transitions, 557 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:20,330 INFO L231 Difference]: Finished difference. Result has 222 places, 215 transitions, 499 flow [2025-03-08 21:35:20,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=222, PETRI_TRANSITIONS=215} [2025-03-08 21:35:20,330 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -41 predicate places. [2025-03-08 21:35:20,330 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 215 transitions, 499 flow [2025-03-08 21:35:20,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:20,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:20,331 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] [2025-03-08 21:35:20,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:35:20,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-08 21:35:20,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:20,332 INFO L85 PathProgramCache]: Analyzing trace with hash -109089251, now seen corresponding path program 1 times [2025-03-08 21:35:20,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:20,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881968260] [2025-03-08 21:35:20,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:20,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 21:35:20,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 21:35:20,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:20,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:20,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881968260] [2025-03-08 21:35:20,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881968260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:20,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:20,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:35:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658126079] [2025-03-08 21:35:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:20,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:20,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:20,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:20,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 278 [2025-03-08 21:35:20,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 215 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:20,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:20,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 278 [2025-03-08 21:35:20,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:22,064 INFO L124 PetriNetUnfolderBase]: 3752/19495 cut-off events. [2025-03-08 21:35:22,064 INFO L125 PetriNetUnfolderBase]: For 5268/27144 co-relation queries the response was YES. [2025-03-08 21:35:22,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27253 conditions, 19495 events. 3752/19495 cut-off events. For 5268/27144 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 235786 event pairs, 2730 based on Foata normal form. 2/16460 useless extension candidates. Maximal degree in co-relation 23378. Up to 5036 conditions per place. [2025-03-08 21:35:22,180 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 27 selfloop transitions, 0 changer transitions 1/214 dead transitions. [2025-03-08 21:35:22,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 214 transitions, 550 flow [2025-03-08 21:35:22,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-03-08 21:35:22,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8405275779376499 [2025-03-08 21:35:22,182 INFO L175 Difference]: Start difference. First operand has 222 places, 215 transitions, 499 flow. Second operand 3 states and 701 transitions. [2025-03-08 21:35:22,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 214 transitions, 550 flow [2025-03-08 21:35:22,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 214 transitions, 542 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-08 21:35:22,188 INFO L231 Difference]: Finished difference. Result has 221 places, 213 transitions, 486 flow [2025-03-08 21:35:22,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=221, PETRI_TRANSITIONS=213} [2025-03-08 21:35:22,189 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -42 predicate places. [2025-03-08 21:35:22,189 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 213 transitions, 486 flow [2025-03-08 21:35:22,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:22,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:22,189 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] [2025-03-08 21:35:22,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:35:22,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-08 21:35:22,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:22,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1945485288, now seen corresponding path program 1 times [2025-03-08 21:35:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:22,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883462590] [2025-03-08 21:35:22,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:22,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 21:35:22,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 21:35:22,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:22,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:22,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:22,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883462590] [2025-03-08 21:35:22,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883462590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:22,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:22,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:22,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574315176] [2025-03-08 21:35:22,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:22,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:22,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:22,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:22,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 278 [2025-03-08 21:35:22,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 213 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 200.66666666666666) internal successors, (1204), 6 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:22,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:22,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 278 [2025-03-08 21:35:22,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:28,438 INFO L124 PetriNetUnfolderBase]: 21016/72675 cut-off events. [2025-03-08 21:35:28,439 INFO L125 PetriNetUnfolderBase]: For 3200/3342 co-relation queries the response was YES. [2025-03-08 21:35:28,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111202 conditions, 72675 events. 21016/72675 cut-off events. For 3200/3342 co-relation queries the response was YES. Maximal size of possible extension queue 1511. Compared 962553 event pairs, 9754 based on Foata normal form. 0/66430 useless extension candidates. Maximal degree in co-relation 111193. Up to 29941 conditions per place. [2025-03-08 21:35:28,845 INFO L140 encePairwiseOnDemand]: 271/278 looper letters, 64 selfloop transitions, 5 changer transitions 3/228 dead transitions. [2025-03-08 21:35:28,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 656 flow [2025-03-08 21:35:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1265 transitions. [2025-03-08 21:35:28,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7583932853717026 [2025-03-08 21:35:28,850 INFO L175 Difference]: Start difference. First operand has 221 places, 213 transitions, 486 flow. Second operand 6 states and 1265 transitions. [2025-03-08 21:35:28,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 228 transitions, 656 flow [2025-03-08 21:35:28,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 228 transitions, 654 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:28,859 INFO L231 Difference]: Finished difference. Result has 223 places, 209 transitions, 486 flow [2025-03-08 21:35:28,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=223, PETRI_TRANSITIONS=209} [2025-03-08 21:35:28,860 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -40 predicate places. [2025-03-08 21:35:28,860 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 209 transitions, 486 flow [2025-03-08 21:35:28,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.66666666666666) internal successors, (1204), 6 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:28,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:28,860 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] [2025-03-08 21:35:28,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:35:28,861 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-08 21:35:28,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:28,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1215970334, now seen corresponding path program 1 times [2025-03-08 21:35:28,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:28,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339293361] [2025-03-08 21:35:28,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:28,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:28,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 21:35:28,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 21:35:28,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:28,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:29,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:29,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339293361] [2025-03-08 21:35:29,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339293361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:29,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:29,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:35:29,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596099908] [2025-03-08 21:35:29,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:29,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:35:29,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:29,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:35:29,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:35:29,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 278 [2025-03-08 21:35:29,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 209 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:29,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:29,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 278 [2025-03-08 21:35:29,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:31,851 INFO L124 PetriNetUnfolderBase]: 7222/29018 cut-off events. [2025-03-08 21:35:31,851 INFO L125 PetriNetUnfolderBase]: For 4098/8924 co-relation queries the response was YES. [2025-03-08 21:35:31,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43101 conditions, 29018 events. 7222/29018 cut-off events. For 4098/8924 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 354227 event pairs, 5043 based on Foata normal form. 137/25721 useless extension candidates. Maximal degree in co-relation 43092. Up to 5892 conditions per place. [2025-03-08 21:35:31,977 INFO L140 encePairwiseOnDemand]: 265/278 looper letters, 77 selfloop transitions, 11 changer transitions 0/262 dead transitions. [2025-03-08 21:35:31,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 262 transitions, 832 flow [2025-03-08 21:35:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:35:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 21:35:31,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 966 transitions. [2025-03-08 21:35:31,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8687050359712231 [2025-03-08 21:35:31,979 INFO L175 Difference]: Start difference. First operand has 223 places, 209 transitions, 486 flow. Second operand 4 states and 966 transitions. [2025-03-08 21:35:31,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 262 transitions, 832 flow [2025-03-08 21:35:31,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 262 transitions, 822 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:31,989 INFO L231 Difference]: Finished difference. Result has 220 places, 218 transitions, 558 flow [2025-03-08 21:35:31,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=558, PETRI_PLACES=220, PETRI_TRANSITIONS=218} [2025-03-08 21:35:31,989 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -43 predicate places. [2025-03-08 21:35:31,989 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 218 transitions, 558 flow [2025-03-08 21:35:31,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 220.5) internal successors, (882), 4 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:31,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:31,990 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] [2025-03-08 21:35:31,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 21:35:31,990 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-08 21:35:31,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:31,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2070094138, now seen corresponding path program 1 times [2025-03-08 21:35:31,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:31,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321205731] [2025-03-08 21:35:31,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:31,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:32,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:35:32,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:35:32,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:32,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:32,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:32,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321205731] [2025-03-08 21:35:32,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321205731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:32,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:32,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:35:32,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479628875] [2025-03-08 21:35:32,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:32,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:32,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:32,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:32,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:32,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 278 [2025-03-08 21:35:32,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 218 transitions, 558 flow. Second operand has 6 states, 6 states have (on average 216.83333333333334) internal successors, (1301), 6 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:32,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:32,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 278 [2025-03-08 21:35:32,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:35,163 INFO L124 PetriNetUnfolderBase]: 8170/32850 cut-off events. [2025-03-08 21:35:35,163 INFO L125 PetriNetUnfolderBase]: For 7354/8940 co-relation queries the response was YES. [2025-03-08 21:35:35,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51732 conditions, 32850 events. 8170/32850 cut-off events. For 7354/8940 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 409326 event pairs, 5344 based on Foata normal form. 3/29337 useless extension candidates. Maximal degree in co-relation 51721. Up to 6739 conditions per place. [2025-03-08 21:35:35,353 INFO L140 encePairwiseOnDemand]: 262/278 looper letters, 96 selfloop transitions, 17 changer transitions 0/283 dead transitions. [2025-03-08 21:35:35,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 283 transitions, 994 flow [2025-03-08 21:35:35,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:35:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 21:35:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1619 transitions. [2025-03-08 21:35:35,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8319630010277492 [2025-03-08 21:35:35,355 INFO L175 Difference]: Start difference. First operand has 220 places, 218 transitions, 558 flow. Second operand 7 states and 1619 transitions. [2025-03-08 21:35:35,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 283 transitions, 994 flow [2025-03-08 21:35:35,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 283 transitions, 992 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:35,365 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 650 flow [2025-03-08 21:35:35,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=650, PETRI_PLACES=229, PETRI_TRANSITIONS=224} [2025-03-08 21:35:35,366 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -34 predicate places. [2025-03-08 21:35:35,366 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 650 flow [2025-03-08 21:35:35,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.83333333333334) internal successors, (1301), 6 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:35,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:35,366 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] [2025-03-08 21:35:35,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 21:35:35,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-08 21:35:35,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:35,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2051350879, now seen corresponding path program 1 times [2025-03-08 21:35:35,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:35,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397614210] [2025-03-08 21:35:35,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:35,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:35,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 21:35:35,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 21:35:35,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:35,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:35,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:35,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397614210] [2025-03-08 21:35:35,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397614210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:35,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:35,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:35,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958246724] [2025-03-08 21:35:35,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:35,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:35,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:35,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:35,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:35,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 278 [2025-03-08 21:35:35,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 224 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:35,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:35,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 278 [2025-03-08 21:35:35,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand