./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/test-easy1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/test-easy1.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 935a7b7fee114f90b65d69dd73b2635844dd9aedca06c4cbc37a4ce046611c9d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:34:07,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:34:07,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:34:07,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:34:07,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:34:07,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:34:07,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:34:07,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:34:07,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:34:07,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:34:07,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:34:07,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:34:07,477 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:34:07,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:34:07,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:34:07,478 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:34:07,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:34:07,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:34:07,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:34:07,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:34:07,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:34:07,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:34:07,479 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:34:07,479 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:34:07,479 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:34:07,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:34:07,479 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:34:07,479 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:34:07,479 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:34:07,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:34:07,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:34:07,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:07,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:34:07,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:34:07,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:34:07,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:07,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:34:07,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:34:07,481 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:34:07,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:34:07,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:34:07,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:34:07,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:34:07,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:34:07,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:34:07,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:34:07,482 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 935a7b7fee114f90b65d69dd73b2635844dd9aedca06c4cbc37a4ce046611c9d [2025-01-09 21:34:07,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:34:07,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:34:07,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:34:07,792 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:34:07,793 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:34:07,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy1.wvr.c [2025-01-09 21:34:09,121 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58b270fac/7802b4fb9c2d4a418ad9875f0812a0ab/FLAG82f7cf030 [2025-01-09 21:34:09,378 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:34:09,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/test-easy1.wvr.c [2025-01-09 21:34:09,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58b270fac/7802b4fb9c2d4a418ad9875f0812a0ab/FLAG82f7cf030 [2025-01-09 21:34:09,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58b270fac/7802b4fb9c2d4a418ad9875f0812a0ab [2025-01-09 21:34:09,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:34:09,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:34:09,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:34:09,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:34:09,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:34:09,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb2028d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09, skipping insertion in model container [2025-01-09 21:34:09,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:34:09,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:34:09,600 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:34:09,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:34:09,631 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:34:09,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09 WrapperNode [2025-01-09 21:34:09,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:34:09,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:34:09,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:34:09,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:34:09,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,662 INFO L138 Inliner]: procedures = 20, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 69 [2025-01-09 21:34:09,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:34:09,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:34:09,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:34:09,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:34:09,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,683 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:34:09,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:34:09,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:34:09,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:34:09,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (1/1) ... [2025-01-09 21:34:09,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:09,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:34:09,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:34:09,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:34:09,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:34:09,749 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:34:09,749 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:34:09,749 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:34:09,749 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:34:09,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:34:09,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:34:09,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:34:09,750 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:34:09,833 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:34:09,835 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:34:10,028 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:34:10,028 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:34:10,040 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:34:10,040 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:34:10,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:10 BoogieIcfgContainer [2025-01-09 21:34:10,041 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:34:10,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:34:10,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:34:10,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:34:10,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:34:09" (1/3) ... [2025-01-09 21:34:10,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628892b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:34:10, skipping insertion in model container [2025-01-09 21:34:10,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:09" (2/3) ... [2025-01-09 21:34:10,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628892b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:34:10, skipping insertion in model container [2025-01-09 21:34:10,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:10" (3/3) ... [2025-01-09 21:34:10,050 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy1.wvr.c [2025-01-09 21:34:10,063 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:34:10,066 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy1.wvr.c that has 3 procedures, 124 locations, 1 initial locations, 2 loop locations, and 13 error locations. [2025-01-09 21:34:10,066 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:34:10,139 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:34:10,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 130 transitions, 274 flow [2025-01-09 21:34:10,237 INFO L124 PetriNetUnfolderBase]: 7/128 cut-off events. [2025-01-09 21:34:10,240 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:34:10,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 128 events. 7/128 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 123 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2025-01-09 21:34:10,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 130 transitions, 274 flow [2025-01-09 21:34:10,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 111 transitions, 234 flow [2025-01-09 21:34:10,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:34:10,280 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;@13ef62f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:34:10,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-09 21:34:10,288 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:34:10,288 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-01-09 21:34:10,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:34:10,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:10,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:10,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:34:10,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:10,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1973663212, now seen corresponding path program 1 times [2025-01-09 21:34:10,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:10,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820809402] [2025-01-09 21:34:10,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:10,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 21:34:10,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 21:34:10,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:10,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:10,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:10,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820809402] [2025-01-09 21:34:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820809402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:10,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:10,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:10,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726876518] [2025-01-09 21:34:10,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:10,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:10,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:10,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:10,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:10,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 130 [2025-01-09 21:34:10,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 111 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:10,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:10,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 130 [2025-01-09 21:34:10,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:10,600 INFO L124 PetriNetUnfolderBase]: 7/129 cut-off events. [2025-01-09 21:34:10,602 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:34:10,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 129 events. 7/129 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 245 event pairs, 3 based on Foata normal form. 6/115 useless extension candidates. Maximal degree in co-relation 91. Up to 21 conditions per place. [2025-01-09 21:34:10,605 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 13 selfloop transitions, 2 changer transitions 1/107 dead transitions. [2025-01-09 21:34:10,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 107 transitions, 256 flow [2025-01-09 21:34:10,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2025-01-09 21:34:10,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794871794871795 [2025-01-09 21:34:10,622 INFO L175 Difference]: Start difference. First operand has 112 places, 111 transitions, 234 flow. Second operand 3 states and 343 transitions. [2025-01-09 21:34:10,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 107 transitions, 256 flow [2025-01-09 21:34:10,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 248 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:34:10,633 INFO L231 Difference]: Finished difference. Result has 109 places, 106 transitions, 220 flow [2025-01-09 21:34:10,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=109, PETRI_TRANSITIONS=106} [2025-01-09 21:34:10,639 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, -3 predicate places. [2025-01-09 21:34:10,640 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 106 transitions, 220 flow [2025-01-09 21:34:10,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:10,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:10,640 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:10,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:34:10,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:34:10,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:10,641 INFO L85 PathProgramCache]: Analyzing trace with hash -527964736, now seen corresponding path program 1 times [2025-01-09 21:34:10,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:10,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117426215] [2025-01-09 21:34:10,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:10,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:10,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:34:10,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:34:10,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:10,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:10,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:10,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117426215] [2025-01-09 21:34:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117426215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:10,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:10,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:10,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194593970] [2025-01-09 21:34:10,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:10,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:10,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:10,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:10,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:10,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 130 [2025-01-09 21:34:10,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:10,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:10,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 130 [2025-01-09 21:34:10,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:10,787 INFO L124 PetriNetUnfolderBase]: 7/127 cut-off events. [2025-01-09 21:34:10,787 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:34:10,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 127 events. 7/127 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 223 event pairs, 3 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 129. Up to 20 conditions per place. [2025-01-09 21:34:10,789 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 12 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2025-01-09 21:34:10,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 105 transitions, 246 flow [2025-01-09 21:34:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-01-09 21:34:10,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8769230769230769 [2025-01-09 21:34:10,791 INFO L175 Difference]: Start difference. First operand has 109 places, 106 transitions, 220 flow. Second operand 3 states and 342 transitions. [2025-01-09 21:34:10,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 105 transitions, 246 flow [2025-01-09 21:34:10,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:10,796 INFO L231 Difference]: Finished difference. Result has 107 places, 105 transitions, 218 flow [2025-01-09 21:34:10,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=107, PETRI_TRANSITIONS=105} [2025-01-09 21:34:10,797 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, -5 predicate places. [2025-01-09 21:34:10,799 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 218 flow [2025-01-09 21:34:10,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:10,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:10,799 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] [2025-01-09 21:34:10,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:34:10,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:34:10,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash -350370532, now seen corresponding path program 1 times [2025-01-09 21:34:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:10,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479989534] [2025-01-09 21:34:10,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:10,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:10,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:34:10,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:34:10,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:10,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:10,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:10,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479989534] [2025-01-09 21:34:10,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479989534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:10,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:10,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:10,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096418048] [2025-01-09 21:34:10,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:10,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:10,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:10,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:10,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:10,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 130 [2025-01-09 21:34:10,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:10,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:10,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 130 [2025-01-09 21:34:10,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:10,976 INFO L124 PetriNetUnfolderBase]: 9/123 cut-off events. [2025-01-09 21:34:10,976 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:34:10,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 123 events. 9/123 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 240 event pairs, 4 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 129. Up to 24 conditions per place. [2025-01-09 21:34:10,977 INFO L140 encePairwiseOnDemand]: 122/130 looper letters, 15 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2025-01-09 21:34:10,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 102 transitions, 249 flow [2025-01-09 21:34:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2025-01-09 21:34:10,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8589743589743589 [2025-01-09 21:34:10,981 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 218 flow. Second operand 3 states and 335 transitions. [2025-01-09 21:34:10,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 102 transitions, 249 flow [2025-01-09 21:34:10,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 102 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:10,985 INFO L231 Difference]: Finished difference. Result has 103 places, 101 transitions, 217 flow [2025-01-09 21:34:10,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=103, PETRI_TRANSITIONS=101} [2025-01-09 21:34:10,986 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, -9 predicate places. [2025-01-09 21:34:10,986 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 101 transitions, 217 flow [2025-01-09 21:34:10,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:10,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:10,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:10,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:34:10,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:34:10,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:10,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1698624638, now seen corresponding path program 1 times [2025-01-09 21:34:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:10,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738403094] [2025-01-09 21:34:10,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:10,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:34:11,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:34:11,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:11,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:11,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738403094] [2025-01-09 21:34:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738403094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:11,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:11,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731867832] [2025-01-09 21:34:11,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:11,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:11,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:11,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:11,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 130 [2025-01-09 21:34:11,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 101 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:11,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:11,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 130 [2025-01-09 21:34:11,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:11,107 INFO L124 PetriNetUnfolderBase]: 9/120 cut-off events. [2025-01-09 21:34:11,108 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:34:11,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 120 events. 9/120 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 205 event pairs, 4 based on Foata normal form. 1/113 useless extension candidates. Maximal degree in co-relation 112. Up to 21 conditions per place. [2025-01-09 21:34:11,110 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 10 selfloop transitions, 3 changer transitions 4/99 dead transitions. [2025-01-09 21:34:11,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 99 transitions, 244 flow [2025-01-09 21:34:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2025-01-09 21:34:11,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2025-01-09 21:34:11,113 INFO L175 Difference]: Start difference. First operand has 103 places, 101 transitions, 217 flow. Second operand 3 states and 340 transitions. [2025-01-09 21:34:11,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 99 transitions, 244 flow [2025-01-09 21:34:11,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 99 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:11,117 INFO L231 Difference]: Finished difference. Result has 101 places, 94 transitions, 210 flow [2025-01-09 21:34:11,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=101, PETRI_TRANSITIONS=94} [2025-01-09 21:34:11,119 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, -11 predicate places. [2025-01-09 21:34:11,120 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 94 transitions, 210 flow [2025-01-09 21:34:11,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:11,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:11,120 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] [2025-01-09 21:34:11,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:34:11,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:34:11,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:11,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1540255695, now seen corresponding path program 1 times [2025-01-09 21:34:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:11,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964806951] [2025-01-09 21:34:11,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:11,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:11,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:34:11,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:34:11,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:11,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:11,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:11,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964806951] [2025-01-09 21:34:11,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964806951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:11,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:11,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960732086] [2025-01-09 21:34:11,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:11,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:11,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:11,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:11,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:11,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 130 [2025-01-09 21:34:11,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 94 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:11,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:11,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 130 [2025-01-09 21:34:11,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:11,270 INFO L124 PetriNetUnfolderBase]: 10/115 cut-off events. [2025-01-09 21:34:11,271 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:34:11,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 115 events. 10/115 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 225 event pairs, 4 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 117. Up to 21 conditions per place. [2025-01-09 21:34:11,272 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 12 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2025-01-09 21:34:11,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 239 flow [2025-01-09 21:34:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2025-01-09 21:34:11,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.882051282051282 [2025-01-09 21:34:11,274 INFO L175 Difference]: Start difference. First operand has 101 places, 94 transitions, 210 flow. Second operand 3 states and 344 transitions. [2025-01-09 21:34:11,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 239 flow [2025-01-09 21:34:11,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:11,276 INFO L231 Difference]: Finished difference. Result has 97 places, 93 transitions, 209 flow [2025-01-09 21:34:11,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=97, PETRI_TRANSITIONS=93} [2025-01-09 21:34:11,277 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, -15 predicate places. [2025-01-09 21:34:11,277 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 209 flow [2025-01-09 21:34:11,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:11,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:11,277 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] [2025-01-09 21:34:11,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:34:11,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:34:11,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash 905774091, now seen corresponding path program 1 times [2025-01-09 21:34:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:11,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121116154] [2025-01-09 21:34:11,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:11,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:11,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:34:11,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:34:11,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:11,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:11,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:11,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121116154] [2025-01-09 21:34:11,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121116154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:11,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:11,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:11,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862724641] [2025-01-09 21:34:11,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:11,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:11,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:11,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:11,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:11,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 130 [2025-01-09 21:34:11,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:11,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:11,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 130 [2025-01-09 21:34:11,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:11,414 INFO L124 PetriNetUnfolderBase]: 10/114 cut-off events. [2025-01-09 21:34:11,415 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:34:11,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 114 events. 10/114 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 194 event pairs, 4 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 145. Up to 20 conditions per place. [2025-01-09 21:34:11,416 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 0 selfloop transitions, 0 changer transitions 93/93 dead transitions. [2025-01-09 21:34:11,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 236 flow [2025-01-09 21:34:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2025-01-09 21:34:11,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8871794871794871 [2025-01-09 21:34:11,421 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 209 flow. Second operand 3 states and 346 transitions. [2025-01-09 21:34:11,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 236 flow [2025-01-09 21:34:11,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 93 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:11,423 INFO L231 Difference]: Finished difference. Result has 96 places, 0 transitions, 0 flow [2025-01-09 21:34:11,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=96, PETRI_TRANSITIONS=0} [2025-01-09 21:34:11,424 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, -16 predicate places. [2025-01-09 21:34:11,425 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 0 transitions, 0 flow [2025-01-09 21:34:11,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:11,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2025-01-09 21:34:11,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2025-01-09 21:34:11,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2025-01-09 21:34:11,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2025-01-09 21:34:11,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2025-01-09 21:34:11,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2025-01-09 21:34:11,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2025-01-09 21:34:11,432 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2025-01-09 21:34:11,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:34:11,433 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:34:11,438 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:34:11,438 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:34:11,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:34:11 BasicIcfg [2025-01-09 21:34:11,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:34:11,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:34:11,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:34:11,444 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:34:11,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:10" (3/4) ... [2025-01-09 21:34:11,445 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:34:11,447 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:34:11,448 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:34:11,450 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-09 21:34:11,450 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:34:11,451 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:34:11,451 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:34:11,522 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:34:11,522 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:34:11,522 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:34:11,524 INFO L158 Benchmark]: Toolchain (without parser) took 2107.49ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 50.6MB in the end (delta: 55.4MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2025-01-09 21:34:11,524 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:11,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.72ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:11,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.04ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.5MB in the end (delta: 950.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:11,526 INFO L158 Benchmark]: Boogie Preprocessor took 19.32ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.5MB in the end (delta: 922.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:11,526 INFO L158 Benchmark]: RCFGBuilder took 356.08ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 78.6MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:11,527 INFO L158 Benchmark]: TraceAbstraction took 1400.41ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 56.5MB in the end (delta: 21.2MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-01-09 21:34:11,527 INFO L158 Benchmark]: Witness Printer took 78.48ms. Allocated memory is still 142.6MB. Free memory was 56.5MB in the beginning and 50.6MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:11,530 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.77ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.72ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.04ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.5MB in the end (delta: 950.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.32ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 92.5MB in the end (delta: 922.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 356.08ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 78.6MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1400.41ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 56.5MB in the end (delta: 21.2MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Witness Printer took 78.48ms. Allocated memory is still 142.6MB. Free memory was 56.5MB in the beginning and 50.6MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: 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: 69]: 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, 164 locations, 21 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: 1.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 228 IncrementalHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 53 mSDtfsCounter, 228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=0, InterpolantAutomatonStates: 18, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:34:11,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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