./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/reorder_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/reorder_5.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:02:29,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:02:30,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:02:30,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:02:30,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:02:30,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:02:30,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:02:30,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:02:30,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:02:30,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:02:30,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:02:30,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:02:30,086 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:02:30,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:02:30,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:02:30,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:02:30,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:02:30,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:02:30,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:02:30,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:02:30,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:02:30,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:02:30,087 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:02:30,087 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:02:30,087 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:02:30,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:02:30,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:02:30,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:02:30,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:02:30,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:02:30,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:02:30,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:30,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:02:30,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:02:30,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:02:30,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:30,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:02:30,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:02:30,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:02:30,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:02:30,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:02:30,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:02:30,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:02:30,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:02:30,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:02:30,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:02:30,091 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd [2025-01-09 21:02:30,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:02:30,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:02:30,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:02:30,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:02:30,395 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:02:30,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_5.i [2025-01-09 21:02:31,704 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3deba8def/5f167b164c8b460c803ed570979908f8/FLAG6cf4c41c3 [2025-01-09 21:02:32,099 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:02:32,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/reorder_5.i [2025-01-09 21:02:32,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3deba8def/5f167b164c8b460c803ed570979908f8/FLAG6cf4c41c3 [2025-01-09 21:02:32,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3deba8def/5f167b164c8b460c803ed570979908f8 [2025-01-09 21:02:32,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:02:32,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:02:32,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:02:32,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:02:32,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:02:32,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466b37dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32, skipping insertion in model container [2025-01-09 21:02:32,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:02:32,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:02:32,630 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:02:32,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:02:32,763 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:02:32,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32 WrapperNode [2025-01-09 21:02:32,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:02:32,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:02:32,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:02:32,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:02:32,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,820 INFO L138 Inliner]: procedures = 371, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 208 [2025-01-09 21:02:32,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:02:32,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:02:32,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:02:32,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:02:32,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,849 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:02:32,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:02:32,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:02:32,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:02:32,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (1/1) ... [2025-01-09 21:02:32,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:02:32,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:02:32,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:02:32,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:02:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:02:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:02:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:02:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:02:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:02:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-01-09 21:02:32,916 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-01-09 21:02:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:02:32,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:02:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-01-09 21:02:32,917 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-01-09 21:02:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:02:32,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:02:32,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:02:32,919 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:02:33,067 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:02:33,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:02:33,427 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:02:33,427 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:02:33,472 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:02:33,472 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:02:33,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:33 BoogieIcfgContainer [2025-01-09 21:02:33,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:02:33,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:02:33,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:02:33,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:02:33,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:02:32" (1/3) ... [2025-01-09 21:02:33,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1411e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:33, skipping insertion in model container [2025-01-09 21:02:33,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:02:32" (2/3) ... [2025-01-09 21:02:33,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1411e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:02:33, skipping insertion in model container [2025-01-09 21:02:33,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:02:33" (3/3) ... [2025-01-09 21:02:33,485 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_5.i [2025-01-09 21:02:33,527 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:02:33,531 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_5.i that has 3 procedures, 224 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-01-09 21:02:33,532 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:02:33,615 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:02:33,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 242 transitions, 504 flow [2025-01-09 21:02:33,816 INFO L124 PetriNetUnfolderBase]: 37/514 cut-off events. [2025-01-09 21:02:33,818 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:02:33,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 514 events. 37/514 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2037 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 278. Up to 8 conditions per place. [2025-01-09 21:02:33,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 242 transitions, 504 flow [2025-01-09 21:02:33,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 242 transitions, 504 flow [2025-01-09 21:02:33,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:02:33,855 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;@2c8fe775, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:02:33,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-01-09 21:02:33,863 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:02:33,863 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-01-09 21:02:33,863 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:33,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:33,864 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-01-09 21:02:33,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:33,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:33,871 INFO L85 PathProgramCache]: Analyzing trace with hash 783935003, now seen corresponding path program 1 times [2025-01-09 21:02:33,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:33,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643583617] [2025-01-09 21:02:33,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:33,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:33,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:02:33,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:02:33,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:33,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:34,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:34,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643583617] [2025-01-09 21:02:34,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643583617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:34,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:34,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:34,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569435340] [2025-01-09 21:02:34,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:34,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:34,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:34,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:34,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:34,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 242 [2025-01-09 21:02:34,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 242 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:34,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:34,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 242 [2025-01-09 21:02:34,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:34,377 INFO L124 PetriNetUnfolderBase]: 63/784 cut-off events. [2025-01-09 21:02:34,377 INFO L125 PetriNetUnfolderBase]: For 90/142 co-relation queries the response was YES. [2025-01-09 21:02:34,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 784 events. 63/784 cut-off events. For 90/142 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3917 event pairs, 50 based on Foata normal form. 53/708 useless extension candidates. Maximal degree in co-relation 557. Up to 128 conditions per place. [2025-01-09 21:02:34,383 INFO L140 encePairwiseOnDemand]: 222/242 looper letters, 18 selfloop transitions, 1 changer transitions 6/222 dead transitions. [2025-01-09 21:02:34,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 222 transitions, 502 flow [2025-01-09 21:02:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2025-01-09 21:02:34,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8911845730027548 [2025-01-09 21:02:34,406 INFO L175 Difference]: Start difference. First operand has 230 places, 242 transitions, 504 flow. Second operand 3 states and 647 transitions. [2025-01-09 21:02:34,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 222 transitions, 502 flow [2025-01-09 21:02:34,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 222 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:34,421 INFO L231 Difference]: Finished difference. Result has 223 places, 216 transitions, 454 flow [2025-01-09 21:02:34,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=223, PETRI_TRANSITIONS=216} [2025-01-09 21:02:34,427 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -7 predicate places. [2025-01-09 21:02:34,429 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 216 transitions, 454 flow [2025-01-09 21:02:34,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:34,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:34,430 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-01-09 21:02:34,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:02:34,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:34,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:34,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1467841754, now seen corresponding path program 1 times [2025-01-09 21:02:34,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:34,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74367067] [2025-01-09 21:02:34,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:34,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:34,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 21:02:34,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 21:02:34,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:34,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74367067] [2025-01-09 21:02:34,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74367067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:34,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:34,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:34,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150086458] [2025-01-09 21:02:34,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:34,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:34,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:34,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:34,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:34,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 242 [2025-01-09 21:02:34,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 216 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:34,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:34,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 242 [2025-01-09 21:02:34,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:34,816 INFO L124 PetriNetUnfolderBase]: 60/1377 cut-off events. [2025-01-09 21:02:34,817 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-01-09 21:02:34,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 1377 events. 60/1377 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8646 event pairs, 28 based on Foata normal form. 0/1162 useless extension candidates. Maximal degree in co-relation 742. Up to 51 conditions per place. [2025-01-09 21:02:34,826 INFO L140 encePairwiseOnDemand]: 240/242 looper letters, 21 selfloop transitions, 1 changer transitions 0/225 dead transitions. [2025-01-09 21:02:34,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 225 transitions, 534 flow [2025-01-09 21:02:34,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2025-01-09 21:02:34,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118457300275482 [2025-01-09 21:02:34,830 INFO L175 Difference]: Start difference. First operand has 223 places, 216 transitions, 454 flow. Second operand 3 states and 662 transitions. [2025-01-09 21:02:34,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 225 transitions, 534 flow [2025-01-09 21:02:34,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 225 transitions, 533 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:34,837 INFO L231 Difference]: Finished difference. Result has 217 places, 215 transitions, 453 flow [2025-01-09 21:02:34,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=217, PETRI_TRANSITIONS=215} [2025-01-09 21:02:34,840 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -13 predicate places. [2025-01-09 21:02:34,841 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 215 transitions, 453 flow [2025-01-09 21:02:34,841 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-01-09 21:02:34,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:34,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:34,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:02:34,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:34,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1741415276, now seen corresponding path program 1 times [2025-01-09 21:02:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:34,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210807736] [2025-01-09 21:02:34,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:34,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:02:34,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:02:34,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:34,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:34,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:34,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210807736] [2025-01-09 21:02:34,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210807736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:34,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:34,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:34,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652181501] [2025-01-09 21:02:34,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:34,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:34,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:34,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:34,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:34,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 242 [2025-01-09 21:02:34,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 215 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:34,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:34,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 242 [2025-01-09 21:02:34,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:35,149 INFO L124 PetriNetUnfolderBase]: 232/1654 cut-off events. [2025-01-09 21:02:35,150 INFO L125 PetriNetUnfolderBase]: For 154/458 co-relation queries the response was YES. [2025-01-09 21:02:35,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 1654 events. 232/1654 cut-off events. For 154/458 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 10762 event pairs, 52 based on Foata normal form. 19/1466 useless extension candidates. Maximal degree in co-relation 1088. Up to 355 conditions per place. [2025-01-09 21:02:35,156 INFO L140 encePairwiseOnDemand]: 230/242 looper letters, 15 selfloop transitions, 1 changer transitions 24/219 dead transitions. [2025-01-09 21:02:35,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 219 transitions, 527 flow [2025-01-09 21:02:35,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2025-01-09 21:02:35,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8677685950413223 [2025-01-09 21:02:35,159 INFO L175 Difference]: Start difference. First operand has 217 places, 215 transitions, 453 flow. Second operand 3 states and 630 transitions. [2025-01-09 21:02:35,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 219 transitions, 527 flow [2025-01-09 21:02:35,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 219 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:35,165 INFO L231 Difference]: Finished difference. Result has 212 places, 191 transitions, 406 flow [2025-01-09 21:02:35,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=212, PETRI_TRANSITIONS=191} [2025-01-09 21:02:35,166 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -18 predicate places. [2025-01-09 21:02:35,166 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 191 transitions, 406 flow [2025-01-09 21:02:35,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:35,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:35,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:35,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:02:35,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:35,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:35,169 INFO L85 PathProgramCache]: Analyzing trace with hash -710082850, now seen corresponding path program 1 times [2025-01-09 21:02:35,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:35,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292602953] [2025-01-09 21:02:35,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:35,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:35,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 21:02:35,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 21:02:35,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:35,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:35,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292602953] [2025-01-09 21:02:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292602953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:35,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:35,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:35,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750115510] [2025-01-09 21:02:35,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:35,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:35,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:35,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:35,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 242 [2025-01-09 21:02:35,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 191 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:35,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:35,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 242 [2025-01-09 21:02:35,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:35,412 INFO L124 PetriNetUnfolderBase]: 184/1551 cut-off events. [2025-01-09 21:02:35,413 INFO L125 PetriNetUnfolderBase]: For 112/216 co-relation queries the response was YES. [2025-01-09 21:02:35,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 1551 events. 184/1551 cut-off events. For 112/216 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10269 event pairs, 156 based on Foata normal form. 0/1351 useless extension candidates. Maximal degree in co-relation 1839. Up to 362 conditions per place. [2025-01-09 21:02:35,424 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 18 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-01-09 21:02:35,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 188 transitions, 440 flow [2025-01-09 21:02:35,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2025-01-09 21:02:35,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.871900826446281 [2025-01-09 21:02:35,430 INFO L175 Difference]: Start difference. First operand has 212 places, 191 transitions, 406 flow. Second operand 3 states and 633 transitions. [2025-01-09 21:02:35,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 188 transitions, 440 flow [2025-01-09 21:02:35,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 188 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:35,438 INFO L231 Difference]: Finished difference. Result has 192 places, 188 transitions, 407 flow [2025-01-09 21:02:35,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=192, PETRI_TRANSITIONS=188} [2025-01-09 21:02:35,440 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -38 predicate places. [2025-01-09 21:02:35,440 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 188 transitions, 407 flow [2025-01-09 21:02:35,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:35,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:35,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:35,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:02:35,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:35,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:35,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1136030203, now seen corresponding path program 1 times [2025-01-09 21:02:35,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:35,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444890033] [2025-01-09 21:02:35,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:35,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:35,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:02:35,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:02:35,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:35,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:35,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444890033] [2025-01-09 21:02:35,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444890033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:35,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:35,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:35,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861237579] [2025-01-09 21:02:35,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:35,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:35,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:35,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:35,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:35,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 242 [2025-01-09 21:02:35,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 188 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:35,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:35,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 242 [2025-01-09 21:02:35,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:35,697 INFO L124 PetriNetUnfolderBase]: 124/1330 cut-off events. [2025-01-09 21:02:35,698 INFO L125 PetriNetUnfolderBase]: For 112/216 co-relation queries the response was YES. [2025-01-09 21:02:35,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 1330 events. 124/1330 cut-off events. For 112/216 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8372 event pairs, 96 based on Foata normal form. 0/1141 useless extension candidates. Maximal degree in co-relation 840. Up to 250 conditions per place. [2025-01-09 21:02:35,705 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 17 selfloop transitions, 2 changer transitions 3/187 dead transitions. [2025-01-09 21:02:35,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 187 transitions, 445 flow [2025-01-09 21:02:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:35,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-01-09 21:02:35,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8760330578512396 [2025-01-09 21:02:35,713 INFO L175 Difference]: Start difference. First operand has 192 places, 188 transitions, 407 flow. Second operand 3 states and 636 transitions. [2025-01-09 21:02:35,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 187 transitions, 445 flow [2025-01-09 21:02:35,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 187 transitions, 445 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:35,718 INFO L231 Difference]: Finished difference. Result has 193 places, 184 transitions, 403 flow [2025-01-09 21:02:35,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=193, PETRI_TRANSITIONS=184} [2025-01-09 21:02:35,720 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -37 predicate places. [2025-01-09 21:02:35,723 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 184 transitions, 403 flow [2025-01-09 21:02:35,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:35,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:35,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:35,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:02:35,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:35,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:35,725 INFO L85 PathProgramCache]: Analyzing trace with hash -47007993, now seen corresponding path program 1 times [2025-01-09 21:02:35,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:35,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316640158] [2025-01-09 21:02:35,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:35,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:35,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:02:35,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:02:35,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:35,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:35,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:35,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316640158] [2025-01-09 21:02:35,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316640158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:35,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:35,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:35,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378179792] [2025-01-09 21:02:35,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:35,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:35,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:35,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:35,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:35,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 242 [2025-01-09 21:02:35,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 184 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:35,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:35,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 242 [2025-01-09 21:02:35,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:35,939 INFO L124 PetriNetUnfolderBase]: 60/1177 cut-off events. [2025-01-09 21:02:35,939 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-01-09 21:02:35,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 1177 events. 60/1177 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6848 event pairs, 28 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 684. Up to 51 conditions per place. [2025-01-09 21:02:35,945 INFO L140 encePairwiseOnDemand]: 240/242 looper letters, 21 selfloop transitions, 1 changer transitions 0/193 dead transitions. [2025-01-09 21:02:35,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 193 transitions, 483 flow [2025-01-09 21:02:35,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2025-01-09 21:02:35,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118457300275482 [2025-01-09 21:02:35,948 INFO L175 Difference]: Start difference. First operand has 193 places, 184 transitions, 403 flow. Second operand 3 states and 662 transitions. [2025-01-09 21:02:35,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 193 transitions, 483 flow [2025-01-09 21:02:35,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 193 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:35,953 INFO L231 Difference]: Finished difference. Result has 189 places, 183 transitions, 399 flow [2025-01-09 21:02:35,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=189, PETRI_TRANSITIONS=183} [2025-01-09 21:02:35,955 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -41 predicate places. [2025-01-09 21:02:35,956 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 183 transitions, 399 flow [2025-01-09 21:02:35,957 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-01-09 21:02:35,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:35,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:35,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:02:35,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:35,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash -624096762, now seen corresponding path program 1 times [2025-01-09 21:02:35,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:35,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856585867] [2025-01-09 21:02:35,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:35,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:35,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:02:35,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:02:35,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:35,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:36,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:36,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856585867] [2025-01-09 21:02:36,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856585867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:36,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:36,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:36,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595277494] [2025-01-09 21:02:36,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:36,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:36,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:36,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:36,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:36,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 242 [2025-01-09 21:02:36,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 183 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:36,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:36,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 242 [2025-01-09 21:02:36,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:36,165 INFO L124 PetriNetUnfolderBase]: 120/1268 cut-off events. [2025-01-09 21:02:36,166 INFO L125 PetriNetUnfolderBase]: For 118/222 co-relation queries the response was YES. [2025-01-09 21:02:36,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1268 events. 120/1268 cut-off events. For 118/222 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7937 event pairs, 92 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 808. Up to 234 conditions per place. [2025-01-09 21:02:36,172 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 18 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-01-09 21:02:36,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 182 transitions, 437 flow [2025-01-09 21:02:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-01-09 21:02:36,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746556473829201 [2025-01-09 21:02:36,175 INFO L175 Difference]: Start difference. First operand has 189 places, 183 transitions, 399 flow. Second operand 3 states and 635 transitions. [2025-01-09 21:02:36,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 182 transitions, 437 flow [2025-01-09 21:02:36,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 182 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:36,180 INFO L231 Difference]: Finished difference. Result has 189 places, 182 transitions, 400 flow [2025-01-09 21:02:36,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=189, PETRI_TRANSITIONS=182} [2025-01-09 21:02:36,182 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -41 predicate places. [2025-01-09 21:02:36,183 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 182 transitions, 400 flow [2025-01-09 21:02:36,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:36,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:36,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:36,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:02:36,184 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:36,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:36,185 INFO L85 PathProgramCache]: Analyzing trace with hash 71467136, now seen corresponding path program 1 times [2025-01-09 21:02:36,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:36,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963422295] [2025-01-09 21:02:36,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:36,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:36,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:02:36,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:02:36,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:36,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:36,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:36,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963422295] [2025-01-09 21:02:36,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963422295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:36,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:36,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:02:36,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511974977] [2025-01-09 21:02:36,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:36,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:36,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:36,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:36,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:36,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 242 [2025-01-09 21:02:36,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 182 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:36,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:36,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 242 [2025-01-09 21:02:36,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:36,386 INFO L124 PetriNetUnfolderBase]: 58/1164 cut-off events. [2025-01-09 21:02:36,386 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-01-09 21:02:36,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 1164 events. 58/1164 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6776 event pairs, 28 based on Foata normal form. 2/1023 useless extension candidates. Maximal degree in co-relation 695. Up to 110 conditions per place. [2025-01-09 21:02:36,392 INFO L140 encePairwiseOnDemand]: 240/242 looper letters, 16 selfloop transitions, 0 changer transitions 1/181 dead transitions. [2025-01-09 21:02:36,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 181 transitions, 429 flow [2025-01-09 21:02:36,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-01-09 21:02:36,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8760330578512396 [2025-01-09 21:02:36,395 INFO L175 Difference]: Start difference. First operand has 189 places, 182 transitions, 400 flow. Second operand 3 states and 636 transitions. [2025-01-09 21:02:36,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 181 transitions, 429 flow [2025-01-09 21:02:36,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 181 transitions, 421 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-09 21:02:36,398 INFO L231 Difference]: Finished difference. Result has 188 places, 180 transitions, 387 flow [2025-01-09 21:02:36,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=188, PETRI_TRANSITIONS=180} [2025-01-09 21:02:36,399 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -42 predicate places. [2025-01-09 21:02:36,399 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 180 transitions, 387 flow [2025-01-09 21:02:36,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:36,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:36,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:36,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:02:36,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:36,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:36,400 INFO L85 PathProgramCache]: Analyzing trace with hash -554311253, now seen corresponding path program 1 times [2025-01-09 21:02:36,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:36,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735141573] [2025-01-09 21:02:36,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:36,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:36,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:02:36,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:02:36,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:36,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:36,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:36,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735141573] [2025-01-09 21:02:36,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735141573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:36,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:36,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:02:36,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433532899] [2025-01-09 21:02:36,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:36,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:02:36,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:36,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:02:36,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:02:37,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 242 [2025-01-09 21:02:37,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 180 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 182.66666666666666) internal successors, (1096), 6 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:37,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:37,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 242 [2025-01-09 21:02:37,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:37,488 INFO L124 PetriNetUnfolderBase]: 652/3388 cut-off events. [2025-01-09 21:02:37,489 INFO L125 PetriNetUnfolderBase]: For 96/106 co-relation queries the response was YES. [2025-01-09 21:02:37,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4910 conditions, 3388 events. 652/3388 cut-off events. For 96/106 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 28250 event pairs, 296 based on Foata normal form. 0/3005 useless extension candidates. Maximal degree in co-relation 4904. Up to 1255 conditions per place. [2025-01-09 21:02:37,505 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 44 selfloop transitions, 5 changer transitions 4/187 dead transitions. [2025-01-09 21:02:37,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 187 transitions, 501 flow [2025-01-09 21:02:37,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:02:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:02:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1137 transitions. [2025-01-09 21:02:37,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7830578512396694 [2025-01-09 21:02:37,510 INFO L175 Difference]: Start difference. First operand has 188 places, 180 transitions, 387 flow. Second operand 6 states and 1137 transitions. [2025-01-09 21:02:37,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 187 transitions, 501 flow [2025-01-09 21:02:37,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 187 transitions, 499 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:37,514 INFO L231 Difference]: Finished difference. Result has 190 places, 175 transitions, 385 flow [2025-01-09 21:02:37,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=190, PETRI_TRANSITIONS=175} [2025-01-09 21:02:37,515 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -40 predicate places. [2025-01-09 21:02:37,515 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 175 transitions, 385 flow [2025-01-09 21:02:37,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.66666666666666) internal successors, (1096), 6 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:37,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:37,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:37,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:02:37,516 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:37,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:37,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1071904762, now seen corresponding path program 1 times [2025-01-09 21:02:37,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:37,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176514060] [2025-01-09 21:02:37,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:37,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:37,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:02:37,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:02:37,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:37,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:37,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:37,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176514060] [2025-01-09 21:02:37,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176514060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:37,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:37,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:02:37,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995330046] [2025-01-09 21:02:37,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:37,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:02:37,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:37,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:02:37,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:02:37,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 242 [2025-01-09 21:02:37,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 175 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:37,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:37,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 242 [2025-01-09 21:02:37,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:37,937 INFO L124 PetriNetUnfolderBase]: 159/1449 cut-off events. [2025-01-09 21:02:37,937 INFO L125 PetriNetUnfolderBase]: For 90/192 co-relation queries the response was YES. [2025-01-09 21:02:37,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1906 conditions, 1449 events. 159/1449 cut-off events. For 90/192 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9758 event pairs, 120 based on Foata normal form. 11/1288 useless extension candidates. Maximal degree in co-relation 1900. Up to 209 conditions per place. [2025-01-09 21:02:37,947 INFO L140 encePairwiseOnDemand]: 230/242 looper letters, 42 selfloop transitions, 10 changer transitions 0/203 dead transitions. [2025-01-09 21:02:37,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 203 transitions, 569 flow [2025-01-09 21:02:37,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:02:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:02:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 858 transitions. [2025-01-09 21:02:37,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2025-01-09 21:02:37,950 INFO L175 Difference]: Start difference. First operand has 190 places, 175 transitions, 385 flow. Second operand 4 states and 858 transitions. [2025-01-09 21:02:37,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 203 transitions, 569 flow [2025-01-09 21:02:37,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 203 transitions, 559 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:02:37,955 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 449 flow [2025-01-09 21:02:37,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2025-01-09 21:02:37,956 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -44 predicate places. [2025-01-09 21:02:37,957 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 449 flow [2025-01-09 21:02:37,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:37,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:37,958 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:37,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:02:37,958 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-01-09 21:02:37,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:37,959 INFO L85 PathProgramCache]: Analyzing trace with hash 180182476, now seen corresponding path program 1 times [2025-01-09 21:02:37,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:37,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14639843] [2025-01-09 21:02:37,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:37,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:37,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:02:37,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:02:37,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:37,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:02:37,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:02:38,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:02:38,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:02:38,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:38,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:02:38,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:02:38,045 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:02:38,046 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-01-09 21:02:38,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2025-01-09 21:02:38,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2025-01-09 21:02:38,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2025-01-09 21:02:38,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2025-01-09 21:02:38,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2025-01-09 21:02:38,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2025-01-09 21:02:38,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2025-01-09 21:02:38,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 33 remaining) [2025-01-09 21:02:38,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2025-01-09 21:02:38,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2025-01-09 21:02:38,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2025-01-09 21:02:38,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2025-01-09 21:02:38,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2025-01-09 21:02:38,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:02:38,052 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:38,054 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:02:38,054 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:02:38,098 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-09 21:02:38,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 271 transitions, 586 flow [2025-01-09 21:02:38,235 INFO L124 PetriNetUnfolderBase]: 149/1607 cut-off events. [2025-01-09 21:02:38,235 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-09 21:02:38,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1696 conditions, 1607 events. 149/1607 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 9320 event pairs, 1 based on Foata normal form. 0/1314 useless extension candidates. Maximal degree in co-relation 931. Up to 32 conditions per place. [2025-01-09 21:02:38,242 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 271 transitions, 586 flow [2025-01-09 21:02:38,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 271 transitions, 586 flow [2025-01-09 21:02:38,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:02:38,254 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;@2c8fe775, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:02:38,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-09 21:02:38,257 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:02:38,257 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-01-09 21:02:38,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:02:38,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:38,257 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-01-09 21:02:38,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:38,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash 102067803, now seen corresponding path program 1 times [2025-01-09 21:02:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:38,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549344319] [2025-01-09 21:02:38,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:38,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:38,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:02:38,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:02:38,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:38,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:38,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:38,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549344319] [2025-01-09 21:02:38,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549344319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:38,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:38,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253085451] [2025-01-09 21:02:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:38,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:38,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:38,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:38,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:38,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 271 [2025-01-09 21:02:38,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 271 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:38,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:38,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 271 [2025-01-09 21:02:38,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:39,391 INFO L124 PetriNetUnfolderBase]: 2218/9953 cut-off events. [2025-01-09 21:02:39,391 INFO L125 PetriNetUnfolderBase]: For 2566/5635 co-relation queries the response was YES. [2025-01-09 21:02:39,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13940 conditions, 9953 events. 2218/9953 cut-off events. For 2566/5635 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 103502 event pairs, 1905 based on Foata normal form. 879/9106 useless extension candidates. Maximal degree in co-relation 9049. Up to 3249 conditions per place. [2025-01-09 21:02:39,491 INFO L140 encePairwiseOnDemand]: 246/271 looper letters, 28 selfloop transitions, 1 changer transitions 4/245 dead transitions. [2025-01-09 21:02:39,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 245 transitions, 592 flow [2025-01-09 21:02:39,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-01-09 21:02:39,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8622386223862238 [2025-01-09 21:02:39,494 INFO L175 Difference]: Start difference. First operand has 258 places, 271 transitions, 586 flow. Second operand 3 states and 701 transitions. [2025-01-09 21:02:39,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 245 transitions, 592 flow [2025-01-09 21:02:39,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 245 transitions, 592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:39,500 INFO L231 Difference]: Finished difference. Result has 246 places, 241 transitions, 528 flow [2025-01-09 21:02:39,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=246, PETRI_TRANSITIONS=241} [2025-01-09 21:02:39,503 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -12 predicate places. [2025-01-09 21:02:39,503 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 241 transitions, 528 flow [2025-01-09 21:02:39,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:39,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:39,504 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-01-09 21:02:39,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:02:39,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:39,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:39,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1130888205, now seen corresponding path program 1 times [2025-01-09 21:02:39,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:39,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284237195] [2025-01-09 21:02:39,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:39,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:39,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 21:02:39,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 21:02:39,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:39,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:39,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:39,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284237195] [2025-01-09 21:02:39,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284237195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:39,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:39,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:39,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803762644] [2025-01-09 21:02:39,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:39,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:39,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:39,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:39,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:39,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 271 [2025-01-09 21:02:39,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 241 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:39,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:39,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 271 [2025-01-09 21:02:39,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:41,366 INFO L124 PetriNetUnfolderBase]: 2492/17389 cut-off events. [2025-01-09 21:02:41,367 INFO L125 PetriNetUnfolderBase]: For 5164/27040 co-relation queries the response was YES. [2025-01-09 21:02:41,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22356 conditions, 17389 events. 2492/17389 cut-off events. For 5164/27040 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 215856 event pairs, 1706 based on Foata normal form. 0/14144 useless extension candidates. Maximal degree in co-relation 11147. Up to 1670 conditions per place. [2025-01-09 21:02:41,502 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 41 selfloop transitions, 1 changer transitions 0/260 dead transitions. [2025-01-09 21:02:41,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 260 transitions, 690 flow [2025-01-09 21:02:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2025-01-09 21:02:41,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8868388683886839 [2025-01-09 21:02:41,505 INFO L175 Difference]: Start difference. First operand has 246 places, 241 transitions, 528 flow. Second operand 3 states and 721 transitions. [2025-01-09 21:02:41,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 260 transitions, 690 flow [2025-01-09 21:02:41,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 260 transitions, 689 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:41,511 INFO L231 Difference]: Finished difference. Result has 242 places, 240 transitions, 527 flow [2025-01-09 21:02:41,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=242, PETRI_TRANSITIONS=240} [2025-01-09 21:02:41,513 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -16 predicate places. [2025-01-09 21:02:41,513 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 527 flow [2025-01-09 21:02:41,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:41,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:41,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:41,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:02:41,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:41,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash -697926324, now seen corresponding path program 1 times [2025-01-09 21:02:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:41,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410213811] [2025-01-09 21:02:41,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:41,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:02:41,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:02:41,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:41,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:41,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:41,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410213811] [2025-01-09 21:02:41,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410213811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:41,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:41,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:41,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378909785] [2025-01-09 21:02:41,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:41,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:41,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:41,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:41,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:41,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 271 [2025-01-09 21:02:41,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:41,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:41,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 271 [2025-01-09 21:02:41,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:44,903 INFO L124 PetriNetUnfolderBase]: 14770/40622 cut-off events. [2025-01-09 21:02:44,903 INFO L125 PetriNetUnfolderBase]: For 8946/47102 co-relation queries the response was YES. [2025-01-09 21:02:45,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64561 conditions, 40622 events. 14770/40622 cut-off events. For 8946/47102 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 463105 event pairs, 4272 based on Foata normal form. 121/35648 useless extension candidates. Maximal degree in co-relation 32276. Up to 17809 conditions per place. [2025-01-09 21:02:45,227 INFO L140 encePairwiseOnDemand]: 257/271 looper letters, 41 selfloop transitions, 2 changer transitions 18/255 dead transitions. [2025-01-09 21:02:45,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 255 transitions, 696 flow [2025-01-09 21:02:45,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-01-09 21:02:45,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437884378843789 [2025-01-09 21:02:45,230 INFO L175 Difference]: Start difference. First operand has 242 places, 240 transitions, 527 flow. Second operand 3 states and 686 transitions. [2025-01-09 21:02:45,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 255 transitions, 696 flow [2025-01-09 21:02:45,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 255 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:45,238 INFO L231 Difference]: Finished difference. Result has 237 places, 220 transitions, 496 flow [2025-01-09 21:02:45,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=237, PETRI_TRANSITIONS=220} [2025-01-09 21:02:45,239 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -21 predicate places. [2025-01-09 21:02:45,239 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 220 transitions, 496 flow [2025-01-09 21:02:45,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:45,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:45,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:45,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:02:45,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:45,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash 134791774, now seen corresponding path program 1 times [2025-01-09 21:02:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:45,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598686494] [2025-01-09 21:02:45,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:45,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 21:02:45,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 21:02:45,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:45,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:45,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:45,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598686494] [2025-01-09 21:02:45,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598686494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:45,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:45,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:45,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497806772] [2025-01-09 21:02:45,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:45,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:45,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:45,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:45,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:45,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 271 [2025-01-09 21:02:45,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 220 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:45,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:45,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 271 [2025-01-09 21:02:45,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:47,353 INFO L124 PetriNetUnfolderBase]: 6096/21809 cut-off events. [2025-01-09 21:02:47,353 INFO L125 PetriNetUnfolderBase]: For 4630/11170 co-relation queries the response was YES. [2025-01-09 21:02:47,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33778 conditions, 21809 events. 6096/21809 cut-off events. For 4630/11170 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 243860 event pairs, 5210 based on Foata normal form. 0/19055 useless extension candidates. Maximal degree in co-relation 28671. Up to 8524 conditions per place. [2025-01-09 21:02:47,460 INFO L140 encePairwiseOnDemand]: 265/271 looper letters, 28 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2025-01-09 21:02:47,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 217 transitions, 550 flow [2025-01-09 21:02:47,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-01-09 21:02:47,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8388683886838868 [2025-01-09 21:02:47,463 INFO L175 Difference]: Start difference. First operand has 237 places, 220 transitions, 496 flow. Second operand 3 states and 682 transitions. [2025-01-09 21:02:47,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 217 transitions, 550 flow [2025-01-09 21:02:47,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 217 transitions, 550 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:47,470 INFO L231 Difference]: Finished difference. Result has 221 places, 217 transitions, 498 flow [2025-01-09 21:02:47,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=221, PETRI_TRANSITIONS=217} [2025-01-09 21:02:47,472 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -37 predicate places. [2025-01-09 21:02:47,472 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 217 transitions, 498 flow [2025-01-09 21:02:47,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:47,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:47,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:47,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:02:47,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:47,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:47,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1311733531, now seen corresponding path program 1 times [2025-01-09 21:02:47,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:47,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231521107] [2025-01-09 21:02:47,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:47,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:47,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:02:47,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:02:47,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:47,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:47,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:47,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231521107] [2025-01-09 21:02:47,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231521107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:47,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:47,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:47,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952635066] [2025-01-09 21:02:47,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:47,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:47,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:47,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:47,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:47,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 271 [2025-01-09 21:02:47,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 217 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:47,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:47,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 271 [2025-01-09 21:02:47,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:49,073 INFO L124 PetriNetUnfolderBase]: 4656/18252 cut-off events. [2025-01-09 21:02:49,073 INFO L125 PetriNetUnfolderBase]: For 4636/12784 co-relation queries the response was YES. [2025-01-09 21:02:49,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27758 conditions, 18252 events. 4656/18252 cut-off events. For 4636/12784 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 205409 event pairs, 3782 based on Foata normal form. 0/15259 useless extension candidates. Maximal degree in co-relation 24022. Up to 6578 conditions per place. [2025-01-09 21:02:49,145 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 28 selfloop transitions, 2 changer transitions 2/216 dead transitions. [2025-01-09 21:02:49,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 216 transitions, 556 flow [2025-01-09 21:02:49,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:49,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 685 transitions. [2025-01-09 21:02:49,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425584255842559 [2025-01-09 21:02:49,148 INFO L175 Difference]: Start difference. First operand has 221 places, 217 transitions, 498 flow. Second operand 3 states and 685 transitions. [2025-01-09 21:02:49,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 216 transitions, 556 flow [2025-01-09 21:02:49,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 216 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:02:49,154 INFO L231 Difference]: Finished difference. Result has 222 places, 214 transitions, 496 flow [2025-01-09 21:02:49,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=222, PETRI_TRANSITIONS=214} [2025-01-09 21:02:49,155 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -36 predicate places. [2025-01-09 21:02:49,155 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 214 transitions, 496 flow [2025-01-09 21:02:49,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:49,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:49,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:49,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:02:49,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:49,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2133856519, now seen corresponding path program 1 times [2025-01-09 21:02:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:49,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167879138] [2025-01-09 21:02:49,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:49,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:49,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:02:49,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:02:49,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:49,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:49,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:49,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167879138] [2025-01-09 21:02:49,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167879138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:49,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:49,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:49,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800853951] [2025-01-09 21:02:49,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:49,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:49,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:49,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:49,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:49,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 271 [2025-01-09 21:02:49,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 214 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:49,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:49,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 271 [2025-01-09 21:02:49,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:50,691 INFO L124 PetriNetUnfolderBase]: 2546/15313 cut-off events. [2025-01-09 21:02:50,691 INFO L125 PetriNetUnfolderBase]: For 5164/27040 co-relation queries the response was YES. [2025-01-09 21:02:50,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20987 conditions, 15313 events. 2546/15313 cut-off events. For 5164/27040 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 181117 event pairs, 1706 based on Foata normal form. 0/12925 useless extension candidates. Maximal degree in co-relation 19194. Up to 1670 conditions per place. [2025-01-09 21:02:50,756 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 41 selfloop transitions, 1 changer transitions 0/233 dead transitions. [2025-01-09 21:02:50,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 233 transitions, 658 flow [2025-01-09 21:02:50,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2025-01-09 21:02:50,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8868388683886839 [2025-01-09 21:02:50,759 INFO L175 Difference]: Start difference. First operand has 222 places, 214 transitions, 496 flow. Second operand 3 states and 721 transitions. [2025-01-09 21:02:50,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 233 transitions, 658 flow [2025-01-09 21:02:50,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 233 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:02:50,765 INFO L231 Difference]: Finished difference. Result has 219 places, 213 transitions, 492 flow [2025-01-09 21:02:50,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=219, PETRI_TRANSITIONS=213} [2025-01-09 21:02:50,766 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -39 predicate places. [2025-01-09 21:02:50,766 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 213 transitions, 492 flow [2025-01-09 21:02:50,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:50,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:50,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:50,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:02:50,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:50,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1302004269, now seen corresponding path program 1 times [2025-01-09 21:02:50,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:50,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081088870] [2025-01-09 21:02:50,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:50,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:02:50,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:02:50,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:50,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:50,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:50,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081088870] [2025-01-09 21:02:50,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081088870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:50,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:50,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:02:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112353843] [2025-01-09 21:02:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:50,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:50,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:50,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:50,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:50,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 271 [2025-01-09 21:02:50,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 213 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:50,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:50,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 271 [2025-01-09 21:02:50,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:52,403 INFO L124 PetriNetUnfolderBase]: 5342/19618 cut-off events. [2025-01-09 21:02:52,404 INFO L125 PetriNetUnfolderBase]: For 4642/12842 co-relation queries the response was YES. [2025-01-09 21:02:52,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30270 conditions, 19618 events. 5342/19618 cut-off events. For 4642/12842 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 222308 event pairs, 4482 based on Foata normal form. 0/16493 useless extension candidates. Maximal degree in co-relation 25847. Up to 7458 conditions per place. [2025-01-09 21:02:52,481 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 29 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2025-01-09 21:02:52,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 212 transitions, 552 flow [2025-01-09 21:02:52,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 685 transitions. [2025-01-09 21:02:52,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425584255842559 [2025-01-09 21:02:52,484 INFO L175 Difference]: Start difference. First operand has 219 places, 213 transitions, 492 flow. Second operand 3 states and 685 transitions. [2025-01-09 21:02:52,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 212 transitions, 552 flow [2025-01-09 21:02:52,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 212 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:02:52,489 INFO L231 Difference]: Finished difference. Result has 219 places, 212 transitions, 493 flow [2025-01-09 21:02:52,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=219, PETRI_TRANSITIONS=212} [2025-01-09 21:02:52,490 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -39 predicate places. [2025-01-09 21:02:52,490 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 212 transitions, 493 flow [2025-01-09 21:02:52,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:52,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:52,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:52,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:02:52,491 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:52,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1334465389, now seen corresponding path program 1 times [2025-01-09 21:02:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:52,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786675423] [2025-01-09 21:02:52,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:52,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:52,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:02:52,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:02:52,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:52,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:52,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:52,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786675423] [2025-01-09 21:02:52,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786675423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:52,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:52,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:02:52,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718451052] [2025-01-09 21:02:52,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:52,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:02:52,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:52,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:02:52,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:02:52,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 271 [2025-01-09 21:02:52,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 212 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:52,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:52,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 271 [2025-01-09 21:02:52,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:02:54,466 INFO L124 PetriNetUnfolderBase]: 3752/18416 cut-off events. [2025-01-09 21:02:54,466 INFO L125 PetriNetUnfolderBase]: For 5164/27040 co-relation queries the response was YES. [2025-01-09 21:02:54,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26174 conditions, 18416 events. 3752/18416 cut-off events. For 5164/27040 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 217915 event pairs, 2730 based on Foata normal form. 2/15381 useless extension candidates. Maximal degree in co-relation 23379. Up to 5036 conditions per place. [2025-01-09 21:02:54,527 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 27 selfloop transitions, 0 changer transitions 1/211 dead transitions. [2025-01-09 21:02:54,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 211 transitions, 544 flow [2025-01-09 21:02:54,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:02:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:02:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-01-09 21:02:54,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437884378843789 [2025-01-09 21:02:54,530 INFO L175 Difference]: Start difference. First operand has 219 places, 212 transitions, 493 flow. Second operand 3 states and 686 transitions. [2025-01-09 21:02:54,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 211 transitions, 544 flow [2025-01-09 21:02:54,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 211 transitions, 536 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-09 21:02:54,535 INFO L231 Difference]: Finished difference. Result has 218 places, 210 transitions, 480 flow [2025-01-09 21:02:54,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=218, PETRI_TRANSITIONS=210} [2025-01-09 21:02:54,536 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -40 predicate places. [2025-01-09 21:02:54,536 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 210 transitions, 480 flow [2025-01-09 21:02:54,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:54,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:02:54,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:02:54,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:02:54,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:02:54,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:02:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1513398027, now seen corresponding path program 1 times [2025-01-09 21:02:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:02:54,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424987627] [2025-01-09 21:02:54,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:02:54,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:02:54,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:02:54,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:02:54,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:02:54,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:02:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:02:54,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:02:54,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424987627] [2025-01-09 21:02:54,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424987627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:02:54,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:02:54,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:02:54,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414808168] [2025-01-09 21:02:54,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:02:54,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:02:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:02:54,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:02:54,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:02:55,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 271 [2025-01-09 21:02:55,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 210 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 195.66666666666666) internal successors, (1174), 6 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:02:55,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:02:55,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 271 [2025-01-09 21:02:55,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:00,596 INFO L124 PetriNetUnfolderBase]: 21016/65744 cut-off events. [2025-01-09 21:03:00,597 INFO L125 PetriNetUnfolderBase]: For 3106/3248 co-relation queries the response was YES. [2025-01-09 21:03:00,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104271 conditions, 65744 events. 21016/65744 cut-off events. For 3106/3248 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 822801 event pairs, 9754 based on Foata normal form. 0/59495 useless extension candidates. Maximal degree in co-relation 104262. Up to 29941 conditions per place. [2025-01-09 21:03:00,914 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 64 selfloop transitions, 5 changer transitions 3/225 dead transitions. [2025-01-09 21:03:00,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 225 transitions, 650 flow [2025-01-09 21:03:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:03:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:03:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1235 transitions. [2025-01-09 21:03:00,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7595325953259533 [2025-01-09 21:03:00,917 INFO L175 Difference]: Start difference. First operand has 218 places, 210 transitions, 480 flow. Second operand 6 states and 1235 transitions. [2025-01-09 21:03:00,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 225 transitions, 650 flow [2025-01-09 21:03:00,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 225 transitions, 648 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 21:03:00,926 INFO L231 Difference]: Finished difference. Result has 220 places, 206 transitions, 480 flow [2025-01-09 21:03:00,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=220, PETRI_TRANSITIONS=206} [2025-01-09 21:03:00,927 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -38 predicate places. [2025-01-09 21:03:00,927 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 206 transitions, 480 flow [2025-01-09 21:03:00,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.66666666666666) internal successors, (1174), 6 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:00,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:00,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:00,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:03:00,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:03:00,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1497587866, now seen corresponding path program 1 times [2025-01-09 21:03:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722606463] [2025-01-09 21:03:00,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:00,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:00,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:03:00,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:03:00,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:00,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:00,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:00,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722606463] [2025-01-09 21:03:00,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722606463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:00,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:00,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:03:00,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297197536] [2025-01-09 21:03:00,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:00,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:03:00,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:00,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:03:00,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:03:01,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 271 [2025-01-09 21:03:01,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 206 transitions, 480 flow. Second operand has 4 states, 4 states have (on average 215.5) internal successors, (862), 4 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:01,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:01,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 271 [2025-01-09 21:03:01,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:03,559 INFO L124 PetriNetUnfolderBase]: 7222/26805 cut-off events. [2025-01-09 21:03:03,560 INFO L125 PetriNetUnfolderBase]: For 4027/8853 co-relation queries the response was YES. [2025-01-09 21:03:03,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40888 conditions, 26805 events. 7222/26805 cut-off events. For 4027/8853 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 315890 event pairs, 5043 based on Foata normal form. 137/23507 useless extension candidates. Maximal degree in co-relation 40879. Up to 5892 conditions per place. [2025-01-09 21:03:03,686 INFO L140 encePairwiseOnDemand]: 258/271 looper letters, 77 selfloop transitions, 11 changer transitions 0/259 dead transitions. [2025-01-09 21:03:03,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 259 transitions, 826 flow [2025-01-09 21:03:03,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:03:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:03:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 946 transitions. [2025-01-09 21:03:03,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8726937269372693 [2025-01-09 21:03:03,688 INFO L175 Difference]: Start difference. First operand has 220 places, 206 transitions, 480 flow. Second operand 4 states and 946 transitions. [2025-01-09 21:03:03,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 259 transitions, 826 flow [2025-01-09 21:03:03,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 259 transitions, 816 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:03:03,700 INFO L231 Difference]: Finished difference. Result has 217 places, 215 transitions, 552 flow [2025-01-09 21:03:03,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=552, PETRI_PLACES=217, PETRI_TRANSITIONS=215} [2025-01-09 21:03:03,701 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -41 predicate places. [2025-01-09 21:03:03,701 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 215 transitions, 552 flow [2025-01-09 21:03:03,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.5) internal successors, (862), 4 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:03,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:03,702 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:03,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:03:03,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:03:03,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:03,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1691719297, now seen corresponding path program 1 times [2025-01-09 21:03:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:03,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118600969] [2025-01-09 21:03:03,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:03,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:03:03,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:03:03,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:03,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:03,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:03,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118600969] [2025-01-09 21:03:03,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118600969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:03,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:03,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:03:03,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390071633] [2025-01-09 21:03:03,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:03,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:03:03,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:03,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:03:03,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:03:04,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 271 [2025-01-09 21:03:04,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 215 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:04,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:04,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 271 [2025-01-09 21:03:04,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:07,005 INFO L124 PetriNetUnfolderBase]: 7028/27245 cut-off events. [2025-01-09 21:03:07,005 INFO L125 PetriNetUnfolderBase]: For 7286/10179 co-relation queries the response was YES. [2025-01-09 21:03:07,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44175 conditions, 27245 events. 7028/27245 cut-off events. For 7286/10179 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 324224 event pairs, 4588 based on Foata normal form. 3/23823 useless extension candidates. Maximal degree in co-relation 44164. Up to 5944 conditions per place. [2025-01-09 21:03:07,113 INFO L140 encePairwiseOnDemand]: 257/271 looper letters, 88 selfloop transitions, 14 changer transitions 0/271 dead transitions. [2025-01-09 21:03:07,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 271 transitions, 948 flow [2025-01-09 21:03:07,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:03:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 21:03:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1587 transitions. [2025-01-09 21:03:07,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8365840801265155 [2025-01-09 21:03:07,116 INFO L175 Difference]: Start difference. First operand has 217 places, 215 transitions, 552 flow. Second operand 7 states and 1587 transitions. [2025-01-09 21:03:07,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 271 transitions, 948 flow [2025-01-09 21:03:07,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 271 transitions, 946 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:03:07,124 INFO L231 Difference]: Finished difference. Result has 225 places, 218 transitions, 607 flow [2025-01-09 21:03:07,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=607, PETRI_PLACES=225, PETRI_TRANSITIONS=218} [2025-01-09 21:03:07,125 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -33 predicate places. [2025-01-09 21:03:07,125 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 218 transitions, 607 flow [2025-01-09 21:03:07,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:07,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:07,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:07,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:03:07,125 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:03:07,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash -944876494, now seen corresponding path program 1 times [2025-01-09 21:03:07,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:07,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358416095] [2025-01-09 21:03:07,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:07,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:07,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 21:03:07,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 21:03:07,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:07,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:07,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:07,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358416095] [2025-01-09 21:03:07,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358416095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:07,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:07,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:03:07,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175659415] [2025-01-09 21:03:07,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:07,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:03:07,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:07,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:03:07,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:03:07,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 271 [2025-01-09 21:03:07,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 218 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:07,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:07,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 271 [2025-01-09 21:03:07,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:12,249 INFO L124 PetriNetUnfolderBase]: 21085/50115 cut-off events. [2025-01-09 21:03:12,249 INFO L125 PetriNetUnfolderBase]: For 8511/8515 co-relation queries the response was YES. [2025-01-09 21:03:12,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87702 conditions, 50115 events. 21085/50115 cut-off events. For 8511/8515 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 518014 event pairs, 9342 based on Foata normal form. 0/47062 useless extension candidates. Maximal degree in co-relation 87688. Up to 25899 conditions per place. [2025-01-09 21:03:12,506 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 90 selfloop transitions, 6 changer transitions 0/249 dead transitions. [2025-01-09 21:03:12,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 249 transitions, 861 flow [2025-01-09 21:03:12,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:03:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:03:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1251 transitions. [2025-01-09 21:03:12,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7693726937269373 [2025-01-09 21:03:12,509 INFO L175 Difference]: Start difference. First operand has 225 places, 218 transitions, 607 flow. Second operand 6 states and 1251 transitions. [2025-01-09 21:03:12,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 249 transitions, 861 flow [2025-01-09 21:03:12,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 249 transitions, 837 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-09 21:03:12,527 INFO L231 Difference]: Finished difference. Result has 226 places, 217 transitions, 593 flow [2025-01-09 21:03:12,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=226, PETRI_TRANSITIONS=217} [2025-01-09 21:03:12,528 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -32 predicate places. [2025-01-09 21:03:12,528 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 217 transitions, 593 flow [2025-01-09 21:03:12,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:12,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:12,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:12,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:03:12,529 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr0ASSERT_VIOLATIONDATA_RACE, setThreadErr1ASSERT_VIOLATIONDATA_RACE, checkThreadErr0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-01-09 21:03:12,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:12,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1340697146, now seen corresponding path program 1 times [2025-01-09 21:03:12,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:12,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754097654] [2025-01-09 21:03:12,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:12,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:12,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:03:12,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:03:12,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:12,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:12,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:12,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754097654] [2025-01-09 21:03:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754097654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:12,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:03:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283639892] [2025-01-09 21:03:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:12,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:03:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:12,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:03:12,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:03:12,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 271 [2025-01-09 21:03:12,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 217 transitions, 593 flow. Second operand has 5 states, 5 states have (on average 213.8) internal successors, (1069), 5 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:03:12,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:12,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 271 [2025-01-09 21:03:12,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand