./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-simple-queue.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/popl20-simple-queue.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 608e0c2870f111f9f6921442a1f1a544ee956a8de04c7629c0edf3e54cde4da3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:58,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:58,173 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:33:58,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:58,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:58,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:58,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:58,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:58,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:58,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:58,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:58,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:58,191 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:58,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:58,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:58,191 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:58,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:58,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:58,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:58,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:58,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:58,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:58,192 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:58,192 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:58,192 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:58,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:58,192 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:58,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:58,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:58,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:58,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:58,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:58,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:58,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:58,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:58,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:58,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:58,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:58,193 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:58,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:58,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:58,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:58,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:58,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:58,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:58,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:58,194 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 -> 608e0c2870f111f9f6921442a1f1a544ee956a8de04c7629c0edf3e54cde4da3 [2025-01-09 21:33:58,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:58,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:58,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:58,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:58,384 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:58,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c [2025-01-09 21:33:59,438 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d77fb904/647c748d7f8f49c5af4dd6c664d9ecce/FLAGd88b77bc8 [2025-01-09 21:33:59,703 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:59,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-queue.wvr.c [2025-01-09 21:33:59,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d77fb904/647c748d7f8f49c5af4dd6c664d9ecce/FLAGd88b77bc8 [2025-01-09 21:34:00,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d77fb904/647c748d7f8f49c5af4dd6c664d9ecce [2025-01-09 21:34:00,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:34:00,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:34:00,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:34:00,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:34:00,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:34:00,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:34:00" (1/1) ... [2025-01-09 21:34:00,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e12e603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:00, skipping insertion in model container [2025-01-09 21:34:00,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:34:00" (1/1) ... [2025-01-09 21:34:00,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:34:00,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:34:00,294 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:34:00,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:34:00,333 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:34:00,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:00 WrapperNode [2025-01-09 21:34:00,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:34:00,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:34:00,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:34:00,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:34:00,342 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:00" (1/1) ... [2025-01-09 21:34:00,348 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:00" (1/1) ... [2025-01-09 21:34:00,376 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 217 [2025-01-09 21:34:00,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:34:00,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:34:00,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:34:00,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:34:00,384 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:00" (1/1) ... [2025-01-09 21:34:00,384 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:00" (1/1) ... [2025-01-09 21:34:00,390 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:00" (1/1) ... [2025-01-09 21:34:00,391 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:00" (1/1) ... [2025-01-09 21:34:00,402 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:00" (1/1) ... [2025-01-09 21:34:00,403 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:00" (1/1) ... [2025-01-09 21:34:00,409 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:00" (1/1) ... [2025-01-09 21:34:00,410 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:00" (1/1) ... [2025-01-09 21:34:00,411 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:00" (1/1) ... [2025-01-09 21:34:00,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:34:00,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:34:00,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:34:00,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:34:00,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:00" (1/1) ... [2025-01-09 21:34:00,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:00,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:34:00,459 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:00,464 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:00,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:34:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:34:00,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:34:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:34:00,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:34:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:34:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:34:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:34:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:34:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:34:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:34:00,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:34:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:34:00,478 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:00,536 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:34:00,538 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:34:00,771 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:34:00,771 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:34:00,976 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:34:00,976 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:34:00,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:00 BoogieIcfgContainer [2025-01-09 21:34:00,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:34:00,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:34:00,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:34:00,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:34:00,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:34:00" (1/3) ... [2025-01-09 21:34:00,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6229e323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:34:00, skipping insertion in model container [2025-01-09 21:34:00,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:00" (2/3) ... [2025-01-09 21:34:00,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6229e323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:34:00, skipping insertion in model container [2025-01-09 21:34:00,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:00" (3/3) ... [2025-01-09 21:34:00,985 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2025-01-09 21:34:00,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:34:01,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-queue.wvr.c that has 3 procedures, 173 locations, 1 initial locations, 3 loop locations, and 28 error locations. [2025-01-09 21:34:01,000 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:34:01,063 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:34:01,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 180 transitions, 374 flow [2025-01-09 21:34:01,163 INFO L124 PetriNetUnfolderBase]: 8/178 cut-off events. [2025-01-09 21:34:01,165 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:34:01,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 178 events. 8/178 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 197 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2025-01-09 21:34:01,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 180 transitions, 374 flow [2025-01-09 21:34:01,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 161 transitions, 334 flow [2025-01-09 21:34:01,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:34:01,184 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;@2de983f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:34:01,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-01-09 21:34:01,187 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:34:01,187 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-01-09 21:34:01,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:34:01,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:01,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:01,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:34:01,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:01,192 INFO L85 PathProgramCache]: Analyzing trace with hash -64576486, now seen corresponding path program 1 times [2025-01-09 21:34:01,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:01,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857629419] [2025-01-09 21:34:01,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:01,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:01,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 21:34:01,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 21:34:01,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:01,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,287 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:01,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857629419] [2025-01-09 21:34:01,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857629419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:01,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787518311] [2025-01-09 21:34:01,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:01,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:01,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:01,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 180 [2025-01-09 21:34:01,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 161 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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:01,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 180 [2025-01-09 21:34:01,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:01,369 INFO L124 PetriNetUnfolderBase]: 10/171 cut-off events. [2025-01-09 21:34:01,369 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 21:34:01,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 171 events. 10/171 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 178 event pairs, 0 based on Foata normal form. 11/167 useless extension candidates. Maximal degree in co-relation 129. Up to 21 conditions per place. [2025-01-09 21:34:01,371 INFO L140 encePairwiseOnDemand]: 154/180 looper letters, 10 selfloop transitions, 2 changer transitions 2/137 dead transitions. [2025-01-09 21:34:01,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 310 flow [2025-01-09 21:34:01,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2025-01-09 21:34:01,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-01-09 21:34:01,381 INFO L175 Difference]: Start difference. First operand has 161 places, 161 transitions, 334 flow. Second operand 3 states and 459 transitions. [2025-01-09 21:34:01,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 310 flow [2025-01-09 21:34:01,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 137 transitions, 302 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:34:01,386 INFO L231 Difference]: Finished difference. Result has 139 places, 135 transitions, 278 flow [2025-01-09 21:34:01,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=139, PETRI_TRANSITIONS=135} [2025-01-09 21:34:01,390 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, -22 predicate places. [2025-01-09 21:34:01,390 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 135 transitions, 278 flow [2025-01-09 21:34:01,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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:01,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:01,391 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:01,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:34:01,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:34:01,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:01,391 INFO L85 PathProgramCache]: Analyzing trace with hash 416653474, now seen corresponding path program 1 times [2025-01-09 21:34:01,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:01,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338362421] [2025-01-09 21:34:01,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:01,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:01,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:34:01,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:34:01,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:01,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,418 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:01,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338362421] [2025-01-09 21:34:01,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338362421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927622363] [2025-01-09 21:34:01,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:01,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:01,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 180 [2025-01-09 21:34:01,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 135 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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:01,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 180 [2025-01-09 21:34:01,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:01,474 INFO L124 PetriNetUnfolderBase]: 10/168 cut-off events. [2025-01-09 21:34:01,474 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:34:01,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 168 events. 10/168 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 175 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 171. Up to 21 conditions per place. [2025-01-09 21:34:01,475 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 10 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-01-09 21:34:01,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 300 flow [2025-01-09 21:34:01,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2025-01-09 21:34:01,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8074074074074075 [2025-01-09 21:34:01,477 INFO L175 Difference]: Start difference. First operand has 139 places, 135 transitions, 278 flow. Second operand 3 states and 436 transitions. [2025-01-09 21:34:01,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 300 flow [2025-01-09 21:34:01,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:01,479 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 276 flow [2025-01-09 21:34:01,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=136, PETRI_TRANSITIONS=134} [2025-01-09 21:34:01,480 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, -25 predicate places. [2025-01-09 21:34:01,480 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 276 flow [2025-01-09 21:34:01,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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:01,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:01,480 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] [2025-01-09 21:34:01,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:34:01,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:34:01,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:01,481 INFO L85 PathProgramCache]: Analyzing trace with hash -513225719, now seen corresponding path program 1 times [2025-01-09 21:34:01,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:01,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400638832] [2025-01-09 21:34:01,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:01,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:01,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:34:01,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:34:01,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:01,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,517 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:01,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400638832] [2025-01-09 21:34:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400638832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834973695] [2025-01-09 21:34:01,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:01,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:01,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:01,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 180 [2025-01-09 21:34:01,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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:01,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 180 [2025-01-09 21:34:01,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:01,559 INFO L124 PetriNetUnfolderBase]: 10/167 cut-off events. [2025-01-09 21:34:01,559 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:34:01,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 167 events. 10/167 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 175 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 162. Up to 21 conditions per place. [2025-01-09 21:34:01,560 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 10 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2025-01-09 21:34:01,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 133 transitions, 298 flow [2025-01-09 21:34:01,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2025-01-09 21:34:01,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8074074074074075 [2025-01-09 21:34:01,561 INFO L175 Difference]: Start difference. First operand has 136 places, 134 transitions, 276 flow. Second operand 3 states and 436 transitions. [2025-01-09 21:34:01,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 133 transitions, 298 flow [2025-01-09 21:34:01,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 133 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:01,564 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 274 flow [2025-01-09 21:34:01,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2025-01-09 21:34:01,564 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, -26 predicate places. [2025-01-09 21:34:01,564 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 274 flow [2025-01-09 21:34:01,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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:01,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:01,565 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] [2025-01-09 21:34:01,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:34:01,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:34:01,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash 700256128, now seen corresponding path program 1 times [2025-01-09 21:34:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:01,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387254202] [2025-01-09 21:34:01,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:01,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:01,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:34:01,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:34:01,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:01,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,590 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:01,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387254202] [2025-01-09 21:34:01,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387254202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179628745] [2025-01-09 21:34:01,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:01,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:01,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:01,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 180 [2025-01-09 21:34:01,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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:01,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 180 [2025-01-09 21:34:01,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:01,626 INFO L124 PetriNetUnfolderBase]: 11/179 cut-off events. [2025-01-09 21:34:01,626 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:34:01,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 179 events. 11/179 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 226 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 166. Up to 13 conditions per place. [2025-01-09 21:34:01,627 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 11 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2025-01-09 21:34:01,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 136 transitions, 308 flow [2025-01-09 21:34:01,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2025-01-09 21:34:01,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8314814814814815 [2025-01-09 21:34:01,629 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 274 flow. Second operand 3 states and 449 transitions. [2025-01-09 21:34:01,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 136 transitions, 308 flow [2025-01-09 21:34:01,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 136 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:01,637 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 278 flow [2025-01-09 21:34:01,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2025-01-09 21:34:01,638 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, -26 predicate places. [2025-01-09 21:34:01,638 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 278 flow [2025-01-09 21:34:01,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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:01,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:01,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:01,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:34:01,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:34:01,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash -553265260, now seen corresponding path program 1 times [2025-01-09 21:34:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:01,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55529702] [2025-01-09 21:34:01,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:01,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:01,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:34:01,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:34:01,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:01,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,718 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:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55529702] [2025-01-09 21:34:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55529702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848119466] [2025-01-09 21:34:01,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:01,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:01,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:01,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 180 [2025-01-09 21:34:01,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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:01,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 180 [2025-01-09 21:34:01,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:01,760 INFO L124 PetriNetUnfolderBase]: 11/170 cut-off events. [2025-01-09 21:34:01,760 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:34:01,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 170 events. 11/170 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 214 event pairs, 2 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 118. Up to 23 conditions per place. [2025-01-09 21:34:01,761 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 10 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2025-01-09 21:34:01,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 132 transitions, 300 flow [2025-01-09 21:34:01,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2025-01-09 21:34:01,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2025-01-09 21:34:01,763 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 278 flow. Second operand 3 states and 438 transitions. [2025-01-09 21:34:01,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 132 transitions, 300 flow [2025-01-09 21:34:01,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 132 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:01,769 INFO L231 Difference]: Finished difference. Result has 135 places, 132 transitions, 278 flow [2025-01-09 21:34:01,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=135, PETRI_TRANSITIONS=132} [2025-01-09 21:34:01,770 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, -26 predicate places. [2025-01-09 21:34:01,770 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 132 transitions, 278 flow [2025-01-09 21:34:01,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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:01,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:01,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:01,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:34:01,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:34:01,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1759705218, now seen corresponding path program 1 times [2025-01-09 21:34:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:01,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640748232] [2025-01-09 21:34:01,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:01,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:01,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:34:01,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:34:01,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:01,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,802 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:01,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640748232] [2025-01-09 21:34:01,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640748232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525890632] [2025-01-09 21:34:01,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:01,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:01,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:01,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 180 [2025-01-09 21:34:01,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 132 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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:01,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 180 [2025-01-09 21:34:01,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:01,835 INFO L124 PetriNetUnfolderBase]: 11/169 cut-off events. [2025-01-09 21:34:01,836 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:34:01,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 169 events. 11/169 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 212 event pairs, 2 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 155. Up to 21 conditions per place. [2025-01-09 21:34:01,837 INFO L140 encePairwiseOnDemand]: 178/180 looper letters, 9 selfloop transitions, 1 changer transitions 0/131 dead transitions. [2025-01-09 21:34:01,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 131 transitions, 296 flow [2025-01-09 21:34:01,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2025-01-09 21:34:01,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2025-01-09 21:34:01,838 INFO L175 Difference]: Start difference. First operand has 135 places, 132 transitions, 278 flow. Second operand 3 states and 445 transitions. [2025-01-09 21:34:01,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 131 transitions, 296 flow [2025-01-09 21:34:01,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 131 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:01,840 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 274 flow [2025-01-09 21:34:01,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2025-01-09 21:34:01,841 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, -27 predicate places. [2025-01-09 21:34:01,841 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 274 flow [2025-01-09 21:34:01,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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:01,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:01,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:34:01,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:34:01,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:01,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1924894254, now seen corresponding path program 1 times [2025-01-09 21:34:01,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:01,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942694802] [2025-01-09 21:34:01,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:01,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:01,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 21:34:01,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 21:34:01,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:01,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,888 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:01,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942694802] [2025-01-09 21:34:01,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942694802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:01,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659322849] [2025-01-09 21:34:01,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:01,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:01,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:01,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 180 [2025-01-09 21:34:01,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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:01,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 180 [2025-01-09 21:34:01,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:01,924 INFO L124 PetriNetUnfolderBase]: 11/168 cut-off events. [2025-01-09 21:34:01,924 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:34:01,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 168 events. 11/168 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 208 event pairs, 2 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 155. Up to 23 conditions per place. [2025-01-09 21:34:01,925 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 10 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2025-01-09 21:34:01,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 130 transitions, 296 flow [2025-01-09 21:34:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2025-01-09 21:34:01,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2025-01-09 21:34:01,926 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 274 flow. Second operand 3 states and 438 transitions. [2025-01-09 21:34:01,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 130 transitions, 296 flow [2025-01-09 21:34:01,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 130 transitions, 295 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:01,928 INFO L231 Difference]: Finished difference. Result has 134 places, 130 transitions, 275 flow [2025-01-09 21:34:01,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=275, PETRI_PLACES=134, PETRI_TRANSITIONS=130} [2025-01-09 21:34:01,929 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, -27 predicate places. [2025-01-09 21:34:01,929 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 130 transitions, 275 flow [2025-01-09 21:34:01,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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:01,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:01,930 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] [2025-01-09 21:34:01,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:34:01,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:34:01,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:01,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2144641730, now seen corresponding path program 1 times [2025-01-09 21:34:01,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:01,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147070645] [2025-01-09 21:34:01,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:01,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:01,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 21:34:01,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 21:34:01,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:01,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:02,393 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:02,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:02,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147070645] [2025-01-09 21:34:02,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147070645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:02,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:02,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:02,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147272947] [2025-01-09 21:34:02,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:02,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:02,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:02,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:02,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:02,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 180 [2025-01-09 21:34:02,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 130 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 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:02,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:02,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 180 [2025-01-09 21:34:02,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:02,507 INFO L124 PetriNetUnfolderBase]: 11/167 cut-off events. [2025-01-09 21:34:02,508 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:34:02,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 167 events. 11/167 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 205 event pairs, 2 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 165. Up to 28 conditions per place. [2025-01-09 21:34:02,510 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 15 selfloop transitions, 5 changer transitions 0/129 dead transitions. [2025-01-09 21:34:02,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 129 transitions, 313 flow [2025-01-09 21:34:02,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 830 transitions. [2025-01-09 21:34:02,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7685185185185185 [2025-01-09 21:34:02,512 INFO L175 Difference]: Start difference. First operand has 134 places, 130 transitions, 275 flow. Second operand 6 states and 830 transitions. [2025-01-09 21:34:02,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 129 transitions, 313 flow [2025-01-09 21:34:02,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 129 transitions, 309 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:02,526 INFO L231 Difference]: Finished difference. Result has 136 places, 129 transitions, 279 flow [2025-01-09 21:34:02,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=279, PETRI_PLACES=136, PETRI_TRANSITIONS=129} [2025-01-09 21:34:02,527 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, -25 predicate places. [2025-01-09 21:34:02,527 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 129 transitions, 279 flow [2025-01-09 21:34:02,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 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:02,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:02,527 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] [2025-01-09 21:34:02,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:34:02,527 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-01-09 21:34:02,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:02,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1245261947, now seen corresponding path program 1 times [2025-01-09 21:34:02,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:02,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991065575] [2025-01-09 21:34:02,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:02,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:02,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:34:02,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:34:02,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:02,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:02,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:02,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991065575] [2025-01-09 21:34:02,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991065575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:02,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:02,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:02,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086209860] [2025-01-09 21:34:02,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:02,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:02,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:02,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:02,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:02,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 180 [2025-01-09 21:34:02,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 129 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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:02,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:02,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 180 [2025-01-09 21:34:02,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:02,608 INFO L124 PetriNetUnfolderBase]: 11/165 cut-off events. [2025-01-09 21:34:02,608 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 21:34:02,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 165 events. 11/165 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 204 event pairs, 2 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 187. Up to 21 conditions per place. [2025-01-09 21:34:02,609 INFO L140 encePairwiseOnDemand]: 178/180 looper letters, 0 selfloop transitions, 0 changer transitions 128/128 dead transitions. [2025-01-09 21:34:02,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 128 transitions, 295 flow [2025-01-09 21:34:02,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2025-01-09 21:34:02,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2025-01-09 21:34:02,610 INFO L175 Difference]: Start difference. First operand has 136 places, 129 transitions, 279 flow. Second operand 3 states and 444 transitions. [2025-01-09 21:34:02,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 128 transitions, 295 flow [2025-01-09 21:34:02,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 128 transitions, 285 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:02,611 INFO L231 Difference]: Finished difference. Result has 132 places, 0 transitions, 0 flow [2025-01-09 21:34:02,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=132, PETRI_TRANSITIONS=0} [2025-01-09 21:34:02,612 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, -29 predicate places. [2025-01-09 21:34:02,612 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 0 transitions, 0 flow [2025-01-09 21:34:02,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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:02,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 49 remaining) [2025-01-09 21:34:02,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2025-01-09 21:34:02,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2025-01-09 21:34:02,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2025-01-09 21:34:02,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2025-01-09 21:34:02,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2025-01-09 21:34:02,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 49 remaining) [2025-01-09 21:34:02,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2025-01-09 21:34:02,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2025-01-09 21:34:02,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2025-01-09 21:34:02,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2025-01-09 21:34:02,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2025-01-09 21:34:02,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (17 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (16 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2025-01-09 21:34:02,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2025-01-09 21:34:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2025-01-09 21:34:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2025-01-09 21:34:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2025-01-09 21:34:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2025-01-09 21:34:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2025-01-09 21:34:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2025-01-09 21:34:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2025-01-09 21:34:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2025-01-09 21:34:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2025-01-09 21:34:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2025-01-09 21:34:02,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2025-01-09 21:34:02,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:34:02,619 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:02,622 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:34:02,622 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:34:02,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:34:02 BasicIcfg [2025-01-09 21:34:02,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:34:02,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:34:02,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:34:02,626 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:34:02,627 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:00" (3/4) ... [2025-01-09 21:34:02,627 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:34:02,629 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:34:02,629 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:34:02,632 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-09 21:34:02,632 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:34:02,632 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:34:02,632 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:34:02,686 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:34:02,686 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:34:02,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:34:02,687 INFO L158 Benchmark]: Toolchain (without parser) took 2642.30ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 100.6MB in the end (delta: 20.3MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2025-01-09 21:34:02,687 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:02,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.83ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 108.6MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:02,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.69ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:02,688 INFO L158 Benchmark]: Boogie Preprocessor took 42.77ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 105.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:02,688 INFO L158 Benchmark]: RCFGBuilder took 555.88ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 47.6MB in the end (delta: 57.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 21:34:02,689 INFO L158 Benchmark]: TraceAbstraction took 1646.95ms. Allocated memory is still 167.8MB. Free memory was 47.1MB in the beginning and 105.9MB in the end (delta: -58.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:02,689 INFO L158 Benchmark]: Witness Printer took 60.12ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 100.6MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:02,690 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.12ms. Allocated memory is still 184.5MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.83ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 108.6MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.69ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.9MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.77ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 105.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 555.88ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 47.6MB in the end (delta: 57.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1646.95ms. Allocated memory is still 167.8MB. Free memory was 47.1MB in the beginning and 105.9MB in the end (delta: -58.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.12ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 100.6MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. 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: 49]: 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: 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: 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: 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: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: 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, 214 locations, 49 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.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 37 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=0, InterpolantAutomatonStates: 30, 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.7s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 28 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:34:02,708 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