./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 735b3cc8
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-735b3cc-m
[2025-03-14 01:42:18,573 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-14 01:42:18,615 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2025-03-14 01:42:18,619 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-14 01:42:18,619 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-14 01:42:18,637 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-14 01:42:18,637 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-14 01:42:18,637 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-14 01:42:18,638 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-14 01:42:18,638 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-14 01:42:18,638 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-14 01:42:18,638 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-14 01:42:18,638 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-14 01:42:18,638 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-14 01:42:18,638 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-14 01:42:18,638 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-14 01:42:18,638 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-14 01:42:18,639 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-14 01:42:18,640 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-14 01:42:18,640 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-14 01:42:18,640 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-14 01:42:18,640 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-14 01:42:18,640 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-03-14 01:42:18,640 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-03-14 01:42:18,640 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-14 01:42:18,641 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-14 01:42:18,641 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-14 01:42:18,641 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-14 01:42:18,641 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-14 01:42:18,641 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-14 01:42:18,641 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-14 01:42:18,641 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-14 01:42:18,641 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-14 01:42:18,642 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-14 01:42:18,642 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-14 01:42:18,642 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-14 01:42:18,642 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-14 01:42:18,642 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-14 01:42:18,642 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-14 01:42:18,642 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-14 01:42:18,642 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-14 01:42:18,642 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-14 01:42:18,642 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a
[2025-03-14 01:42:18,886 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-14 01:42:18,895 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-14 01:42:18,897 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-14 01:42:18,898 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-14 01:42:18,898 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-14 01:42:18,900 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c
[2025-03-14 01:42:20,028 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb54818a1/b781902721b34128b0b15d8278d15815/FLAGba4492fa4
[2025-03-14 01:42:20,287 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-14 01:42:20,287 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c
[2025-03-14 01:42:20,298 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb54818a1/b781902721b34128b0b15d8278d15815/FLAGba4492fa4
[2025-03-14 01:42:20,594 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb54818a1/b781902721b34128b0b15d8278d15815
[2025-03-14 01:42:20,596 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-14 01:42:20,598 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-14 01:42:20,600 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-14 01:42:20,601 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-14 01:42:20,604 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-14 01:42:20,605 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,605 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ed2682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20, skipping insertion in model container
[2025-03-14 01:42:20,605 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,617 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-14 01:42:20,783 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-14 01:42:20,792 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-14 01:42:20,828 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-14 01:42:20,844 INFO  L204         MainTranslator]: Completed translation
[2025-03-14 01:42:20,846 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20 WrapperNode
[2025-03-14 01:42:20,847 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-14 01:42:20,848 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-14 01:42:20,848 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-14 01:42:20,848 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-14 01:42:20,853 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,862 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,893 INFO  L138                Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 269
[2025-03-14 01:42:20,893 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-14 01:42:20,894 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-14 01:42:20,897 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-14 01:42:20,898 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-14 01:42:20,904 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,905 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,913 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,913 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,935 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,940 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,941 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,942 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,945 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-14 01:42:20,945 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-14 01:42:20,946 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-14 01:42:20,946 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-14 01:42:20,946 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20" (1/1) ...
[2025-03-14 01:42:20,950 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-14 01:42:20,961 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-14 01:42:20,975 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-14 01:42:20,980 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-14 01:42:20,997 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-14 01:42:20,998 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2025-03-14 01:42:20,998 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2025-03-14 01:42:20,998 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2025-03-14 01:42:20,998 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2025-03-14 01:42:20,998 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-03-14 01:42:20,998 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-03-14 01:42:20,998 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-03-14 01:42:20,999 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-14 01:42:20,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-14 01:42:20,999 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-03-14 01:42:21,000 WARN  L225             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-03-14 01:42:21,078 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-14 01:42:21,080 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-14 01:42:21,531 INFO  L303             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-03-14 01:42:21,532 INFO  L313             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-14 01:42:21,532 INFO  L318             CfgBuilder]: Performing block encoding
[2025-03-14 01:42:21,552 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-14 01:42:21,554 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:21 BoogieIcfgContainer
[2025-03-14 01:42:21,554 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-14 01:42:21,556 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-14 01:42:21,556 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-14 01:42:21,560 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-14 01:42:21,560 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:42:20" (1/3) ...
[2025-03-14 01:42:21,561 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fcb1c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:21, skipping insertion in model container
[2025-03-14 01:42:21,561 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:20" (2/3) ...
[2025-03-14 01:42:21,561 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fcb1c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:21, skipping insertion in model container
[2025-03-14 01:42:21,561 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:21" (3/3) ...
[2025-03-14 01:42:21,562 INFO  L128   eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c
[2025-03-14 01:42:21,574 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-14 01:42:21,576 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 328 locations, 1 initial locations, 4 loop locations, and 30 error locations.
[2025-03-14 01:42:21,576 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-03-14 01:42:21,681 INFO  L143    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2025-03-14 01:42:21,714 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 334 places, 344 transitions, 702 flow
[2025-03-14 01:42:21,817 INFO  L124   PetriNetUnfolderBase]: 17/342 cut-off events.
[2025-03-14 01:42:21,820 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2025-03-14 01:42:21,829 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 351 conditions, 342 events. 17/342 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 683 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 234. Up to 3 conditions per place. 
[2025-03-14 01:42:21,829 INFO  L82        GeneralOperation]: Start removeDead. Operand has 334 places, 344 transitions, 702 flow
[2025-03-14 01:42:21,836 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 316 places, 325 transitions, 662 flow
[2025-03-14 01:42:21,841 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-14 01:42:21,852 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;@77422545, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-14 01:42:21,852 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 54 error locations.
[2025-03-14 01:42:21,862 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-14 01:42:21,862 INFO  L124   PetriNetUnfolderBase]: 2/59 cut-off events.
[2025-03-14 01:42:21,862 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-14 01:42:21,862 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:21,863 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-03-14 01:42:21,863 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:21,868 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:21,868 INFO  L85        PathProgramCache]: Analyzing trace with hash -1862329975, now seen corresponding path program 1 times
[2025-03-14 01:42:21,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:21,875 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220147900]
[2025-03-14 01:42:21,875 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:21,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:21,946 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes.
[2025-03-14 01:42:21,981 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements.
[2025-03-14 01:42:21,983 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:21,983 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:22,703 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-14 01:42:22,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:22,704 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220147900]
[2025-03-14 01:42:22,704 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220147900] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:22,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:22,705 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:42:22,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337939739]
[2025-03-14 01:42:22,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:22,711 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:42:22,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:22,730 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:42:22,731 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:42:23,055 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 270 out of 344
[2025-03-14 01:42:23,062 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 325 transitions, 662 flow. Second operand  has 6 states, 6 states have (on average 271.5) internal successors, (1629), 6 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:23,062 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:23,062 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 344
[2025-03-14 01:42:23,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:23,427 INFO  L124   PetriNetUnfolderBase]: 424/2283 cut-off events.
[2025-03-14 01:42:23,427 INFO  L125   PetriNetUnfolderBase]: For 157/158 co-relation queries the response was YES.
[2025-03-14 01:42:23,432 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3088 conditions, 2283 events. 424/2283 cut-off events. For 157/158 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 16201 event pairs, 288 based on Foata normal form. 98/1985 useless extension candidates. Maximal degree in co-relation 2685. Up to 709 conditions per place. 
[2025-03-14 01:42:23,441 INFO  L140   encePairwiseOnDemand]: 324/344 looper letters, 52 selfloop transitions, 10 changer transitions 4/315 dead transitions.
[2025-03-14 01:42:23,441 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 315 transitions, 766 flow
[2025-03-14 01:42:23,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:42:23,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:42:23,457 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1692 transitions.
[2025-03-14 01:42:23,462 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.8197674418604651
[2025-03-14 01:42:23,464 INFO  L175             Difference]: Start difference. First operand has 316 places, 325 transitions, 662 flow. Second operand 6 states and 1692 transitions.
[2025-03-14 01:42:23,464 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 315 transitions, 766 flow
[2025-03-14 01:42:23,468 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 315 transitions, 758 flow, removed 0 selfloop flow, removed 4 redundant places.
[2025-03-14 01:42:23,474 INFO  L231             Difference]: Finished difference. Result has 315 places, 311 transitions, 646 flow
[2025-03-14 01:42:23,476 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=646, PETRI_PLACES=315, PETRI_TRANSITIONS=311}
[2025-03-14 01:42:23,480 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, -1 predicate places.
[2025-03-14 01:42:23,480 INFO  L471      AbstractCegarLoop]: Abstraction has has 315 places, 311 transitions, 646 flow
[2025-03-14 01:42:23,481 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 271.5) internal successors, (1629), 6 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:23,481 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:23,481 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-03-14 01:42:23,482 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-14 01:42:23,482 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:23,482 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:23,482 INFO  L85        PathProgramCache]: Analyzing trace with hash 1374464241, now seen corresponding path program 1 times
[2025-03-14 01:42:23,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:23,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180650568]
[2025-03-14 01:42:23,484 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:23,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:23,493 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes.
[2025-03-14 01:42:23,501 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements.
[2025-03-14 01:42:23,503 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:23,503 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:23,530 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-14 01:42:23,530 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:23,531 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180650568]
[2025-03-14 01:42:23,531 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180650568] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:23,531 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:23,531 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:42:23,531 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198588428]
[2025-03-14 01:42:23,531 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:23,532 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:42:23,533 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:23,533 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:42:23,533 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:42:23,558 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 319 out of 344
[2025-03-14 01:42:23,559 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 311 transitions, 646 flow. Second operand  has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:23,559 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:23,559 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 344
[2025-03-14 01:42:23,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:23,610 INFO  L124   PetriNetUnfolderBase]: 22/488 cut-off events.
[2025-03-14 01:42:23,610 INFO  L125   PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES.
[2025-03-14 01:42:23,612 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 534 conditions, 488 events. 22/488 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1550 event pairs, 8 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 501. Up to 28 conditions per place. 
[2025-03-14 01:42:23,614 INFO  L140   encePairwiseOnDemand]: 341/344 looper letters, 11 selfloop transitions, 2 changer transitions 0/310 dead transitions.
[2025-03-14 01:42:23,614 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 670 flow
[2025-03-14 01:42:23,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:42:23,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:42:23,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions.
[2025-03-14 01:42:23,617 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9408914728682171
[2025-03-14 01:42:23,617 INFO  L175             Difference]: Start difference. First operand has 315 places, 311 transitions, 646 flow. Second operand 3 states and 971 transitions.
[2025-03-14 01:42:23,617 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 670 flow
[2025-03-14 01:42:23,619 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 310 transitions, 650 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-03-14 01:42:23,623 INFO  L231             Difference]: Finished difference. Result has 307 places, 310 transitions, 628 flow
[2025-03-14 01:42:23,623 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=307, PETRI_TRANSITIONS=310}
[2025-03-14 01:42:23,624 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, -9 predicate places.
[2025-03-14 01:42:23,624 INFO  L471      AbstractCegarLoop]: Abstraction has has 307 places, 310 transitions, 628 flow
[2025-03-14 01:42:23,625 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:23,625 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:23,625 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, 1, 1, 1, 1]
[2025-03-14 01:42:23,625 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-14 01:42:23,625 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:23,626 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:23,626 INFO  L85        PathProgramCache]: Analyzing trace with hash -972732439, now seen corresponding path program 1 times
[2025-03-14 01:42:23,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:23,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537024395]
[2025-03-14 01:42:23,626 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:23,627 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:23,634 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes.
[2025-03-14 01:42:23,638 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements.
[2025-03-14 01:42:23,638 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:23,638 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:23,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-14 01:42:23,667 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:23,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537024395]
[2025-03-14 01:42:23,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537024395] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:23,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:23,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:42:23,668 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194423756]
[2025-03-14 01:42:23,668 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:23,668 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:42:23,668 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:23,669 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:42:23,669 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:42:23,693 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 319 out of 344
[2025-03-14 01:42:23,694 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 310 transitions, 628 flow. Second operand  has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:23,694 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:23,694 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 344
[2025-03-14 01:42:23,694 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:23,743 INFO  L124   PetriNetUnfolderBase]: 22/487 cut-off events.
[2025-03-14 01:42:23,744 INFO  L125   PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES.
[2025-03-14 01:42:23,745 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 525 conditions, 487 events. 22/487 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1450 event pairs, 8 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 456. Up to 28 conditions per place. 
[2025-03-14 01:42:23,747 INFO  L140   encePairwiseOnDemand]: 341/344 looper letters, 11 selfloop transitions, 2 changer transitions 0/309 dead transitions.
[2025-03-14 01:42:23,747 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 652 flow
[2025-03-14 01:42:23,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:42:23,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:42:23,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions.
[2025-03-14 01:42:23,773 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9408914728682171
[2025-03-14 01:42:23,773 INFO  L175             Difference]: Start difference. First operand has 307 places, 310 transitions, 628 flow. Second operand 3 states and 971 transitions.
[2025-03-14 01:42:23,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 652 flow
[2025-03-14 01:42:23,775 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 309 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-14 01:42:23,777 INFO  L231             Difference]: Finished difference. Result has 306 places, 309 transitions, 626 flow
[2025-03-14 01:42:23,778 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=306, PETRI_TRANSITIONS=309}
[2025-03-14 01:42:23,779 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, -10 predicate places.
[2025-03-14 01:42:23,779 INFO  L471      AbstractCegarLoop]: Abstraction has has 306 places, 309 transitions, 626 flow
[2025-03-14 01:42:23,779 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:23,779 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:23,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:23,780 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-14 01:42:23,780 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:23,780 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:23,781 INFO  L85        PathProgramCache]: Analyzing trace with hash 357247666, now seen corresponding path program 1 times
[2025-03-14 01:42:23,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:23,781 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194265319]
[2025-03-14 01:42:23,781 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:23,781 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:23,788 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-03-14 01:42:23,792 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-03-14 01:42:23,793 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:23,793 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:23,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-14 01:42:23,825 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:23,825 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194265319]
[2025-03-14 01:42:23,825 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194265319] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:23,825 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:23,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:42:23,826 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079369381]
[2025-03-14 01:42:23,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:23,826 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:42:23,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:23,826 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:42:23,827 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:42:23,842 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 321 out of 344
[2025-03-14 01:42:23,843 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 309 transitions, 626 flow. Second operand  has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:23,843 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:23,843 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 344
[2025-03-14 01:42:23,843 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:23,887 INFO  L124   PetriNetUnfolderBase]: 17/468 cut-off events.
[2025-03-14 01:42:23,887 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2025-03-14 01:42:23,889 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 493 conditions, 468 events. 17/468 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1444 event pairs, 3 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 377. Up to 16 conditions per place. 
[2025-03-14 01:42:23,891 INFO  L140   encePairwiseOnDemand]: 341/344 looper letters, 9 selfloop transitions, 2 changer transitions 0/308 dead transitions.
[2025-03-14 01:42:23,891 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 308 transitions, 646 flow
[2025-03-14 01:42:23,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:42:23,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:42:23,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions.
[2025-03-14 01:42:23,893 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9447674418604651
[2025-03-14 01:42:23,893 INFO  L175             Difference]: Start difference. First operand has 306 places, 309 transitions, 626 flow. Second operand 3 states and 975 transitions.
[2025-03-14 01:42:23,893 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 308 transitions, 646 flow
[2025-03-14 01:42:23,895 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 308 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-14 01:42:23,897 INFO  L231             Difference]: Finished difference. Result has 305 places, 308 transitions, 624 flow
[2025-03-14 01:42:23,898 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=305, PETRI_TRANSITIONS=308}
[2025-03-14 01:42:23,898 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, -11 predicate places.
[2025-03-14 01:42:23,898 INFO  L471      AbstractCegarLoop]: Abstraction has has 305 places, 308 transitions, 624 flow
[2025-03-14 01:42:23,899 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:23,899 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:23,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:23,899 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-14 01:42:23,899 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:23,900 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:23,900 INFO  L85        PathProgramCache]: Analyzing trace with hash 1707045123, now seen corresponding path program 1 times
[2025-03-14 01:42:23,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:23,900 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009599622]
[2025-03-14 01:42:23,900 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:23,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:23,909 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-03-14 01:42:23,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-03-14 01:42:23,917 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:23,917 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:23,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-14 01:42:23,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:23,951 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009599622]
[2025-03-14 01:42:23,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009599622] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:23,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:23,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:42:23,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546492763]
[2025-03-14 01:42:23,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:23,951 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:42:23,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:23,952 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:42:23,952 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:42:23,964 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 321 out of 344
[2025-03-14 01:42:23,965 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 308 transitions, 624 flow. Second operand  has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:23,965 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:23,965 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 344
[2025-03-14 01:42:23,965 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:23,997 INFO  L124   PetriNetUnfolderBase]: 14/395 cut-off events.
[2025-03-14 01:42:23,997 INFO  L125   PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES.
[2025-03-14 01:42:23,998 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 420 conditions, 395 events. 14/395 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 970 event pairs, 3 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 296. Up to 16 conditions per place. 
[2025-03-14 01:42:24,000 INFO  L140   encePairwiseOnDemand]: 341/344 looper letters, 9 selfloop transitions, 2 changer transitions 0/307 dead transitions.
[2025-03-14 01:42:24,000 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 307 transitions, 644 flow
[2025-03-14 01:42:24,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:42:24,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:42:24,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions.
[2025-03-14 01:42:24,002 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9447674418604651
[2025-03-14 01:42:24,002 INFO  L175             Difference]: Start difference. First operand has 305 places, 308 transitions, 624 flow. Second operand 3 states and 975 transitions.
[2025-03-14 01:42:24,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 307 transitions, 644 flow
[2025-03-14 01:42:24,003 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 307 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-14 01:42:24,005 INFO  L231             Difference]: Finished difference. Result has 304 places, 307 transitions, 622 flow
[2025-03-14 01:42:24,006 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=304, PETRI_TRANSITIONS=307}
[2025-03-14 01:42:24,006 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, -12 predicate places.
[2025-03-14 01:42:24,006 INFO  L471      AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 622 flow
[2025-03-14 01:42:24,007 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:24,007 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:24,007 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:24,007 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-14 01:42:24,007 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:24,008 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:24,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 501837218, now seen corresponding path program 1 times
[2025-03-14 01:42:24,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:24,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713855756]
[2025-03-14 01:42:24,008 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:24,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:24,015 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-14 01:42:24,020 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-14 01:42:24,020 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:24,020 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:24,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-14 01:42:24,051 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:24,051 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713855756]
[2025-03-14 01:42:24,051 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713855756] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:24,051 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:24,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:42:24,051 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231688602]
[2025-03-14 01:42:24,051 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:24,052 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:42:24,052 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:24,052 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:42:24,052 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:42:24,063 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 323 out of 344
[2025-03-14 01:42:24,064 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 622 flow. Second operand  has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:24,064 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:24,064 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 344
[2025-03-14 01:42:24,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:24,138 INFO  L124   PetriNetUnfolderBase]: 31/684 cut-off events.
[2025-03-14 01:42:24,139 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2025-03-14 01:42:24,141 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 721 conditions, 684 events. 31/684 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2985 event pairs, 5 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 589. Up to 25 conditions per place. 
[2025-03-14 01:42:24,143 INFO  L140   encePairwiseOnDemand]: 340/344 looper letters, 10 selfloop transitions, 2 changer transitions 0/308 dead transitions.
[2025-03-14 01:42:24,143 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 308 transitions, 649 flow
[2025-03-14 01:42:24,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:42:24,144 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:42:24,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions.
[2025-03-14 01:42:24,146 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9525193798449613
[2025-03-14 01:42:24,146 INFO  L175             Difference]: Start difference. First operand has 304 places, 307 transitions, 622 flow. Second operand 3 states and 983 transitions.
[2025-03-14 01:42:24,146 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 308 transitions, 649 flow
[2025-03-14 01:42:24,148 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 308 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-14 01:42:24,153 INFO  L231             Difference]: Finished difference. Result has 303 places, 307 transitions, 628 flow
[2025-03-14 01:42:24,154 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=303, PETRI_TRANSITIONS=307}
[2025-03-14 01:42:24,154 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, -13 predicate places.
[2025-03-14 01:42:24,154 INFO  L471      AbstractCegarLoop]: Abstraction has has 303 places, 307 transitions, 628 flow
[2025-03-14 01:42:24,155 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:24,155 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:24,155 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-14 01:42:24,155 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:24,156 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:24,157 INFO  L85        PathProgramCache]: Analyzing trace with hash 1738497346, now seen corresponding path program 1 times
[2025-03-14 01:42:24,157 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:24,157 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037235284]
[2025-03-14 01:42:24,157 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:24,157 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:24,170 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-03-14 01:42:24,175 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-03-14 01:42:24,175 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:24,176 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:24,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-14 01:42:24,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:24,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037235284]
[2025-03-14 01:42:24,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037235284] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:24,200 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:24,200 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:42:24,200 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425563265]
[2025-03-14 01:42:24,200 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:24,201 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:42:24,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:24,201 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:42:24,202 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:42:24,210 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 323 out of 344
[2025-03-14 01:42:24,212 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 307 transitions, 628 flow. Second operand  has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:24,212 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:24,212 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 344
[2025-03-14 01:42:24,212 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:24,277 INFO  L124   PetriNetUnfolderBase]: 32/662 cut-off events.
[2025-03-14 01:42:24,277 INFO  L125   PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES.
[2025-03-14 01:42:24,279 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 707 conditions, 662 events. 32/662 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3069 event pairs, 3 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 492. Up to 26 conditions per place. 
[2025-03-14 01:42:24,281 INFO  L140   encePairwiseOnDemand]: 340/344 looper letters, 10 selfloop transitions, 2 changer transitions 0/308 dead transitions.
[2025-03-14 01:42:24,281 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 308 transitions, 655 flow
[2025-03-14 01:42:24,281 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:42:24,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:42:24,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions.
[2025-03-14 01:42:24,283 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9525193798449613
[2025-03-14 01:42:24,283 INFO  L175             Difference]: Start difference. First operand has 303 places, 307 transitions, 628 flow. Second operand 3 states and 983 transitions.
[2025-03-14 01:42:24,283 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 308 transitions, 655 flow
[2025-03-14 01:42:24,285 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 308 transitions, 655 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-14 01:42:24,288 INFO  L231             Difference]: Finished difference. Result has 304 places, 307 transitions, 638 flow
[2025-03-14 01:42:24,288 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=304, PETRI_TRANSITIONS=307}
[2025-03-14 01:42:24,289 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, -12 predicate places.
[2025-03-14 01:42:24,289 INFO  L471      AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 638 flow
[2025-03-14 01:42:24,289 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:24,289 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:24,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:24,290 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-14 01:42:24,290 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:24,290 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:24,291 INFO  L85        PathProgramCache]: Analyzing trace with hash -1414838691, now seen corresponding path program 1 times
[2025-03-14 01:42:24,291 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:24,291 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971388880]
[2025-03-14 01:42:24,291 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:24,291 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:24,301 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-03-14 01:42:24,310 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-03-14 01:42:24,310 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:24,310 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:24,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-14 01:42:24,340 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:24,340 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971388880]
[2025-03-14 01:42:24,340 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971388880] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:24,340 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:24,340 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:42:24,340 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240854793]
[2025-03-14 01:42:24,340 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:24,341 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:42:24,341 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:24,341 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:42:24,341 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:42:24,355 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 317 out of 344
[2025-03-14 01:42:24,357 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 638 flow. Second operand  has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:24,357 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:24,357 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 344
[2025-03-14 01:42:24,357 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:24,443 INFO  L124   PetriNetUnfolderBase]: 80/1050 cut-off events.
[2025-03-14 01:42:24,443 INFO  L125   PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES.
[2025-03-14 01:42:24,446 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 1050 events. 80/1050 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5562 event pairs, 12 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 950. Up to 94 conditions per place. 
[2025-03-14 01:42:24,450 INFO  L140   encePairwiseOnDemand]: 338/344 looper letters, 16 selfloop transitions, 2 changer transitions 0/308 dead transitions.
[2025-03-14 01:42:24,450 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 308 transitions, 679 flow
[2025-03-14 01:42:24,451 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:42:24,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:42:24,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions.
[2025-03-14 01:42:24,456 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9428294573643411
[2025-03-14 01:42:24,456 INFO  L175             Difference]: Start difference. First operand has 304 places, 307 transitions, 638 flow. Second operand 3 states and 973 transitions.
[2025-03-14 01:42:24,456 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 308 transitions, 679 flow
[2025-03-14 01:42:24,459 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 308 transitions, 679 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-14 01:42:24,464 INFO  L231             Difference]: Finished difference. Result has 303 places, 305 transitions, 644 flow
[2025-03-14 01:42:24,465 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=303, PETRI_TRANSITIONS=305}
[2025-03-14 01:42:24,466 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, -13 predicate places.
[2025-03-14 01:42:24,466 INFO  L471      AbstractCegarLoop]: Abstraction has has 303 places, 305 transitions, 644 flow
[2025-03-14 01:42:24,466 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:24,467 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:24,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:24,467 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-14 01:42:24,467 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:24,469 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:24,469 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248365360, now seen corresponding path program 1 times
[2025-03-14 01:42:24,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:24,470 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830882844]
[2025-03-14 01:42:24,470 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:24,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:24,483 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-03-14 01:42:24,490 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-03-14 01:42:24,490 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:24,490 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:24,530 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-14 01:42:24,530 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:24,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830882844]
[2025-03-14 01:42:24,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830882844] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:24,530 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:24,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:42:24,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162318997]
[2025-03-14 01:42:24,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:24,530 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:42:24,531 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:24,531 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:42:24,531 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:42:24,543 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 317 out of 344
[2025-03-14 01:42:24,544 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 305 transitions, 644 flow. Second operand  has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:24,544 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:24,544 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 344
[2025-03-14 01:42:24,544 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:24,622 INFO  L124   PetriNetUnfolderBase]: 87/1086 cut-off events.
[2025-03-14 01:42:24,622 INFO  L125   PetriNetUnfolderBase]: For 17/22 co-relation queries the response was YES.
[2025-03-14 01:42:24,625 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 1086 events. 87/1086 cut-off events. For 17/22 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6019 event pairs, 13 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1016. Up to 100 conditions per place. 
[2025-03-14 01:42:24,628 INFO  L140   encePairwiseOnDemand]: 338/344 looper letters, 16 selfloop transitions, 2 changer transitions 0/306 dead transitions.
[2025-03-14 01:42:24,628 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 306 transitions, 685 flow
[2025-03-14 01:42:24,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:42:24,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:42:24,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions.
[2025-03-14 01:42:24,630 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9428294573643411
[2025-03-14 01:42:24,630 INFO  L175             Difference]: Start difference. First operand has 303 places, 305 transitions, 644 flow. Second operand 3 states and 973 transitions.
[2025-03-14 01:42:24,630 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 306 transitions, 685 flow
[2025-03-14 01:42:24,631 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 306 transitions, 685 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-14 01:42:24,633 INFO  L231             Difference]: Finished difference. Result has 302 places, 303 transitions, 650 flow
[2025-03-14 01:42:24,634 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=302, PETRI_TRANSITIONS=303}
[2025-03-14 01:42:24,634 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, -14 predicate places.
[2025-03-14 01:42:24,634 INFO  L471      AbstractCegarLoop]: Abstraction has has 302 places, 303 transitions, 650 flow
[2025-03-14 01:42:24,635 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:24,635 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:24,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:24,635 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-14 01:42:24,635 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:24,635 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:24,635 INFO  L85        PathProgramCache]: Analyzing trace with hash -572168096, now seen corresponding path program 1 times
[2025-03-14 01:42:24,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:24,635 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648633864]
[2025-03-14 01:42:24,636 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:24,636 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:24,643 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-03-14 01:42:24,648 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-03-14 01:42:24,648 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:24,648 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:24,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-14 01:42:24,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:24,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648633864]
[2025-03-14 01:42:24,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648633864] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:24,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:24,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:42:24,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597254158]
[2025-03-14 01:42:24,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:24,708 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-14 01:42:24,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:24,708 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-14 01:42:24,708 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-14 01:42:24,807 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 312 out of 344
[2025-03-14 01:42:24,808 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 303 transitions, 650 flow. Second operand  has 5 states, 5 states have (on average 315.4) internal successors, (1577), 5 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:24,808 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:24,808 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 344
[2025-03-14 01:42:24,808 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:24,889 INFO  L124   PetriNetUnfolderBase]: 31/653 cut-off events.
[2025-03-14 01:42:24,889 INFO  L125   PetriNetUnfolderBase]: For 6/9 co-relation queries the response was YES.
[2025-03-14 01:42:24,891 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 746 conditions, 653 events. 31/653 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2625 event pairs, 0 based on Foata normal form. 2/594 useless extension candidates. Maximal degree in co-relation 524. Up to 14 conditions per place. 
[2025-03-14 01:42:24,892 INFO  L140   encePairwiseOnDemand]: 330/344 looper letters, 12 selfloop transitions, 12 changer transitions 0/305 dead transitions.
[2025-03-14 01:42:24,892 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 305 transitions, 702 flow
[2025-03-14 01:42:24,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-14 01:42:24,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2025-03-14 01:42:24,895 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1586 transitions.
[2025-03-14 01:42:24,896 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.922093023255814
[2025-03-14 01:42:24,896 INFO  L175             Difference]: Start difference. First operand has 302 places, 303 transitions, 650 flow. Second operand 5 states and 1586 transitions.
[2025-03-14 01:42:24,896 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 305 transitions, 702 flow
[2025-03-14 01:42:24,897 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 305 transitions, 702 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-14 01:42:24,900 INFO  L231             Difference]: Finished difference. Result has 307 places, 305 transitions, 690 flow
[2025-03-14 01:42:24,900 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=690, PETRI_PLACES=307, PETRI_TRANSITIONS=305}
[2025-03-14 01:42:24,901 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, -9 predicate places.
[2025-03-14 01:42:24,901 INFO  L471      AbstractCegarLoop]: Abstraction has has 307 places, 305 transitions, 690 flow
[2025-03-14 01:42:24,902 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 315.4) internal successors, (1577), 5 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:24,902 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:24,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:24,902 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-14 01:42:24,903 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:24,903 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:24,903 INFO  L85        PathProgramCache]: Analyzing trace with hash -615326646, now seen corresponding path program 1 times
[2025-03-14 01:42:24,903 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:24,903 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045377823]
[2025-03-14 01:42:24,903 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:24,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:24,918 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes.
[2025-03-14 01:42:24,930 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements.
[2025-03-14 01:42:24,930 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:24,930 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:25,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-14 01:42:25,062 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:25,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045377823]
[2025-03-14 01:42:25,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045377823] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-14 01:42:25,062 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018948287]
[2025-03-14 01:42:25,062 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:25,062 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-14 01:42:25,062 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-14 01:42:25,067 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-14 01:42:25,068 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-14 01:42:25,134 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes.
[2025-03-14 01:42:25,169 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements.
[2025-03-14 01:42:25,170 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:25,170 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:25,178 INFO  L256         TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-14 01:42:25,187 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-14 01:42:25,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-14 01:42:25,337 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-14 01:42:25,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-03-14 01:42:25,434 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018948287] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-14 01:42:25,434 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-14 01:42:25,434 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15
[2025-03-14 01:42:25,434 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91371718]
[2025-03-14 01:42:25,434 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-14 01:42:25,435 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-03-14 01:42:25,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:25,435 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-03-14 01:42:25,435 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210
[2025-03-14 01:42:25,766 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344
[2025-03-14 01:42:25,771 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 305 transitions, 690 flow. Second operand  has 15 states, 15 states have (on average 308.6666666666667) internal successors, (4630), 15 states have internal predecessors, (4630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:25,771 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:25,771 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344
[2025-03-14 01:42:25,771 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:25,994 INFO  L124   PetriNetUnfolderBase]: 31/687 cut-off events.
[2025-03-14 01:42:25,994 INFO  L125   PetriNetUnfolderBase]: For 16/19 co-relation queries the response was YES.
[2025-03-14 01:42:25,996 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 824 conditions, 687 events. 31/687 cut-off events. For 16/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2575 event pairs, 0 based on Foata normal form. 4/630 useless extension candidates. Maximal degree in co-relation 598. Up to 14 conditions per place. 
[2025-03-14 01:42:25,997 INFO  L140   encePairwiseOnDemand]: 324/344 looper letters, 20 selfloop transitions, 26 changer transitions 0/321 dead transitions.
[2025-03-14 01:42:25,997 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 321 transitions, 818 flow
[2025-03-14 01:42:25,998 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-14 01:42:25,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2025-03-14 01:42:26,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3416 transitions.
[2025-03-14 01:42:26,004 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9027484143763214
[2025-03-14 01:42:26,004 INFO  L175             Difference]: Start difference. First operand has 307 places, 305 transitions, 690 flow. Second operand 11 states and 3416 transitions.
[2025-03-14 01:42:26,004 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 321 transitions, 818 flow
[2025-03-14 01:42:26,007 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 321 transitions, 798 flow, removed 0 selfloop flow, removed 3 redundant places.
[2025-03-14 01:42:26,010 INFO  L231             Difference]: Finished difference. Result has 317 places, 317 transitions, 790 flow
[2025-03-14 01:42:26,010 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=790, PETRI_PLACES=317, PETRI_TRANSITIONS=317}
[2025-03-14 01:42:26,011 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places.
[2025-03-14 01:42:26,011 INFO  L471      AbstractCegarLoop]: Abstraction has has 317 places, 317 transitions, 790 flow
[2025-03-14 01:42:26,013 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 308.6666666666667) internal successors, (4630), 15 states have internal predecessors, (4630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:26,013 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:26,013 INFO  L206   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:26,022 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-14 01:42:26,218 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2025-03-14 01:42:26,218 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:26,219 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:26,219 INFO  L85        PathProgramCache]: Analyzing trace with hash -770481014, now seen corresponding path program 2 times
[2025-03-14 01:42:26,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:26,219 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372735522]
[2025-03-14 01:42:26,219 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-14 01:42:26,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:26,237 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 2 equivalence classes.
[2025-03-14 01:42:26,243 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 122 of 212 statements.
[2025-03-14 01:42:26,243 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-03-14 01:42:26,243 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:26,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2025-03-14 01:42:26,525 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:26,525 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372735522]
[2025-03-14 01:42:26,525 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372735522] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:26,525 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:26,525 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:42:26,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35685399]
[2025-03-14 01:42:26,525 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:26,526 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:42:26,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:26,526 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:42:26,526 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:42:26,880 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344
[2025-03-14 01:42:26,882 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 317 transitions, 790 flow. Second operand  has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:26,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:26,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344
[2025-03-14 01:42:26,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:26,996 INFO  L124   PetriNetUnfolderBase]: 48/801 cut-off events.
[2025-03-14 01:42:26,996 INFO  L125   PetriNetUnfolderBase]: For 21/22 co-relation queries the response was YES.
[2025-03-14 01:42:26,999 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 801 events. 48/801 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3578 event pairs, 2 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 821. Up to 48 conditions per place. 
[2025-03-14 01:42:27,001 INFO  L140   encePairwiseOnDemand]: 337/344 looper letters, 27 selfloop transitions, 5 changer transitions 0/321 dead transitions.
[2025-03-14 01:42:27,001 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 321 transitions, 868 flow
[2025-03-14 01:42:27,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:42:27,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:42:27,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1870 transitions.
[2025-03-14 01:42:27,005 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9060077519379846
[2025-03-14 01:42:27,005 INFO  L175             Difference]: Start difference. First operand has 317 places, 317 transitions, 790 flow. Second operand 6 states and 1870 transitions.
[2025-03-14 01:42:27,005 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 321 transitions, 868 flow
[2025-03-14 01:42:27,008 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 844 flow, removed 4 selfloop flow, removed 3 redundant places.
[2025-03-14 01:42:27,011 INFO  L231             Difference]: Finished difference. Result has 317 places, 315 transitions, 772 flow
[2025-03-14 01:42:27,012 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=772, PETRI_PLACES=317, PETRI_TRANSITIONS=315}
[2025-03-14 01:42:27,012 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places.
[2025-03-14 01:42:27,013 INFO  L471      AbstractCegarLoop]: Abstraction has has 317 places, 315 transitions, 772 flow
[2025-03-14 01:42:27,013 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:27,013 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:27,014 INFO  L206   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:27,014 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-14 01:42:27,014 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:27,014 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:27,016 INFO  L85        PathProgramCache]: Analyzing trace with hash -1119613251, now seen corresponding path program 1 times
[2025-03-14 01:42:27,016 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:27,016 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885896260]
[2025-03-14 01:42:27,016 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:27,016 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:27,032 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes.
[2025-03-14 01:42:27,051 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements.
[2025-03-14 01:42:27,051 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:27,051 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:27,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-03-14 01:42:27,276 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:27,276 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885896260]
[2025-03-14 01:42:27,277 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885896260] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-14 01:42:27,277 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077578569]
[2025-03-14 01:42:27,277 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:27,277 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-14 01:42:27,277 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-14 01:42:27,280 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-14 01:42:27,281 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-14 01:42:27,344 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes.
[2025-03-14 01:42:27,395 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements.
[2025-03-14 01:42:27,395 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:27,395 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:27,397 INFO  L256         TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-03-14 01:42:27,403 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-14 01:42:27,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-03-14 01:42:27,646 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-14 01:42:27,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-03-14 01:42:27,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077578569] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-14 01:42:27,779 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-14 01:42:27,779 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22
[2025-03-14 01:42:27,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063232492]
[2025-03-14 01:42:27,779 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-14 01:42:27,780 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2025-03-14 01:42:27,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:27,780 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2025-03-14 01:42:27,781 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462
[2025-03-14 01:42:28,107 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344
[2025-03-14 01:42:28,112 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 315 transitions, 772 flow. Second operand  has 22 states, 22 states have (on average 308.59090909090907) internal successors, (6789), 22 states have internal predecessors, (6789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:28,112 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:28,112 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344
[2025-03-14 01:42:28,112 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:28,426 INFO  L124   PetriNetUnfolderBase]: 29/755 cut-off events.
[2025-03-14 01:42:28,426 INFO  L125   PetriNetUnfolderBase]: For 45/49 co-relation queries the response was YES.
[2025-03-14 01:42:28,428 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 991 conditions, 755 events. 29/755 cut-off events. For 45/49 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2686 event pairs, 0 based on Foata normal form. 4/705 useless extension candidates. Maximal degree in co-relation 706. Up to 19 conditions per place. 
[2025-03-14 01:42:28,429 INFO  L140   encePairwiseOnDemand]: 324/344 looper letters, 24 selfloop transitions, 38 changer transitions 0/335 dead transitions.
[2025-03-14 01:42:28,429 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 335 transitions, 992 flow
[2025-03-14 01:42:28,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-03-14 01:42:28,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2025-03-14 01:42:28,437 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5268 transitions.
[2025-03-14 01:42:28,439 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9008207934336525
[2025-03-14 01:42:28,439 INFO  L175             Difference]: Start difference. First operand has 317 places, 315 transitions, 772 flow. Second operand 17 states and 5268 transitions.
[2025-03-14 01:42:28,439 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 335 transitions, 992 flow
[2025-03-14 01:42:28,441 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 335 transitions, 982 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-03-14 01:42:28,444 INFO  L231             Difference]: Finished difference. Result has 331 places, 329 transitions, 946 flow
[2025-03-14 01:42:28,444 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=946, PETRI_PLACES=331, PETRI_TRANSITIONS=329}
[2025-03-14 01:42:28,445 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, 15 predicate places.
[2025-03-14 01:42:28,445 INFO  L471      AbstractCegarLoop]: Abstraction has has 331 places, 329 transitions, 946 flow
[2025-03-14 01:42:28,446 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 308.59090909090907) internal successors, (6789), 22 states have internal predecessors, (6789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:28,447 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:28,447 INFO  L206   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:28,454 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-14 01:42:28,651 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-03-14 01:42:28,651 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:28,652 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:28,652 INFO  L85        PathProgramCache]: Analyzing trace with hash 2038249213, now seen corresponding path program 2 times
[2025-03-14 01:42:28,652 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:28,652 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800688606]
[2025-03-14 01:42:28,652 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-03-14 01:42:28,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:28,681 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes.
[2025-03-14 01:42:28,687 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 128 of 278 statements.
[2025-03-14 01:42:28,687 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-03-14 01:42:28,687 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:28,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked.
[2025-03-14 01:42:28,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:28,950 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800688606]
[2025-03-14 01:42:28,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800688606] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:28,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:28,950 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:42:28,950 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146187911]
[2025-03-14 01:42:28,950 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:28,951 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:42:28,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:28,951 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:42:28,951 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:42:29,308 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344
[2025-03-14 01:42:29,310 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 329 transitions, 946 flow. Second operand  has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:29,310 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:29,310 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344
[2025-03-14 01:42:29,310 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:29,444 INFO  L124   PetriNetUnfolderBase]: 61/838 cut-off events.
[2025-03-14 01:42:29,444 INFO  L125   PetriNetUnfolderBase]: For 87/89 co-relation queries the response was YES.
[2025-03-14 01:42:29,446 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 838 events. 61/838 cut-off events. For 87/89 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3597 event pairs, 3 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 781. Up to 64 conditions per place. 
[2025-03-14 01:42:29,448 INFO  L140   encePairwiseOnDemand]: 337/344 looper letters, 26 selfloop transitions, 5 changer transitions 0/332 dead transitions.
[2025-03-14 01:42:29,448 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 332 transitions, 1019 flow
[2025-03-14 01:42:29,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:42:29,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:42:29,451 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1869 transitions.
[2025-03-14 01:42:29,451 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9055232558139535
[2025-03-14 01:42:29,452 INFO  L175             Difference]: Start difference. First operand has 331 places, 329 transitions, 946 flow. Second operand 6 states and 1869 transitions.
[2025-03-14 01:42:29,452 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 332 transitions, 1019 flow
[2025-03-14 01:42:29,454 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 332 transitions, 967 flow, removed 8 selfloop flow, removed 8 redundant places.
[2025-03-14 01:42:29,456 INFO  L231             Difference]: Finished difference. Result has 326 places, 327 transitions, 900 flow
[2025-03-14 01:42:29,457 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=900, PETRI_PLACES=326, PETRI_TRANSITIONS=327}
[2025-03-14 01:42:29,457 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, 10 predicate places.
[2025-03-14 01:42:29,457 INFO  L471      AbstractCegarLoop]: Abstraction has has 326 places, 327 transitions, 900 flow
[2025-03-14 01:42:29,458 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:29,458 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:29,459 INFO  L206   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:29,459 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-14 01:42:29,459 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:29,460 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:29,460 INFO  L85        PathProgramCache]: Analyzing trace with hash 935197614, now seen corresponding path program 1 times
[2025-03-14 01:42:29,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:29,460 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293816916]
[2025-03-14 01:42:29,460 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:29,460 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:29,481 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes.
[2025-03-14 01:42:29,500 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements.
[2025-03-14 01:42:29,500 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:29,500 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:30,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked.
[2025-03-14 01:42:30,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:30,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293816916]
[2025-03-14 01:42:30,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293816916] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:30,117 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:30,118 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:42:30,118 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338103574]
[2025-03-14 01:42:30,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:30,118 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:42:30,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:30,119 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:42:30,119 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:42:30,440 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344
[2025-03-14 01:42:30,442 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 327 transitions, 900 flow. Second operand  has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:30,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:30,442 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344
[2025-03-14 01:42:30,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:30,573 INFO  L124   PetriNetUnfolderBase]: 41/860 cut-off events.
[2025-03-14 01:42:30,573 INFO  L125   PetriNetUnfolderBase]: For 66/68 co-relation queries the response was YES.
[2025-03-14 01:42:30,576 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 860 events. 41/860 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3524 event pairs, 2 based on Foata normal form. 0/808 useless extension candidates. Maximal degree in co-relation 925. Up to 64 conditions per place. 
[2025-03-14 01:42:30,578 INFO  L140   encePairwiseOnDemand]: 337/344 looper letters, 27 selfloop transitions, 5 changer transitions 0/331 dead transitions.
[2025-03-14 01:42:30,579 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 331 transitions, 978 flow
[2025-03-14 01:42:30,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:42:30,579 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:42:30,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1870 transitions.
[2025-03-14 01:42:30,582 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9060077519379846
[2025-03-14 01:42:30,582 INFO  L175             Difference]: Start difference. First operand has 326 places, 327 transitions, 900 flow. Second operand 6 states and 1870 transitions.
[2025-03-14 01:42:30,582 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 331 transitions, 978 flow
[2025-03-14 01:42:30,584 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 331 transitions, 968 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-03-14 01:42:30,587 INFO  L231             Difference]: Finished difference. Result has 324 places, 325 transitions, 896 flow
[2025-03-14 01:42:30,588 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=896, PETRI_PLACES=324, PETRI_TRANSITIONS=325}
[2025-03-14 01:42:30,588 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, 8 predicate places.
[2025-03-14 01:42:30,588 INFO  L471      AbstractCegarLoop]: Abstraction has has 324 places, 325 transitions, 896 flow
[2025-03-14 01:42:30,589 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:30,589 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:30,590 INFO  L206   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:30,590 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-14 01:42:30,590 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:30,591 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:30,591 INFO  L85        PathProgramCache]: Analyzing trace with hash -127587231, now seen corresponding path program 1 times
[2025-03-14 01:42:30,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:30,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575804725]
[2025-03-14 01:42:30,591 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:30,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:30,611 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes.
[2025-03-14 01:42:30,628 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements.
[2025-03-14 01:42:30,628 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:30,628 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:31,112 INFO  L134       CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked.
[2025-03-14 01:42:31,113 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:31,113 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575804725]
[2025-03-14 01:42:31,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575804725] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:31,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:31,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:42:31,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030198039]
[2025-03-14 01:42:31,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:31,113 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:42:31,113 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:31,114 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:42:31,114 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:42:31,448 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344
[2025-03-14 01:42:31,450 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 325 transitions, 896 flow. Second operand  has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:31,450 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:31,450 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344
[2025-03-14 01:42:31,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:31,587 INFO  L124   PetriNetUnfolderBase]: 68/893 cut-off events.
[2025-03-14 01:42:31,587 INFO  L125   PetriNetUnfolderBase]: For 103/106 co-relation queries the response was YES.
[2025-03-14 01:42:31,590 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 893 events. 68/893 cut-off events. For 103/106 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3945 event pairs, 5 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 864. Up to 73 conditions per place. 
[2025-03-14 01:42:31,591 INFO  L140   encePairwiseOnDemand]: 337/344 looper letters, 26 selfloop transitions, 5 changer transitions 0/328 dead transitions.
[2025-03-14 01:42:31,592 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 328 transitions, 969 flow
[2025-03-14 01:42:31,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-14 01:42:31,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2025-03-14 01:42:31,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1869 transitions.
[2025-03-14 01:42:31,595 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9055232558139535
[2025-03-14 01:42:31,595 INFO  L175             Difference]: Start difference. First operand has 324 places, 325 transitions, 896 flow. Second operand 6 states and 1869 transitions.
[2025-03-14 01:42:31,595 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 328 transitions, 969 flow
[2025-03-14 01:42:31,598 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 328 transitions, 959 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-03-14 01:42:31,600 INFO  L231             Difference]: Finished difference. Result has 322 places, 323 transitions, 892 flow
[2025-03-14 01:42:31,601 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=892, PETRI_PLACES=322, PETRI_TRANSITIONS=323}
[2025-03-14 01:42:31,601 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, 6 predicate places.
[2025-03-14 01:42:31,601 INFO  L471      AbstractCegarLoop]: Abstraction has has 322 places, 323 transitions, 892 flow
[2025-03-14 01:42:31,602 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:31,602 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:31,602 INFO  L206   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:31,602 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-14 01:42:31,602 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:31,603 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:31,603 INFO  L85        PathProgramCache]: Analyzing trace with hash 332448859, now seen corresponding path program 1 times
[2025-03-14 01:42:31,603 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:31,603 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791927025]
[2025-03-14 01:42:31,603 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:31,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:31,627 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes.
[2025-03-14 01:42:31,640 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements.
[2025-03-14 01:42:31,640 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:31,640 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:31,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked.
[2025-03-14 01:42:31,681 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:31,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791927025]
[2025-03-14 01:42:31,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791927025] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:31,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:31,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:42:31,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57963269]
[2025-03-14 01:42:31,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:31,682 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:42:31,682 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:31,683 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:42:31,683 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:42:31,690 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 324 out of 344
[2025-03-14 01:42:31,691 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 323 transitions, 892 flow. Second operand  has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:31,691 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:31,691 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 344
[2025-03-14 01:42:31,691 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:31,767 INFO  L124   PetriNetUnfolderBase]: 34/746 cut-off events.
[2025-03-14 01:42:31,767 INFO  L125   PetriNetUnfolderBase]: For 63/66 co-relation queries the response was YES.
[2025-03-14 01:42:31,769 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 978 conditions, 746 events. 34/746 cut-off events. For 63/66 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2630 event pairs, 2 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 754. Up to 27 conditions per place. 
[2025-03-14 01:42:31,771 INFO  L140   encePairwiseOnDemand]: 341/344 looper letters, 8 selfloop transitions, 2 changer transitions 0/323 dead transitions.
[2025-03-14 01:42:31,771 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 323 transitions, 913 flow
[2025-03-14 01:42:31,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:42:31,771 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:42:31,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions.
[2025-03-14 01:42:31,772 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9525193798449613
[2025-03-14 01:42:31,773 INFO  L175             Difference]: Start difference. First operand has 322 places, 323 transitions, 892 flow. Second operand 3 states and 983 transitions.
[2025-03-14 01:42:31,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 323 transitions, 913 flow
[2025-03-14 01:42:31,777 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 323 transitions, 903 flow, removed 0 selfloop flow, removed 5 redundant places.
[2025-03-14 01:42:31,779 INFO  L231             Difference]: Finished difference. Result has 318 places, 322 transitions, 884 flow
[2025-03-14 01:42:31,780 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=318, PETRI_TRANSITIONS=322}
[2025-03-14 01:42:31,780 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, 2 predicate places.
[2025-03-14 01:42:31,780 INFO  L471      AbstractCegarLoop]: Abstraction has has 318 places, 322 transitions, 884 flow
[2025-03-14 01:42:31,781 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:31,781 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:31,781 INFO  L206   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:31,781 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-14 01:42:31,781 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:31,782 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:31,782 INFO  L85        PathProgramCache]: Analyzing trace with hash 1977853146, now seen corresponding path program 1 times
[2025-03-14 01:42:31,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:31,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174337210]
[2025-03-14 01:42:31,782 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:31,782 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:31,804 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes.
[2025-03-14 01:42:31,817 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements.
[2025-03-14 01:42:31,818 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:31,818 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:31,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked.
[2025-03-14 01:42:31,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:31,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174337210]
[2025-03-14 01:42:31,869 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174337210] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:31,869 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:31,869 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:42:31,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809652371]
[2025-03-14 01:42:31,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:31,871 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:42:31,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:31,872 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:42:31,872 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:42:31,877 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 326 out of 344
[2025-03-14 01:42:31,878 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 322 transitions, 884 flow. Second operand  has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:31,878 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:31,878 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 344
[2025-03-14 01:42:31,878 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:31,958 INFO  L124   PetriNetUnfolderBase]: 33/723 cut-off events.
[2025-03-14 01:42:31,958 INFO  L125   PetriNetUnfolderBase]: For 66/68 co-relation queries the response was YES.
[2025-03-14 01:42:31,960 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 928 conditions, 723 events. 33/723 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2399 event pairs, 1 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 861. Up to 17 conditions per place. 
[2025-03-14 01:42:31,962 INFO  L140   encePairwiseOnDemand]: 342/344 looper letters, 6 selfloop transitions, 1 changer transitions 0/321 dead transitions.
[2025-03-14 01:42:31,962 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 321 transitions, 896 flow
[2025-03-14 01:42:31,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:42:31,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:42:31,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 986 transitions.
[2025-03-14 01:42:31,965 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9554263565891473
[2025-03-14 01:42:31,965 INFO  L175             Difference]: Start difference. First operand has 318 places, 322 transitions, 884 flow. Second operand 3 states and 986 transitions.
[2025-03-14 01:42:31,965 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 321 transitions, 896 flow
[2025-03-14 01:42:31,967 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places.
[2025-03-14 01:42:31,970 INFO  L231             Difference]: Finished difference. Result has 317 places, 321 transitions, 880 flow
[2025-03-14 01:42:31,971 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=317, PETRI_TRANSITIONS=321}
[2025-03-14 01:42:31,971 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places.
[2025-03-14 01:42:31,971 INFO  L471      AbstractCegarLoop]: Abstraction has has 317 places, 321 transitions, 880 flow
[2025-03-14 01:42:31,972 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:31,972 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:31,972 INFO  L206   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:31,972 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-14 01:42:31,972 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:31,973 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:31,973 INFO  L85        PathProgramCache]: Analyzing trace with hash -1953624156, now seen corresponding path program 1 times
[2025-03-14 01:42:31,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:31,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585668930]
[2025-03-14 01:42:31,974 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:31,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:31,999 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes.
[2025-03-14 01:42:32,011 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements.
[2025-03-14 01:42:32,011 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:32,011 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:32,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked.
[2025-03-14 01:42:32,071 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:32,072 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585668930]
[2025-03-14 01:42:32,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585668930] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:32,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:32,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:42:32,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799640968]
[2025-03-14 01:42:32,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:32,073 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:42:32,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:32,073 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:42:32,073 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:42:32,077 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 326 out of 344
[2025-03-14 01:42:32,078 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 321 transitions, 880 flow. Second operand  has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:32,078 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:32,078 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 344
[2025-03-14 01:42:32,078 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:32,159 INFO  L124   PetriNetUnfolderBase]: 33/716 cut-off events.
[2025-03-14 01:42:32,159 INFO  L125   PetriNetUnfolderBase]: For 63/65 co-relation queries the response was YES.
[2025-03-14 01:42:32,161 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 913 conditions, 716 events. 33/716 cut-off events. For 63/65 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2376 event pairs, 1 based on Foata normal form. 2/687 useless extension candidates. Maximal degree in co-relation 889. Up to 18 conditions per place. 
[2025-03-14 01:42:32,165 INFO  L140   encePairwiseOnDemand]: 342/344 looper letters, 4 selfloop transitions, 0 changer transitions 4/320 dead transitions.
[2025-03-14 01:42:32,165 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 320 transitions, 890 flow
[2025-03-14 01:42:32,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:42:32,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:42:32,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions.
[2025-03-14 01:42:32,168 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9544573643410853
[2025-03-14 01:42:32,169 INFO  L175             Difference]: Start difference. First operand has 317 places, 321 transitions, 880 flow. Second operand 3 states and 985 transitions.
[2025-03-14 01:42:32,169 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 320 transitions, 890 flow
[2025-03-14 01:42:32,171 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 320 transitions, 889 flow, removed 0 selfloop flow, removed 1 redundant places.
[2025-03-14 01:42:32,173 INFO  L231             Difference]: Finished difference. Result has 317 places, 316 transitions, 867 flow
[2025-03-14 01:42:32,174 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=867, PETRI_PLACES=317, PETRI_TRANSITIONS=316}
[2025-03-14 01:42:32,174 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places.
[2025-03-14 01:42:32,174 INFO  L471      AbstractCegarLoop]: Abstraction has has 317 places, 316 transitions, 867 flow
[2025-03-14 01:42:32,175 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:32,175 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:42:32,175 INFO  L206   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:32,175 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-14 01:42:32,175 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] ===
[2025-03-14 01:42:32,176 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:42:32,176 INFO  L85        PathProgramCache]: Analyzing trace with hash 614891675, now seen corresponding path program 1 times
[2025-03-14 01:42:32,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:42:32,176 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695713425]
[2025-03-14 01:42:32,176 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:42:32,176 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:42:32,197 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes.
[2025-03-14 01:42:32,206 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements.
[2025-03-14 01:42:32,206 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:42:32,206 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:42:32,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked.
[2025-03-14 01:42:32,248 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:42:32,248 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695713425]
[2025-03-14 01:42:32,248 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695713425] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:42:32,248 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:42:32,248 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:42:32,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44413628]
[2025-03-14 01:42:32,248 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:42:32,249 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:42:32,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:42:32,250 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:42:32,250 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:42:32,256 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 324 out of 344
[2025-03-14 01:42:32,257 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 316 transitions, 867 flow. Second operand  has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:32,258 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:42:32,258 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 344
[2025-03-14 01:42:32,258 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:42:32,311 INFO  L124   PetriNetUnfolderBase]: 38/715 cut-off events.
[2025-03-14 01:42:32,312 INFO  L125   PetriNetUnfolderBase]: For 69/71 co-relation queries the response was YES.
[2025-03-14 01:42:32,314 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 923 conditions, 715 events. 38/715 cut-off events. For 69/71 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2334 event pairs, 2 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 909. Up to 21 conditions per place. 
[2025-03-14 01:42:32,314 INFO  L140   encePairwiseOnDemand]: 341/344 looper letters, 0 selfloop transitions, 0 changer transitions 316/316 dead transitions.
[2025-03-14 01:42:32,315 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 316 transitions, 884 flow
[2025-03-14 01:42:32,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:42:32,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:42:32,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 981 transitions.
[2025-03-14 01:42:32,316 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9505813953488372
[2025-03-14 01:42:32,317 INFO  L175             Difference]: Start difference. First operand has 317 places, 316 transitions, 867 flow. Second operand 3 states and 981 transitions.
[2025-03-14 01:42:32,317 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 316 transitions, 884 flow
[2025-03-14 01:42:32,320 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 316 transitions, 884 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-14 01:42:32,321 INFO  L231             Difference]: Finished difference. Result has 312 places, 0 transitions, 0 flow
[2025-03-14 01:42:32,321 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=312, PETRI_TRANSITIONS=0}
[2025-03-14 01:42:32,322 INFO  L279   CegarLoopForPetriNet]: 316 programPoint places, -4 predicate places.
[2025-03-14 01:42:32,322 INFO  L471      AbstractCegarLoop]: Abstraction has has 312 places, 0 transitions, 0 flow
[2025-03-14 01:42:32,322 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-14 01:42:32,324 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (53 of 54 remaining)
[2025-03-14 01:42:32,324 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining)
[2025-03-14 01:42:32,324 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining)
[2025-03-14 01:42:32,324 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining)
[2025-03-14 01:42:32,324 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining)
[2025-03-14 01:42:32,325 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining)
[2025-03-14 01:42:32,325 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 54 remaining)
[2025-03-14 01:42:32,325 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 54 remaining)
[2025-03-14 01:42:32,325 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining)
[2025-03-14 01:42:32,325 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining)
[2025-03-14 01:42:32,325 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining)
[2025-03-14 01:42:32,325 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining)
[2025-03-14 01:42:32,325 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining)
[2025-03-14 01:42:32,325 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining)
[2025-03-14 01:42:32,325 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining)
[2025-03-14 01:42:32,325 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining)
[2025-03-14 01:42:32,325 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining)
[2025-03-14 01:42:32,326 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining)
[2025-03-14 01:42:32,326 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining)
[2025-03-14 01:42:32,326 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining)
[2025-03-14 01:42:32,326 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining)
[2025-03-14 01:42:32,326 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining)
[2025-03-14 01:42:32,326 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining)
[2025-03-14 01:42:32,326 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining)
[2025-03-14 01:42:32,326 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining)
[2025-03-14 01:42:32,326 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining)
[2025-03-14 01:42:32,326 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining)
[2025-03-14 01:42:32,326 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining)
[2025-03-14 01:42:32,326 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining)
[2025-03-14 01:42:32,327 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining)
[2025-03-14 01:42:32,328 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining)
[2025-03-14 01:42:32,328 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining)
[2025-03-14 01:42:32,328 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining)
[2025-03-14 01:42:32,328 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining)
[2025-03-14 01:42:32,328 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining)
[2025-03-14 01:42:32,328 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining)
[2025-03-14 01:42:32,328 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining)
[2025-03-14 01:42:32,328 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining)
[2025-03-14 01:42:32,328 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining)
[2025-03-14 01:42:32,328 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-14 01:42:32,328 INFO  L422         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-14 01:42:32,333 INFO  L241   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-03-14 01:42:32,334 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-14 01:42:32,339 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:42:32 BasicIcfg
[2025-03-14 01:42:32,339 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-14 01:42:32,339 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-14 01:42:32,340 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-14 01:42:32,340 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-14 01:42:32,340 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:21" (3/4) ...
[2025-03-14 01:42:32,342 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-03-14 01:42:32,344 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread1
[2025-03-14 01:42:32,345 INFO  L385     IcfgBacktranslator]: Ignoring RootEdge to procedure thread2
[2025-03-14 01:42:32,349 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges
[2025-03-14 01:42:32,350 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2025-03-14 01:42:32,350 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-03-14 01:42:32,350 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-03-14 01:42:32,418 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-14 01:42:32,418 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-14 01:42:32,419 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-14 01:42:32,420 INFO  L158              Benchmark]: Toolchain (without parser) took 11821.56ms. Allocated memory was 201.3MB in the beginning and 486.5MB in the end (delta: 285.2MB). Free memory was 154.2MB in the beginning and 205.3MB in the end (delta: -51.0MB). Peak memory consumption was 229.4MB. Max. memory is 16.1GB.
[2025-03-14 01:42:32,420 INFO  L158              Benchmark]: CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-14 01:42:32,421 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 247.26ms. Allocated memory is still 201.3MB. Free memory was 154.2MB in the beginning and 141.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-14 01:42:32,421 INFO  L158              Benchmark]: Boogie Procedure Inliner took 45.96ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 138.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-14 01:42:32,422 INFO  L158              Benchmark]: Boogie Preprocessor took 50.81ms. Allocated memory is still 201.3MB. Free memory was 138.8MB in the beginning and 136.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-14 01:42:32,422 INFO  L158              Benchmark]: IcfgBuilder took 608.80ms. Allocated memory is still 201.3MB. Free memory was 136.5MB in the beginning and 106.4MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-14 01:42:32,422 INFO  L158              Benchmark]: TraceAbstraction took 10782.60ms. Allocated memory was 201.3MB in the beginning and 486.5MB in the end (delta: 285.2MB). Free memory was 106.0MB in the beginning and 209.5MB in the end (delta: -103.5MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB.
[2025-03-14 01:42:32,422 INFO  L158              Benchmark]: Witness Printer took 79.12ms. Allocated memory is still 486.5MB. Free memory was 209.5MB in the beginning and 205.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-14 01:42:32,424 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 247.26ms. Allocated memory is still 201.3MB. Free memory was 154.2MB in the beginning and 141.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 45.96ms. Allocated memory is still 201.3MB. Free memory was 141.4MB in the beginning and 138.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 50.81ms. Allocated memory is still 201.3MB. Free memory was 138.8MB in the beginning and 136.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * IcfgBuilder took 608.80ms. Allocated memory is still 201.3MB. Free memory was 136.5MB in the beginning and 106.4MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 10782.60ms. Allocated memory was 201.3MB in the beginning and 486.5MB in the end (delta: 285.2MB). Free memory was 106.0MB in the beginning and 209.5MB in the end (delta: -103.5MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB.
 * Witness Printer took 79.12ms. Allocated memory is still 486.5MB. Free memory was 209.5MB in the beginning and 205.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 49]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 50]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 51]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 51]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 51]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 51]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 51]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 51]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 51]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 53]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 51]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 65]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 66]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 67]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 67]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 67]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 67]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 67]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 67]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 67]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 69]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 67]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 104]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 81]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 104]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 82]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 83]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 84]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 92]: there are no data races
    For all program executions holds that there are no data races at this location
  - PositiveResult [Line: 92]: there are no data races
    For all program executions holds that there are no data races at this location
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 5 procedures, 488 locations, 54 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.6s, OverallIterations: 20, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2545 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1622 mSDsluCounter, 1047 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 814 mSDsCounter, 586 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4316 IncrementalHoareTripleChecker+Invalid, 4902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 586 mSolverCounterUnsat, 233 mSDtfsCounter, 4316 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 740 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=946occurred in iteration=13, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 3904 NumberOfCodeBlocks, 3664 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4250 ConstructedInterpolants, 0 QuantifiedInterpolants, 6037 SizeOfPredicates, 14 NumberOfNonLiveVariables, 840 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 2416/2563 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    30 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-03-14 01:42:32,441 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE